./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/hard2_valuebound20.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 574ddb4e Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/hard2_valuebound20.c -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 1619c1c02ba7c9b660af32e6427e3b3d5cd6ca3ff286b9db386918ae0c8b508c --- Real Ultimate output --- This is Ultimate 0.2.2-?-574ddb4 [2023-02-18 18:25:18,975 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-18 18:25:18,977 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-18 18:25:19,001 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-18 18:25:19,002 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-18 18:25:19,004 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-18 18:25:19,005 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-18 18:25:19,007 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-18 18:25:19,008 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-18 18:25:19,011 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-18 18:25:19,012 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-18 18:25:19,014 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-18 18:25:19,014 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-18 18:25:19,015 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-18 18:25:19,016 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-18 18:25:19,017 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-18 18:25:19,018 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-18 18:25:19,019 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-18 18:25:19,020 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-18 18:25:19,026 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-18 18:25:19,027 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-18 18:25:19,028 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-18 18:25:19,028 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-18 18:25:19,029 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-18 18:25:19,034 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-18 18:25:19,035 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-18 18:25:19,035 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-18 18:25:19,036 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-18 18:25:19,036 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-18 18:25:19,037 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-18 18:25:19,037 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-18 18:25:19,037 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-18 18:25:19,038 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-18 18:25:19,039 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-18 18:25:19,040 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-18 18:25:19,040 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-18 18:25:19,040 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-18 18:25:19,040 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-18 18:25:19,041 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-18 18:25:19,042 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-18 18:25:19,042 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-18 18:25:19,044 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-18 18:25:19,065 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-18 18:25:19,066 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-18 18:25:19,066 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-18 18:25:19,066 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-18 18:25:19,067 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-18 18:25:19,067 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-18 18:25:19,067 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-18 18:25:19,067 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-18 18:25:19,068 INFO L138 SettingsManager]: * Use SBE=true [2023-02-18 18:25:19,068 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-18 18:25:19,068 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-18 18:25:19,068 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-18 18:25:19,069 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-18 18:25:19,069 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-18 18:25:19,069 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-18 18:25:19,069 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-18 18:25:19,069 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-18 18:25:19,069 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-18 18:25:19,069 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-18 18:25:19,069 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-18 18:25:19,070 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-18 18:25:19,070 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-18 18:25:19,070 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-18 18:25:19,070 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-18 18:25:19,071 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 18:25:19,071 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-18 18:25:19,071 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-18 18:25:19,071 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-18 18:25:19,071 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-18 18:25:19,071 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-18 18:25:19,072 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-18 18:25:19,072 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-18 18:25:19,072 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-18 18:25:19,072 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-18 18:25:19,072 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-18 18:25:19,072 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 -> 1619c1c02ba7c9b660af32e6427e3b3d5cd6ca3ff286b9db386918ae0c8b508c [2023-02-18 18:25:19,263 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-18 18:25:19,280 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-18 18:25:19,282 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-18 18:25:19,283 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-18 18:25:19,283 INFO L275 PluginConnector]: CDTParser initialized [2023-02-18 18:25:19,284 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/hard2_valuebound20.c [2023-02-18 18:25:20,129 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-18 18:25:20,308 INFO L351 CDTParser]: Found 1 translation units. [2023-02-18 18:25:20,310 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/hard2_valuebound20.c [2023-02-18 18:25:20,314 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6b97185a/e434566016ad4d4eb494cc503c795e53/FLAG55505b7cb [2023-02-18 18:25:20,323 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6b97185a/e434566016ad4d4eb494cc503c795e53 [2023-02-18 18:25:20,325 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-18 18:25:20,326 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-18 18:25:20,327 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-18 18:25:20,327 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-18 18:25:20,329 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-18 18:25:20,329 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 06:25:20" (1/1) ... [2023-02-18 18:25:20,330 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@386e5d60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 06:25:20, skipping insertion in model container [2023-02-18 18:25:20,330 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 06:25:20" (1/1) ... [2023-02-18 18:25:20,335 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-18 18:25:20,357 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-18 18:25:20,445 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/nla-digbench-scaling/hard2_valuebound20.c[526,539] [2023-02-18 18:25:20,462 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 18:25:20,473 INFO L203 MainTranslator]: Completed pre-run [2023-02-18 18:25:20,485 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/nla-digbench-scaling/hard2_valuebound20.c[526,539] [2023-02-18 18:25:20,497 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 18:25:20,505 INFO L208 MainTranslator]: Completed translation [2023-02-18 18:25:20,506 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 06:25:20 WrapperNode [2023-02-18 18:25:20,506 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-18 18:25:20,507 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-18 18:25:20,507 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-18 18:25:20,507 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-18 18:25:20,511 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 06:25:20" (1/1) ... [2023-02-18 18:25:20,516 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 06:25:20" (1/1) ... [2023-02-18 18:25:20,531 INFO L138 Inliner]: procedures = 14, calls = 23, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 64 [2023-02-18 18:25:20,532 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-18 18:25:20,533 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-18 18:25:20,533 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-18 18:25:20,533 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-18 18:25:20,539 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 06:25:20" (1/1) ... [2023-02-18 18:25:20,539 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 06:25:20" (1/1) ... [2023-02-18 18:25:20,548 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 06:25:20" (1/1) ... [2023-02-18 18:25:20,548 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 06:25:20" (1/1) ... [2023-02-18 18:25:20,553 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 06:25:20" (1/1) ... [2023-02-18 18:25:20,557 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 06:25:20" (1/1) ... [2023-02-18 18:25:20,560 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 06:25:20" (1/1) ... [2023-02-18 18:25:20,564 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 06:25:20" (1/1) ... [2023-02-18 18:25:20,565 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-18 18:25:20,567 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-18 18:25:20,567 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-18 18:25:20,567 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-18 18:25:20,568 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 06:25:20" (1/1) ... [2023-02-18 18:25:20,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 18:25:20,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 18:25:20,586 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-18 18:25:20,592 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-18 18:25:20,616 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-18 18:25:20,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-18 18:25:20,617 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-18 18:25:20,617 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-18 18:25:20,617 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-02-18 18:25:20,619 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-02-18 18:25:20,659 INFO L235 CfgBuilder]: Building ICFG [2023-02-18 18:25:20,660 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-18 18:25:20,749 INFO L276 CfgBuilder]: Performing block encoding [2023-02-18 18:25:20,753 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-18 18:25:20,753 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2023-02-18 18:25:20,754 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 06:25:20 BoogieIcfgContainer [2023-02-18 18:25:20,754 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-18 18:25:20,755 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-18 18:25:20,755 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-18 18:25:20,757 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-18 18:25:20,757 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.02 06:25:20" (1/3) ... [2023-02-18 18:25:20,758 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37726de2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 06:25:20, skipping insertion in model container [2023-02-18 18:25:20,758 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 06:25:20" (2/3) ... [2023-02-18 18:25:20,758 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37726de2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 06:25:20, skipping insertion in model container [2023-02-18 18:25:20,758 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 06:25:20" (3/3) ... [2023-02-18 18:25:20,759 INFO L112 eAbstractionObserver]: Analyzing ICFG hard2_valuebound20.c [2023-02-18 18:25:20,782 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-18 18:25:20,782 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-18 18:25:20,814 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-18 18:25:20,819 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;@352c0811, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-18 18:25:20,819 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-18 18:25:20,821 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 16 states have (on average 1.625) internal successors, (26), 17 states have internal predecessors, (26), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-18 18:25:20,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-18 18:25:20,826 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 18:25:20,826 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 18:25:20,827 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 18:25:20,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 18:25:20,830 INFO L85 PathProgramCache]: Analyzing trace with hash -586848446, now seen corresponding path program 1 times [2023-02-18 18:25:20,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 18:25:20,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788970430] [2023-02-18 18:25:20,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 18:25:20,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 18:25:20,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 18:25:20,936 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-18 18:25:20,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 18:25:20,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788970430] [2023-02-18 18:25:20,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788970430] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 18:25:20,937 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 18:25:20,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-18 18:25:20,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201665728] [2023-02-18 18:25:20,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 18:25:20,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-18 18:25:20,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 18:25:20,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-18 18:25:20,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-18 18:25:20,968 INFO L87 Difference]: Start difference. First operand has 26 states, 16 states have (on average 1.625) internal successors, (26), 17 states have internal predecessors, (26), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 18:25:20,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 18:25:20,981 INFO L93 Difference]: Finished difference Result 49 states and 83 transitions. [2023-02-18 18:25:20,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-18 18:25:20,983 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-02-18 18:25:20,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 18:25:20,987 INFO L225 Difference]: With dead ends: 49 [2023-02-18 18:25:20,987 INFO L226 Difference]: Without dead ends: 22 [2023-02-18 18:25:20,989 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-18 18:25:20,991 INFO L413 NwaCegarLoop]: 34 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, 34 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-18 18:25:20,992 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 18:25:21,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-02-18 18:25:21,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2023-02-18 18:25:21,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-18 18:25:21,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 30 transitions. [2023-02-18 18:25:21,016 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 30 transitions. Word has length 9 [2023-02-18 18:25:21,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 18:25:21,017 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 30 transitions. [2023-02-18 18:25:21,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 18:25:21,017 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 30 transitions. [2023-02-18 18:25:21,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-18 18:25:21,018 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 18:25:21,018 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 18:25:21,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-18 18:25:21,018 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 18:25:21,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 18:25:21,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1188158916, now seen corresponding path program 1 times [2023-02-18 18:25:21,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 18:25:21,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398626246] [2023-02-18 18:25:21,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 18:25:21,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 18:25:21,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 18:25:21,134 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-18 18:25:21,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 18:25:21,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398626246] [2023-02-18 18:25:21,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398626246] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 18:25:21,135 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 18:25:21,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-18 18:25:21,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431293781] [2023-02-18 18:25:21,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 18:25:21,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-18 18:25:21,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 18:25:21,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-18 18:25:21,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-18 18:25:21,138 INFO L87 Difference]: Start difference. First operand 22 states and 30 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 18:25:21,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 18:25:21,173 INFO L93 Difference]: Finished difference Result 35 states and 47 transitions. [2023-02-18 18:25:21,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-18 18:25:21,174 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-02-18 18:25:21,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 18:25:21,174 INFO L225 Difference]: With dead ends: 35 [2023-02-18 18:25:21,174 INFO L226 Difference]: Without dead ends: 33 [2023-02-18 18:25:21,175 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-18 18:25:21,176 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 12 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 18:25:21,176 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 92 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 18:25:21,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2023-02-18 18:25:21,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 26. [2023-02-18 18:25:21,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-18 18:25:21,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2023-02-18 18:25:21,194 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 9 [2023-02-18 18:25:21,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 18:25:21,195 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2023-02-18 18:25:21,195 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 18:25:21,195 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2023-02-18 18:25:21,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-02-18 18:25:21,196 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 18:25:21,196 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 18:25:21,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-18 18:25:21,196 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 18:25:21,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 18:25:21,197 INFO L85 PathProgramCache]: Analyzing trace with hash -697944935, now seen corresponding path program 1 times [2023-02-18 18:25:21,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 18:25:21,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319744915] [2023-02-18 18:25:21,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 18:25:21,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 18:25:21,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 18:25:21,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-18 18:25:21,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 18:25:21,281 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 18:25:21,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 18:25:21,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319744915] [2023-02-18 18:25:21,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319744915] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 18:25:21,286 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 18:25:21,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-18 18:25:21,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110802800] [2023-02-18 18:25:21,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 18:25:21,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-18 18:25:21,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 18:25:21,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-18 18:25:21,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-18 18:25:21,290 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-18 18:25:21,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 18:25:21,349 INFO L93 Difference]: Finished difference Result 39 states and 50 transitions. [2023-02-18 18:25:21,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-18 18:25:21,350 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2023-02-18 18:25:21,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 18:25:21,351 INFO L225 Difference]: With dead ends: 39 [2023-02-18 18:25:21,351 INFO L226 Difference]: Without dead ends: 37 [2023-02-18 18:25:21,351 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 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-18 18:25:21,352 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 10 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 18:25:21,352 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 88 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 18:25:21,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2023-02-18 18:25:21,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 30. [2023-02-18 18:25:21,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-18 18:25:21,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2023-02-18 18:25:21,359 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 14 [2023-02-18 18:25:21,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 18:25:21,359 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2023-02-18 18:25:21,360 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-18 18:25:21,360 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2023-02-18 18:25:21,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-18 18:25:21,360 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 18:25:21,360 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 18:25:21,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-18 18:25:21,361 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 18:25:21,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 18:25:21,361 INFO L85 PathProgramCache]: Analyzing trace with hash 262992548, now seen corresponding path program 1 times [2023-02-18 18:25:21,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 18:25:21,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357141575] [2023-02-18 18:25:21,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 18:25:21,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 18:25:21,371 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 18:25:21,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1384530583] [2023-02-18 18:25:21,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 18:25:21,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 18:25:21,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 18:25:21,376 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-18 18:25:21,377 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-18 18:25:21,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 18:25:21,429 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 19 conjunts are in the unsatisfiable core [2023-02-18 18:25:21,434 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 18:25:21,495 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-18 18:25:21,496 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 18:25:21,611 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-18 18:25:21,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 18:25:21,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357141575] [2023-02-18 18:25:21,612 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 18:25:21,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1384530583] [2023-02-18 18:25:21,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1384530583] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 18:25:21,612 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 18:25:21,613 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2023-02-18 18:25:21,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326681449] [2023-02-18 18:25:21,613 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 18:25:21,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-18 18:25:21,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 18:25:21,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-18 18:25:21,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2023-02-18 18:25:21,615 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand has 12 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-18 18:25:21,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 18:25:21,794 INFO L93 Difference]: Finished difference Result 65 states and 84 transitions. [2023-02-18 18:25:21,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-18 18:25:21,794 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) Word has length 19 [2023-02-18 18:25:21,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 18:25:21,796 INFO L225 Difference]: With dead ends: 65 [2023-02-18 18:25:21,796 INFO L226 Difference]: Without dead ends: 51 [2023-02-18 18:25:21,796 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2023-02-18 18:25:21,797 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 30 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-18 18:25:21,798 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 48 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-18 18:25:21,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2023-02-18 18:25:21,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2023-02-18 18:25:21,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 33 states have internal predecessors, (35), 15 states have call successors, (15), 5 states have call predecessors, (15), 5 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2023-02-18 18:25:21,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 63 transitions. [2023-02-18 18:25:21,814 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 63 transitions. Word has length 19 [2023-02-18 18:25:21,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 18:25:21,815 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 63 transitions. [2023-02-18 18:25:21,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-18 18:25:21,815 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 63 transitions. [2023-02-18 18:25:21,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-18 18:25:21,816 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 18:25:21,816 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 18:25:21,840 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-18 18:25:22,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 18:25:22,035 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 18:25:22,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 18:25:22,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1807142342, now seen corresponding path program 1 times [2023-02-18 18:25:22,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 18:25:22,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489498002] [2023-02-18 18:25:22,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 18:25:22,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 18:25:22,046 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 18:25:22,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [117368129] [2023-02-18 18:25:22,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 18:25:22,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 18:25:22,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 18:25:22,056 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-18 18:25:22,057 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-18 18:25:22,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 18:25:22,109 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-18 18:25:22,110 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 18:25:22,148 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-02-18 18:25:22,148 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 18:25:22,227 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-02-18 18:25:22,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 18:25:22,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489498002] [2023-02-18 18:25:22,228 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 18:25:22,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [117368129] [2023-02-18 18:25:22,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [117368129] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 18:25:22,229 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 18:25:22,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2023-02-18 18:25:22,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156915770] [2023-02-18 18:25:22,229 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 18:25:22,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-18 18:25:22,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 18:25:22,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-18 18:25:22,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2023-02-18 18:25:22,231 INFO L87 Difference]: Start difference. First operand 51 states and 63 transitions. Second operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 states have internal predecessors, (24), 3 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2023-02-18 18:25:22,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 18:25:22,329 INFO L93 Difference]: Finished difference Result 66 states and 83 transitions. [2023-02-18 18:25:22,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-18 18:25:22,329 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 states have internal predecessors, (24), 3 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Word has length 26 [2023-02-18 18:25:22,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 18:25:22,331 INFO L225 Difference]: With dead ends: 66 [2023-02-18 18:25:22,332 INFO L226 Difference]: Without dead ends: 59 [2023-02-18 18:25:22,332 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2023-02-18 18:25:22,335 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 24 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 18:25:22,336 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 67 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 18:25:22,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2023-02-18 18:25:22,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2023-02-18 18:25:22,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 39 states have internal predecessors, (41), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (15), 12 states have call predecessors, (15), 15 states have call successors, (15) [2023-02-18 18:25:22,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 72 transitions. [2023-02-18 18:25:22,359 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 72 transitions. Word has length 26 [2023-02-18 18:25:22,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 18:25:22,359 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 72 transitions. [2023-02-18 18:25:22,360 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 states have internal predecessors, (24), 3 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2023-02-18 18:25:22,360 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 72 transitions. [2023-02-18 18:25:22,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-02-18 18:25:22,362 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 18:25:22,362 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 18:25:22,381 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-02-18 18:25:22,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 18:25:22,567 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 18:25:22,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 18:25:22,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1034157389, now seen corresponding path program 1 times [2023-02-18 18:25:22,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 18:25:22,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17758695] [2023-02-18 18:25:22,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 18:25:22,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 18:25:22,591 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 18:25:22,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [354732484] [2023-02-18 18:25:22,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 18:25:22,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 18:25:22,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 18:25:22,593 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 18:25:22,597 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-18 18:25:22,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 18:25:22,647 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 33 conjunts are in the unsatisfiable core [2023-02-18 18:25:22,652 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 18:25:22,729 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 15 proven. 29 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2023-02-18 18:25:22,730 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 18:25:22,918 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 15 proven. 29 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2023-02-18 18:25:22,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 18:25:22,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17758695] [2023-02-18 18:25:22,919 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 18:25:22,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [354732484] [2023-02-18 18:25:22,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [354732484] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 18:25:22,920 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 18:25:22,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2023-02-18 18:25:22,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112634581] [2023-02-18 18:25:22,921 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 18:25:22,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-02-18 18:25:22,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 18:25:22,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-02-18 18:25:22,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2023-02-18 18:25:22,925 INFO L87 Difference]: Start difference. First operand 58 states and 72 transitions. Second operand has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 14 states have internal predecessors, (34), 7 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (16), 4 states have call predecessors, (16), 5 states have call successors, (16) [2023-02-18 18:25:23,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 18:25:23,662 INFO L93 Difference]: Finished difference Result 142 states and 193 transitions. [2023-02-18 18:25:23,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-18 18:25:23,663 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 14 states have internal predecessors, (34), 7 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (16), 4 states have call predecessors, (16), 5 states have call successors, (16) Word has length 56 [2023-02-18 18:25:23,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 18:25:23,664 INFO L225 Difference]: With dead ends: 142 [2023-02-18 18:25:23,664 INFO L226 Difference]: Without dead ends: 111 [2023-02-18 18:25:23,665 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 94 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2023-02-18 18:25:23,665 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 46 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 522 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-18 18:25:23,665 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 116 Invalid, 590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 522 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-18 18:25:23,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2023-02-18 18:25:23,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 106. [2023-02-18 18:25:23,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 64 states have (on average 1.203125) internal successors, (77), 71 states have internal predecessors, (77), 31 states have call successors, (31), 10 states have call predecessors, (31), 10 states have return successors, (30), 24 states have call predecessors, (30), 30 states have call successors, (30) [2023-02-18 18:25:23,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 138 transitions. [2023-02-18 18:25:23,701 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 138 transitions. Word has length 56 [2023-02-18 18:25:23,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 18:25:23,701 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 138 transitions. [2023-02-18 18:25:23,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 14 states have internal predecessors, (34), 7 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (16), 4 states have call predecessors, (16), 5 states have call successors, (16) [2023-02-18 18:25:23,701 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 138 transitions. [2023-02-18 18:25:23,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-02-18 18:25:23,706 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 18:25:23,706 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 18:25:23,713 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-18 18:25:23,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 18:25:23,912 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 18:25:23,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 18:25:23,913 INFO L85 PathProgramCache]: Analyzing trace with hash -1199454569, now seen corresponding path program 1 times [2023-02-18 18:25:23,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 18:25:23,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422550593] [2023-02-18 18:25:23,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 18:25:23,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 18:25:23,925 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 18:25:23,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [542966734] [2023-02-18 18:25:23,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 18:25:23,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 18:25:23,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 18:25:23,928 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 18:25:23,930 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-18 18:25:23,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 18:25:23,970 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 35 conjunts are in the unsatisfiable core [2023-02-18 18:25:23,972 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 18:25:24,012 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 19 proven. 37 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2023-02-18 18:25:24,012 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 18:25:24,158 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 19 proven. 37 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2023-02-18 18:25:24,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 18:25:24,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422550593] [2023-02-18 18:25:24,158 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 18:25:24,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [542966734] [2023-02-18 18:25:24,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [542966734] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 18:25:24,159 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 18:25:24,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2023-02-18 18:25:24,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486474716] [2023-02-18 18:25:24,159 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 18:25:24,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-02-18 18:25:24,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 18:25:24,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-02-18 18:25:24,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2023-02-18 18:25:24,163 INFO L87 Difference]: Start difference. First operand 106 states and 138 transitions. Second operand has 16 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 15 states have internal predecessors, (36), 8 states have call successors, (22), 3 states have call predecessors, (22), 2 states have return successors, (20), 5 states have call predecessors, (20), 6 states have call successors, (20) [2023-02-18 18:25:25,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 18:25:25,046 INFO L93 Difference]: Finished difference Result 161 states and 210 transitions. [2023-02-18 18:25:25,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-18 18:25:25,046 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 15 states have internal predecessors, (36), 8 states have call successors, (22), 3 states have call predecessors, (22), 2 states have return successors, (20), 5 states have call predecessors, (20), 6 states have call successors, (20) Word has length 67 [2023-02-18 18:25:25,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 18:25:25,047 INFO L225 Difference]: With dead ends: 161 [2023-02-18 18:25:25,047 INFO L226 Difference]: Without dead ends: 123 [2023-02-18 18:25:25,048 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 115 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=325, Unknown=0, NotChecked=0, Total=420 [2023-02-18 18:25:25,048 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 24 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 496 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-02-18 18:25:25,049 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 103 Invalid, 533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 496 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-02-18 18:25:25,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2023-02-18 18:25:25,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 101. [2023-02-18 18:25:25,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 62 states have (on average 1.1612903225806452) internal successors, (72), 66 states have internal predecessors, (72), 27 states have call successors, (27), 11 states have call predecessors, (27), 11 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2023-02-18 18:25:25,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 125 transitions. [2023-02-18 18:25:25,066 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 125 transitions. Word has length 67 [2023-02-18 18:25:25,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 18:25:25,067 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 125 transitions. [2023-02-18 18:25:25,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 15 states have internal predecessors, (36), 8 states have call successors, (22), 3 states have call predecessors, (22), 2 states have return successors, (20), 5 states have call predecessors, (20), 6 states have call successors, (20) [2023-02-18 18:25:25,067 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 125 transitions. [2023-02-18 18:25:25,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-02-18 18:25:25,068 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 18:25:25,068 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 18:25:25,074 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-02-18 18:25:25,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 18:25:25,273 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 18:25:25,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 18:25:25,273 INFO L85 PathProgramCache]: Analyzing trace with hash 1728532070, now seen corresponding path program 1 times [2023-02-18 18:25:25,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 18:25:25,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086802775] [2023-02-18 18:25:25,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 18:25:25,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 18:25:25,291 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 18:25:25,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1301723891] [2023-02-18 18:25:25,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 18:25:25,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 18:25:25,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 18:25:25,296 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 18:25:25,298 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-18 18:25:25,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 18:25:25,342 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 22 conjunts are in the unsatisfiable core [2023-02-18 18:25:25,349 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 18:25:25,373 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-02-18 18:25:25,373 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 18:25:25,471 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-02-18 18:25:25,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 18:25:25,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086802775] [2023-02-18 18:25:25,472 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 18:25:25,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1301723891] [2023-02-18 18:25:25,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1301723891] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 18:25:25,472 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 18:25:25,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2023-02-18 18:25:25,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484509605] [2023-02-18 18:25:25,472 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 18:25:25,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-18 18:25:25,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 18:25:25,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-18 18:25:25,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2023-02-18 18:25:25,474 INFO L87 Difference]: Start difference. First operand 101 states and 125 transitions. Second operand has 12 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 6 states have call successors, (24), 3 states have call predecessors, (24), 1 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) [2023-02-18 18:25:25,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 18:25:25,664 INFO L93 Difference]: Finished difference Result 120 states and 144 transitions. [2023-02-18 18:25:25,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-18 18:25:25,665 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 6 states have call successors, (24), 3 states have call predecessors, (24), 1 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) Word has length 72 [2023-02-18 18:25:25,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 18:25:25,665 INFO L225 Difference]: With dead ends: 120 [2023-02-18 18:25:25,665 INFO L226 Difference]: Without dead ends: 93 [2023-02-18 18:25:25,666 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2023-02-18 18:25:25,666 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 10 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 18:25:25,666 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 187 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 18:25:25,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2023-02-18 18:25:25,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2023-02-18 18:25:25,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 58 states have (on average 1.1206896551724137) internal successors, (65), 61 states have internal predecessors, (65), 23 states have call successors, (23), 11 states have call predecessors, (23), 11 states have return successors, (22), 20 states have call predecessors, (22), 22 states have call successors, (22) [2023-02-18 18:25:25,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 110 transitions. [2023-02-18 18:25:25,681 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 110 transitions. Word has length 72 [2023-02-18 18:25:25,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 18:25:25,681 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 110 transitions. [2023-02-18 18:25:25,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 6 states have call successors, (24), 3 states have call predecessors, (24), 1 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) [2023-02-18 18:25:25,681 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 110 transitions. [2023-02-18 18:25:25,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-02-18 18:25:25,682 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 18:25:25,682 INFO L195 NwaCegarLoop]: trace histogram [14, 13, 13, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 18:25:25,691 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-02-18 18:25:25,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 18:25:25,889 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 18:25:25,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 18:25:25,889 INFO L85 PathProgramCache]: Analyzing trace with hash 1412721000, now seen corresponding path program 1 times [2023-02-18 18:25:25,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 18:25:25,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934712744] [2023-02-18 18:25:25,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 18:25:25,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 18:25:25,895 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 18:25:25,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [512047471] [2023-02-18 18:25:25,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 18:25:25,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 18:25:25,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 18:25:25,896 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 18:25:25,898 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-02-18 18:25:25,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 18:25:25,938 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-18 18:25:25,940 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 18:25:26,009 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 230 trivial. 0 not checked. [2023-02-18 18:25:26,010 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 18:25:26,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 18:25:26,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934712744] [2023-02-18 18:25:26,011 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 18:25:26,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [512047471] [2023-02-18 18:25:26,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [512047471] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 18:25:26,011 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 18:25:26,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-18 18:25:26,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123398980] [2023-02-18 18:25:26,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 18:25:26,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-18 18:25:26,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 18:25:26,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-18 18:25:26,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-02-18 18:25:26,013 INFO L87 Difference]: Start difference. First operand 93 states and 110 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2023-02-18 18:25:26,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 18:25:26,150 INFO L93 Difference]: Finished difference Result 125 states and 151 transitions. [2023-02-18 18:25:26,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-18 18:25:26,152 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) Word has length 86 [2023-02-18 18:25:26,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 18:25:26,152 INFO L225 Difference]: With dead ends: 125 [2023-02-18 18:25:26,153 INFO L226 Difference]: Without dead ends: 88 [2023-02-18 18:25:26,153 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 76 SyntacticMatches, 5 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-02-18 18:25:26,153 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 6 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 18:25:26,154 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 101 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 18:25:26,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2023-02-18 18:25:26,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 79. [2023-02-18 18:25:26,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 50 states have (on average 1.08) internal successors, (54), 52 states have internal predecessors, (54), 18 states have call successors, (18), 10 states have call predecessors, (18), 10 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2023-02-18 18:25:26,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 89 transitions. [2023-02-18 18:25:26,188 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 89 transitions. Word has length 86 [2023-02-18 18:25:26,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 18:25:26,188 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 89 transitions. [2023-02-18 18:25:26,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2023-02-18 18:25:26,188 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 89 transitions. [2023-02-18 18:25:26,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-02-18 18:25:26,189 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 18:25:26,189 INFO L195 NwaCegarLoop]: trace histogram [14, 13, 13, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 18:25:26,196 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-02-18 18:25:26,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 18:25:26,396 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 18:25:26,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 18:25:26,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1193302554, now seen corresponding path program 2 times [2023-02-18 18:25:26,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 18:25:26,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764855928] [2023-02-18 18:25:26,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 18:25:26,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 18:25:26,402 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 18:25:26,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1208378277] [2023-02-18 18:25:26,402 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-18 18:25:26,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 18:25:26,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 18:25:26,404 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 18:25:26,405 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-02-18 18:25:26,449 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-18 18:25:26,449 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 18:25:26,451 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 45 conjunts are in the unsatisfiable core [2023-02-18 18:25:26,453 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 18:25:26,518 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 28 proven. 58 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2023-02-18 18:25:26,519 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 18:25:29,543 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 28 proven. 58 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2023-02-18 18:25:29,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 18:25:29,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764855928] [2023-02-18 18:25:29,544 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 18:25:29,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1208378277] [2023-02-18 18:25:29,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1208378277] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 18:25:29,544 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 18:25:29,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2023-02-18 18:25:29,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612778187] [2023-02-18 18:25:29,544 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 18:25:29,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-02-18 18:25:29,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 18:25:29,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-02-18 18:25:29,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=338, Unknown=0, NotChecked=0, Total=420 [2023-02-18 18:25:29,545 INFO L87 Difference]: Start difference. First operand 79 states and 89 transitions. Second operand has 21 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 19 states have internal predecessors, (44), 11 states have call successors, (28), 3 states have call predecessors, (28), 2 states have return successors, (26), 9 states have call predecessors, (26), 9 states have call successors, (26) [2023-02-18 18:25:32,947 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 18:25:36,562 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 18:25:39,122 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 18:25:40,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 18:25:40,147 INFO L93 Difference]: Finished difference Result 159 states and 203 transitions. [2023-02-18 18:25:40,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-02-18 18:25:40,148 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 19 states have internal predecessors, (44), 11 states have call successors, (28), 3 states have call predecessors, (28), 2 states have return successors, (26), 9 states have call predecessors, (26), 9 states have call successors, (26) Word has length 86 [2023-02-18 18:25:40,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 18:25:40,149 INFO L225 Difference]: With dead ends: 159 [2023-02-18 18:25:40,149 INFO L226 Difference]: Without dead ends: 134 [2023-02-18 18:25:40,153 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 147 SyntacticMatches, 4 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=151, Invalid=551, Unknown=0, NotChecked=0, Total=702 [2023-02-18 18:25:40,153 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 82 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 937 mSolverCounterSat, 126 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 1064 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 937 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.0s IncrementalHoareTripleChecker+Time [2023-02-18 18:25:40,153 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 184 Invalid, 1064 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 937 Invalid, 1 Unknown, 0 Unchecked, 10.0s Time] [2023-02-18 18:25:40,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2023-02-18 18:25:40,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 130. [2023-02-18 18:25:40,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 80 states have (on average 1.1375) internal successors, (91), 86 states have internal predecessors, (91), 36 states have call successors, (36), 13 states have call predecessors, (36), 13 states have return successors, (35), 30 states have call predecessors, (35), 35 states have call successors, (35) [2023-02-18 18:25:40,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 162 transitions. [2023-02-18 18:25:40,213 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 162 transitions. Word has length 86 [2023-02-18 18:25:40,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 18:25:40,214 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 162 transitions. [2023-02-18 18:25:40,215 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 19 states have internal predecessors, (44), 11 states have call successors, (28), 3 states have call predecessors, (28), 2 states have return successors, (26), 9 states have call predecessors, (26), 9 states have call successors, (26) [2023-02-18 18:25:40,215 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 162 transitions. [2023-02-18 18:25:40,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2023-02-18 18:25:40,217 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 18:25:40,217 INFO L195 NwaCegarLoop]: trace histogram [16, 15, 15, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 18:25:40,224 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-02-18 18:25:40,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 18:25:40,424 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 18:25:40,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 18:25:40,425 INFO L85 PathProgramCache]: Analyzing trace with hash -1474759586, now seen corresponding path program 2 times [2023-02-18 18:25:40,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 18:25:40,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542713349] [2023-02-18 18:25:40,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 18:25:40,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 18:25:40,430 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 18:25:40,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [62083042] [2023-02-18 18:25:40,431 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-18 18:25:40,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 18:25:40,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 18:25:40,432 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 18:25:40,434 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-02-18 18:25:40,481 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-18 18:25:40,481 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 18:25:40,483 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 50 conjunts are in the unsatisfiable core [2023-02-18 18:25:40,484 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 18:25:40,551 INFO L134 CoverageAnalysis]: Checked inductivity of 478 backedges. 38 proven. 62 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2023-02-18 18:25:40,551 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 18:25:44,805 INFO L134 CoverageAnalysis]: Checked inductivity of 478 backedges. 38 proven. 62 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2023-02-18 18:25:44,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 18:25:44,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542713349] [2023-02-18 18:25:44,806 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 18:25:44,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [62083042] [2023-02-18 18:25:44,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [62083042] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 18:25:44,806 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 18:25:44,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 22 [2023-02-18 18:25:44,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006432520] [2023-02-18 18:25:44,806 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 18:25:44,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-02-18 18:25:44,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 18:25:44,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-02-18 18:25:44,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2023-02-18 18:25:44,808 INFO L87 Difference]: Start difference. First operand 130 states and 162 transitions. Second operand has 22 states, 20 states have (on average 2.3) internal successors, (46), 21 states have internal predecessors, (46), 13 states have call successors, (32), 3 states have call predecessors, (32), 2 states have return successors, (30), 10 states have call predecessors, (30), 11 states have call successors, (30) [2023-02-18 18:25:46,456 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 18:25:50,080 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 18:25:54,213 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 18:25:55,551 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 18:25:59,724 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 18:26:03,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 18:26:03,791 INFO L93 Difference]: Finished difference Result 196 states and 253 transitions. [2023-02-18 18:26:03,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-02-18 18:26:03,792 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 2.3) internal successors, (46), 21 states have internal predecessors, (46), 13 states have call successors, (32), 3 states have call predecessors, (32), 2 states have return successors, (30), 10 states have call predecessors, (30), 11 states have call successors, (30) Word has length 97 [2023-02-18 18:26:03,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 18:26:03,793 INFO L225 Difference]: With dead ends: 196 [2023-02-18 18:26:03,793 INFO L226 Difference]: Without dead ends: 151 [2023-02-18 18:26:03,793 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 169 SyntacticMatches, 5 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=245, Invalid=811, Unknown=0, NotChecked=0, Total=1056 [2023-02-18 18:26:03,794 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 39 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 835 mSolverCounterSat, 91 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 928 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 835 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.6s IncrementalHoareTripleChecker+Time [2023-02-18 18:26:03,794 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 159 Invalid, 928 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 835 Invalid, 2 Unknown, 0 Unchecked, 12.6s Time] [2023-02-18 18:26:03,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2023-02-18 18:26:03,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 126. [2023-02-18 18:26:03,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 79 states have (on average 1.0886075949367089) internal successors, (86), 83 states have internal predecessors, (86), 31 states have call successors, (31), 15 states have call predecessors, (31), 15 states have return successors, (30), 27 states have call predecessors, (30), 30 states have call successors, (30) [2023-02-18 18:26:03,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 147 transitions. [2023-02-18 18:26:03,851 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 147 transitions. Word has length 97 [2023-02-18 18:26:03,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 18:26:03,851 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 147 transitions. [2023-02-18 18:26:03,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 20 states have (on average 2.3) internal successors, (46), 21 states have internal predecessors, (46), 13 states have call successors, (32), 3 states have call predecessors, (32), 2 states have return successors, (30), 10 states have call predecessors, (30), 11 states have call successors, (30) [2023-02-18 18:26:03,852 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 147 transitions. [2023-02-18 18:26:03,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2023-02-18 18:26:03,852 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 18:26:03,853 INFO L195 NwaCegarLoop]: trace histogram [17, 16, 16, 3, 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] [2023-02-18 18:26:03,857 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-02-18 18:26:04,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-02-18 18:26:04,057 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 18:26:04,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 18:26:04,057 INFO L85 PathProgramCache]: Analyzing trace with hash -1149721345, now seen corresponding path program 2 times [2023-02-18 18:26:04,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 18:26:04,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369848240] [2023-02-18 18:26:04,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 18:26:04,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 18:26:04,062 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 18:26:04,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [556220259] [2023-02-18 18:26:04,063 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-18 18:26:04,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 18:26:04,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 18:26:04,064 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 18:26:04,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-02-18 18:26:04,119 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-18 18:26:04,119 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 18:26:04,121 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 39 conjunts are in the unsatisfiable core [2023-02-18 18:26:04,123 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 18:26:04,163 INFO L134 CoverageAnalysis]: Checked inductivity of 540 backedges. 34 proven. 71 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2023-02-18 18:26:04,163 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 18:26:04,476 INFO L134 CoverageAnalysis]: Checked inductivity of 540 backedges. 34 proven. 71 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2023-02-18 18:26:04,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 18:26:04,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369848240] [2023-02-18 18:26:04,476 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 18:26:04,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [556220259] [2023-02-18 18:26:04,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [556220259] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 18:26:04,476 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 18:26:04,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 18 [2023-02-18 18:26:04,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411518857] [2023-02-18 18:26:04,477 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 18:26:04,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-02-18 18:26:04,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 18:26:04,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-02-18 18:26:04,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2023-02-18 18:26:04,478 INFO L87 Difference]: Start difference. First operand 126 states and 147 transitions. Second operand has 18 states, 16 states have (on average 2.875) internal successors, (46), 17 states have internal predecessors, (46), 10 states have call successors, (34), 3 states have call predecessors, (34), 2 states have return successors, (32), 10 states have call predecessors, (32), 10 states have call successors, (32) [2023-02-18 18:26:06,247 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 18:26:06,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 18:26:06,441 INFO L93 Difference]: Finished difference Result 150 states and 167 transitions. [2023-02-18 18:26:06,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-18 18:26:06,441 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 2.875) internal successors, (46), 17 states have internal predecessors, (46), 10 states have call successors, (34), 3 states have call predecessors, (34), 2 states have return successors, (32), 10 states have call predecessors, (32), 10 states have call successors, (32) Word has length 102 [2023-02-18 18:26:06,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 18:26:06,442 INFO L225 Difference]: With dead ends: 150 [2023-02-18 18:26:06,442 INFO L226 Difference]: Without dead ends: 110 [2023-02-18 18:26:06,442 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 183 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=395, Unknown=0, NotChecked=0, Total=506 [2023-02-18 18:26:06,443 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 22 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 461 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-02-18 18:26:06,443 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 149 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 461 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2023-02-18 18:26:06,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2023-02-18 18:26:06,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2023-02-18 18:26:06,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 71 states have (on average 1.0704225352112675) internal successors, (76), 74 states have internal predecessors, (76), 23 states have call successors, (23), 15 states have call predecessors, (23), 15 states have return successors, (22), 20 states have call predecessors, (22), 22 states have call successors, (22) [2023-02-18 18:26:06,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 121 transitions. [2023-02-18 18:26:06,476 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 121 transitions. Word has length 102 [2023-02-18 18:26:06,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 18:26:06,477 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 121 transitions. [2023-02-18 18:26:06,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 2.875) internal successors, (46), 17 states have internal predecessors, (46), 10 states have call successors, (34), 3 states have call predecessors, (34), 2 states have return successors, (32), 10 states have call predecessors, (32), 10 states have call successors, (32) [2023-02-18 18:26:06,477 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 121 transitions. [2023-02-18 18:26:06,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-02-18 18:26:06,478 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 18:26:06,478 INFO L195 NwaCegarLoop]: trace histogram [19, 18, 18, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 18:26:06,483 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-02-18 18:26:06,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 18:26:06,679 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 18:26:06,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 18:26:06,681 INFO L85 PathProgramCache]: Analyzing trace with hash 289773103, now seen corresponding path program 2 times [2023-02-18 18:26:06,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 18:26:06,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097611673] [2023-02-18 18:26:06,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 18:26:06,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 18:26:06,691 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 18:26:06,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [677141183] [2023-02-18 18:26:06,692 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-18 18:26:06,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 18:26:06,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 18:26:06,693 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 18:26:06,730 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-02-18 18:26:06,760 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-18 18:26:06,761 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 18:26:06,762 INFO L263 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 54 conjunts are in the unsatisfiable core [2023-02-18 18:26:06,764 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 18:26:06,846 INFO L134 CoverageAnalysis]: Checked inductivity of 699 backedges. 38 proven. 100 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2023-02-18 18:26:06,846 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 18:26:14,886 INFO L134 CoverageAnalysis]: Checked inductivity of 699 backedges. 38 proven. 100 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2023-02-18 18:26:14,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 18:26:14,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097611673] [2023-02-18 18:26:14,886 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 18:26:14,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [677141183] [2023-02-18 18:26:14,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [677141183] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 18:26:14,886 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 18:26:14,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 25 [2023-02-18 18:26:14,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52663841] [2023-02-18 18:26:14,886 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 18:26:14,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-02-18 18:26:14,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 18:26:14,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-02-18 18:26:14,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=482, Unknown=0, NotChecked=0, Total=600 [2023-02-18 18:26:14,888 INFO L87 Difference]: Start difference. First operand 110 states and 121 transitions. Second operand has 25 states, 25 states have (on average 2.16) internal successors, (54), 23 states have internal predecessors, (54), 15 states have call successors, (38), 3 states have call predecessors, (38), 2 states have return successors, (36), 13 states have call predecessors, (36), 13 states have call successors, (36) [2023-02-18 18:26:19,480 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 18:26:22,506 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 18:26:24,872 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 18:26:26,878 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 18:26:30,608 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 18:26:36,549 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 18:26:43,104 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 18:26:44,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 18:26:44,648 INFO L93 Difference]: Finished difference Result 203 states and 254 transitions. [2023-02-18 18:26:44,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-02-18 18:26:44,648 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.16) internal successors, (54), 23 states have internal predecessors, (54), 15 states have call successors, (38), 3 states have call predecessors, (38), 2 states have return successors, (36), 13 states have call predecessors, (36), 13 states have call successors, (36) Word has length 116 [2023-02-18 18:26:44,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 18:26:44,649 INFO L225 Difference]: With dead ends: 203 [2023-02-18 18:26:44,649 INFO L226 Difference]: Without dead ends: 180 [2023-02-18 18:26:44,650 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 204 SyntacticMatches, 6 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=218, Invalid=774, Unknown=0, NotChecked=0, Total=992 [2023-02-18 18:26:44,650 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 84 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 1148 mSolverCounterSat, 151 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 1303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 1148 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.7s IncrementalHoareTripleChecker+Time [2023-02-18 18:26:44,650 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 223 Invalid, 1303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 1148 Invalid, 4 Unknown, 0 Unchecked, 22.7s Time] [2023-02-18 18:26:44,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2023-02-18 18:26:44,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 177. [2023-02-18 18:26:44,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 110 states have (on average 1.1363636363636365) internal successors, (125), 118 states have internal predecessors, (125), 48 states have call successors, (48), 18 states have call predecessors, (48), 18 states have return successors, (47), 40 states have call predecessors, (47), 47 states have call successors, (47) [2023-02-18 18:26:44,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 220 transitions. [2023-02-18 18:26:44,883 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 220 transitions. Word has length 116 [2023-02-18 18:26:44,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 18:26:44,883 INFO L495 AbstractCegarLoop]: Abstraction has 177 states and 220 transitions. [2023-02-18 18:26:44,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.16) internal successors, (54), 23 states have internal predecessors, (54), 15 states have call successors, (38), 3 states have call predecessors, (38), 2 states have return successors, (36), 13 states have call predecessors, (36), 13 states have call successors, (36) [2023-02-18 18:26:44,883 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 220 transitions. [2023-02-18 18:26:44,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2023-02-18 18:26:44,884 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 18:26:44,884 INFO L195 NwaCegarLoop]: trace histogram [21, 20, 20, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 18:26:44,892 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-02-18 18:26:45,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-02-18 18:26:45,092 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 18:26:45,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 18:26:45,093 INFO L85 PathProgramCache]: Analyzing trace with hash 1262824565, now seen corresponding path program 1 times [2023-02-18 18:26:45,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 18:26:45,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859609371] [2023-02-18 18:26:45,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 18:26:45,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 18:26:45,099 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 18:26:45,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [665049306] [2023-02-18 18:26:45,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 18:26:45,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 18:26:45,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 18:26:45,101 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 18:26:45,103 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-02-18 18:26:45,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 18:26:45,161 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 59 conjunts are in the unsatisfiable core [2023-02-18 18:26:45,163 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 18:26:45,333 INFO L134 CoverageAnalysis]: Checked inductivity of 857 backedges. 92 proven. 113 refuted. 0 times theorem prover too weak. 652 trivial. 0 not checked. [2023-02-18 18:26:45,333 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 18:26:46,910 INFO L134 CoverageAnalysis]: Checked inductivity of 857 backedges. 92 proven. 113 refuted. 0 times theorem prover too weak. 652 trivial. 0 not checked. [2023-02-18 18:26:46,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 18:26:46,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859609371] [2023-02-18 18:26:46,911 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 18:26:46,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [665049306] [2023-02-18 18:26:46,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [665049306] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 18:26:46,911 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 18:26:46,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 28 [2023-02-18 18:26:46,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986587168] [2023-02-18 18:26:46,911 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 18:26:46,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-02-18 18:26:46,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 18:26:46,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-02-18 18:26:46,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=601, Unknown=0, NotChecked=0, Total=756 [2023-02-18 18:26:46,913 INFO L87 Difference]: Start difference. First operand 177 states and 220 transitions. Second operand has 28 states, 26 states have (on average 2.1538461538461537) internal successors, (56), 24 states have internal predecessors, (56), 17 states have call successors, (42), 3 states have call predecessors, (42), 2 states have return successors, (40), 16 states have call predecessors, (40), 15 states have call successors, (40) [2023-02-18 18:26:55,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 18:26:55,162 INFO L93 Difference]: Finished difference Result 264 states and 334 transitions. [2023-02-18 18:26:55,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-02-18 18:26:55,163 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 26 states have (on average 2.1538461538461537) internal successors, (56), 24 states have internal predecessors, (56), 17 states have call successors, (42), 3 states have call predecessors, (42), 2 states have return successors, (40), 16 states have call predecessors, (40), 15 states have call successors, (40) Word has length 127 [2023-02-18 18:26:55,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 18:26:55,164 INFO L225 Difference]: With dead ends: 264 [2023-02-18 18:26:55,164 INFO L226 Difference]: Without dead ends: 190 [2023-02-18 18:26:55,165 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 220 SyntacticMatches, 6 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=418, Invalid=1304, Unknown=0, NotChecked=0, Total=1722 [2023-02-18 18:26:55,165 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 57 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 1104 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 1240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 1104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2023-02-18 18:26:55,166 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 222 Invalid, 1240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 1104 Invalid, 0 Unknown, 0 Unchecked, 6.1s Time] [2023-02-18 18:26:55,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2023-02-18 18:26:55,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 171. [2023-02-18 18:26:55,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 109 states have (on average 1.073394495412844) internal successors, (117), 116 states have internal predecessors, (117), 40 states have call successors, (40), 21 states have call predecessors, (40), 21 states have return successors, (40), 33 states have call predecessors, (40), 40 states have call successors, (40) [2023-02-18 18:26:55,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 197 transitions. [2023-02-18 18:26:55,343 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 197 transitions. Word has length 127 [2023-02-18 18:26:55,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 18:26:55,343 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 197 transitions. [2023-02-18 18:26:55,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 26 states have (on average 2.1538461538461537) internal successors, (56), 24 states have internal predecessors, (56), 17 states have call successors, (42), 3 states have call predecessors, (42), 2 states have return successors, (40), 16 states have call predecessors, (40), 15 states have call successors, (40) [2023-02-18 18:26:55,343 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 197 transitions. [2023-02-18 18:26:55,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-02-18 18:26:55,344 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 18:26:55,344 INFO L195 NwaCegarLoop]: trace histogram [24, 23, 23, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 18:26:55,353 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-02-18 18:26:55,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-02-18 18:26:55,552 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 18:26:55,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 18:26:55,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1801606842, now seen corresponding path program 3 times [2023-02-18 18:26:55,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 18:26:55,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925163699] [2023-02-18 18:26:55,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 18:26:55,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 18:26:55,557 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 18:26:55,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1608479976] [2023-02-18 18:26:55,558 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-18 18:26:55,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 18:26:55,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 18:26:55,559 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 18:26:55,561 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-02-18 18:26:55,607 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-02-18 18:26:55,607 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 18:26:55,608 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 37 conjunts are in the unsatisfiable core [2023-02-18 18:26:55,610 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 18:26:56,213 INFO L134 CoverageAnalysis]: Checked inductivity of 1146 backedges. 214 proven. 59 refuted. 0 times theorem prover too weak. 873 trivial. 0 not checked. [2023-02-18 18:26:56,213 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 18:26:58,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 18:26:58,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925163699] [2023-02-18 18:26:58,572 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 18:26:58,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1608479976] [2023-02-18 18:26:58,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1608479976] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 18:26:58,572 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-18 18:26:58,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2023-02-18 18:26:58,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902887309] [2023-02-18 18:26:58,572 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-18 18:26:58,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-18 18:26:58,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 18:26:58,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-18 18:26:58,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=247, Unknown=1, NotChecked=0, Total=306 [2023-02-18 18:26:58,573 INFO L87 Difference]: Start difference. First operand 171 states and 197 transitions. Second operand has 13 states, 12 states have (on average 2.25) internal successors, (27), 10 states have internal predecessors, (27), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2023-02-18 18:27:00,304 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-02-18 18:27:02,556 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-02-18 18:27:04,562 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-02-18 18:27:05,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 18:27:05,517 INFO L93 Difference]: Finished difference Result 226 states and 275 transitions. [2023-02-18 18:27:05,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-02-18 18:27:05,517 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.25) internal successors, (27), 10 states have internal predecessors, (27), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) Word has length 146 [2023-02-18 18:27:05,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 18:27:05,518 INFO L225 Difference]: With dead ends: 226 [2023-02-18 18:27:05,519 INFO L226 Difference]: Without dead ends: 224 [2023-02-18 18:27:05,519 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=138, Invalid=563, Unknown=1, NotChecked=0, Total=702 [2023-02-18 18:27:05,519 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 21 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 29 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2023-02-18 18:27:05,520 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 91 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 264 Invalid, 2 Unknown, 0 Unchecked, 6.5s Time] [2023-02-18 18:27:05,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2023-02-18 18:27:05,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 220. [2023-02-18 18:27:05,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 136 states have (on average 1.0955882352941178) internal successors, (149), 146 states have internal predecessors, (149), 59 states have call successors, (59), 24 states have call predecessors, (59), 24 states have return successors, (59), 49 states have call predecessors, (59), 59 states have call successors, (59) [2023-02-18 18:27:05,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 267 transitions. [2023-02-18 18:27:05,765 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 267 transitions. Word has length 146 [2023-02-18 18:27:05,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 18:27:05,765 INFO L495 AbstractCegarLoop]: Abstraction has 220 states and 267 transitions. [2023-02-18 18:27:05,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.25) internal successors, (27), 10 states have internal predecessors, (27), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2023-02-18 18:27:05,766 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 267 transitions. [2023-02-18 18:27:05,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-02-18 18:27:05,766 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 18:27:05,767 INFO L195 NwaCegarLoop]: trace histogram [24, 23, 23, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 18:27:05,778 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-02-18 18:27:05,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-02-18 18:27:05,971 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 18:27:05,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 18:27:05,972 INFO L85 PathProgramCache]: Analyzing trace with hash -112663100, now seen corresponding path program 4 times [2023-02-18 18:27:05,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 18:27:05,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966877278] [2023-02-18 18:27:05,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 18:27:05,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 18:27:05,977 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 18:27:05,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1949480605] [2023-02-18 18:27:05,978 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-18 18:27:05,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 18:27:05,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 18:27:05,979 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 18:27:05,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-02-18 18:27:06,039 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-18 18:27:06,039 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 18:27:06,040 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 72 conjunts are in the unsatisfiable core [2023-02-18 18:27:06,043 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 18:27:06,293 INFO L134 CoverageAnalysis]: Checked inductivity of 1146 backedges. 110 proven. 150 refuted. 0 times theorem prover too weak. 886 trivial. 0 not checked. [2023-02-18 18:27:06,294 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 18:27:17,527 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse98 (div |c_ULTIMATE.start_main_~d~0#1| 2))) (let ((.cse99 (+ .cse98 1))) (let ((.cse10 (div |c_ULTIMATE.start_main_~d~0#1| 4)) (.cse7 (= 0 (mod .cse98 2))) (.cse95 (< .cse98 0)) (.cse17 (= 0 (mod |c_ULTIMATE.start_main_~d~0#1| 2))) (.cse96 (< |c_ULTIMATE.start_main_~d~0#1| 0)) (.cse19 (div .cse99 2)) (.cse22 (= 0 (mod .cse99 2))) (.cse97 (< (+ 1 .cse98) 0))) (let ((.cse18 (and (not .cse22) .cse97)) (.cse20 (not .cse97)) (.cse21 (+ 1 .cse19)) (.cse23 (not .cse96)) (.cse2 (and (not .cse17) .cse96)) (.cse11 (and (not .cse7) .cse95)) (.cse6 (not .cse95)) (.cse9 (+ 1 .cse10)) (.cse56 (= 0 (mod |c_ULTIMATE.start_main_~p~0#1| 2))) (.cse0 (< |c_ULTIMATE.start_main_~p~0#1| 0)) (.cse55 (div |c_ULTIMATE.start_main_~p~0#1| 2))) (and (let ((.cse1 (+ 1 .cse55))) (or (not .cse0) (= 1 .cse1) (let ((.cse54 (+ .cse55 1))) (let ((.cse40 (div .cse54 2))) (let ((.cse38 (+ 1 .cse40))) (let ((.cse16 (* |c_ULTIMATE.start_main_~B~0#1| .cse38)) (.cse8 (* |c_ULTIMATE.start_main_~B~0#1| .cse40)) (.cse39 (* .cse40 |c_ULTIMATE.start_main_~B~0#1|)) (.cse13 (= 0 (mod .cse54 2))) (.cse41 (< .cse1 0))) (let ((.cse3 (and (not .cse13) .cse41)) (.cse4 (= 1 .cse40)) (.cse5 (let ((.cse53 (div .cse54 4)) (.cse42 (= 0 (mod .cse40 2))) (.cse52 (< .cse40 0))) (let ((.cse47 (and (not .cse42) .cse52)) (.cse46 (* (+ |c_ULTIMATE.start_main_~q~0#1| .cse53) |c_ULTIMATE.start_main_~B~0#1|)) (.cse43 (* (+ |c_ULTIMATE.start_main_~q~0#1| (+ 1 .cse53)) |c_ULTIMATE.start_main_~B~0#1|)) (.cse45 (not .cse52)) (.cse48 (- (div .cse39 2))) (.cse50 (< .cse8 0)) (.cse49 (= 0 (mod .cse39 2)))) (and (or (let ((.cse44 (+ |c_ULTIMATE.start_main_~r~0#1| (+ (- 1) .cse48)))) (and (or .cse42 (= |c_ULTIMATE.start_main_~A~0#1| (+ .cse43 .cse44)) .cse45) (or (= |c_ULTIMATE.start_main_~A~0#1| (+ .cse46 .cse44)) .cse47))) .cse49 (not .cse50)) (or (let ((.cse51 (+ |c_ULTIMATE.start_main_~r~0#1| .cse48))) (and (or .cse47 (= |c_ULTIMATE.start_main_~A~0#1| (+ .cse46 .cse51))) (or (= |c_ULTIMATE.start_main_~A~0#1| (+ .cse43 .cse51)) .cse42 .cse45))) (and .cse50 (not .cse49))))))) (.cse12 (not .cse41)) (.cse14 (= 1 .cse38)) (.cse15 (let ((.cse37 (+ .cse40 1))) (let ((.cse34 (+ |c_ULTIMATE.start_main_~B~0#1| .cse39)) (.cse31 (= 0 (mod .cse37 2))) (.cse35 (< .cse38 0)) (.cse36 (div .cse37 2))) (let ((.cse29 (* (+ |c_ULTIMATE.start_main_~q~0#1| (+ 1 .cse36)) |c_ULTIMATE.start_main_~B~0#1|)) (.cse30 (not .cse35)) (.cse26 (* (+ |c_ULTIMATE.start_main_~q~0#1| .cse36) |c_ULTIMATE.start_main_~B~0#1|)) (.cse28 (and .cse35 (not .cse31))) (.cse32 (- (div .cse34 2))) (.cse25 (= 0 (mod .cse34 2))) (.cse24 (< .cse16 0))) (and (or (and .cse24 (not .cse25)) (let ((.cse27 (+ |c_ULTIMATE.start_main_~r~0#1| .cse32))) (and (or (= |c_ULTIMATE.start_main_~A~0#1| (+ .cse26 .cse27)) .cse28) (or (= |c_ULTIMATE.start_main_~A~0#1| (+ .cse29 .cse27)) .cse30 .cse31)))) (or (let ((.cse33 (+ |c_ULTIMATE.start_main_~r~0#1| (+ (- 1) .cse32)))) (and (or (= |c_ULTIMATE.start_main_~A~0#1| (+ .cse29 .cse33)) .cse30 .cse31) (or (= |c_ULTIMATE.start_main_~A~0#1| (+ .cse26 .cse33)) .cse28))) .cse25 (not .cse24)))))))) (and (or .cse2 (and (or .cse3 .cse4 .cse5 (and (or .cse6 .cse7 (not (= .cse8 .cse9))) (or (not (= .cse8 .cse10)) .cse11))) (or .cse12 .cse13 .cse14 .cse15 (and (or (not (= .cse16 .cse9)) .cse6 .cse7) (or (not (= .cse16 .cse10)) .cse11))))) (or .cse17 (and (or .cse3 .cse4 .cse5 (and (or .cse18 (not (= .cse8 .cse19))) (or .cse20 (not (= .cse8 .cse21)) .cse22))) (or .cse12 .cse13 .cse14 (and (or (not (= .cse16 .cse21)) .cse20 .cse22) (or .cse18 (not (= .cse16 .cse19)))) .cse15)) .cse23))))))) .cse56)) (or (let ((.cse78 (div |c_ULTIMATE.start_main_~p~0#1| 4))) (let ((.cse80 (+ 1 .cse78))) (let ((.cse65 (= 0 (mod .cse55 2))) (.cse79 (< .cse55 0)) (.cse62 (* |c_ULTIMATE.start_main_~B~0#1| .cse80)) (.cse57 (* |c_ULTIMATE.start_main_~B~0#1| .cse78))) (let ((.cse61 (let ((.cse94 (+ .cse78 1))) (let ((.cse84 (= 0 (mod .cse94 2))) (.cse92 (div .cse94 2)) (.cse93 (< .cse80 0)) (.cse91 (+ |c_ULTIMATE.start_main_~B~0#1| .cse57))) (let ((.cse89 (= 0 (mod .cse91 2))) (.cse83 (not .cse93)) (.cse81 (* (+ |c_ULTIMATE.start_main_~q~0#1| (+ 1 .cse92)) |c_ULTIMATE.start_main_~B~0#1|)) (.cse85 (and (not .cse84) .cse93)) (.cse86 (* (+ |c_ULTIMATE.start_main_~q~0#1| .cse92) |c_ULTIMATE.start_main_~B~0#1|)) (.cse87 (- (div .cse91 2))) (.cse88 (< .cse62 0))) (and (or (let ((.cse82 (+ |c_ULTIMATE.start_main_~r~0#1| .cse87))) (and (or (= |c_ULTIMATE.start_main_~A~0#1| (+ .cse81 .cse82)) .cse83 .cse84) (or .cse85 (= |c_ULTIMATE.start_main_~A~0#1| (+ .cse86 .cse82))))) (and .cse88 (not .cse89))) (or .cse89 (let ((.cse90 (+ |c_ULTIMATE.start_main_~r~0#1| (+ (- 1) .cse87)))) (and (or .cse83 .cse84 (= |c_ULTIMATE.start_main_~A~0#1| (+ .cse81 .cse90))) (or .cse85 (= |c_ULTIMATE.start_main_~A~0#1| (+ .cse86 .cse90))))) (not .cse88))))))) (.cse63 (= 1 .cse80)) (.cse64 (not .cse79)) (.cse58 (= 1 .cse78)) (.cse59 (and (not .cse65) .cse79)) (.cse60 (let ((.cse76 (div |c_ULTIMATE.start_main_~p~0#1| 8)) (.cse71 (= 0 (mod .cse78 2))) (.cse77 (< .cse78 0))) (let ((.cse68 (and (not .cse71) .cse77)) (.cse69 (* (+ |c_ULTIMATE.start_main_~q~0#1| .cse76) |c_ULTIMATE.start_main_~B~0#1|)) (.cse72 (not .cse77)) (.cse73 (* (+ |c_ULTIMATE.start_main_~q~0#1| (+ 1 .cse76)) |c_ULTIMATE.start_main_~B~0#1|)) (.cse74 (- (div .cse57 2))) (.cse67 (< .cse57 0)) (.cse66 (= 0 (mod .cse57 2)))) (and (or (and (not .cse66) .cse67) (let ((.cse70 (+ |c_ULTIMATE.start_main_~r~0#1| .cse74))) (and (or .cse68 (= |c_ULTIMATE.start_main_~A~0#1| (+ .cse69 .cse70))) (or .cse71 .cse72 (= |c_ULTIMATE.start_main_~A~0#1| (+ .cse73 .cse70)))))) (or (let ((.cse75 (+ |c_ULTIMATE.start_main_~r~0#1| (+ (- 1) .cse74)))) (and (or .cse68 (= |c_ULTIMATE.start_main_~A~0#1| (+ .cse69 .cse75))) (or .cse71 .cse72 (= |c_ULTIMATE.start_main_~A~0#1| (+ .cse73 .cse75))))) (not .cse67) .cse66)))))) (and (or (and (or (and (or .cse18 (not (= .cse57 .cse19))) (or .cse20 (not (= .cse57 .cse21)) .cse22)) .cse58 .cse59 .cse60) (or .cse61 (and (or .cse18 (not (= .cse62 .cse19))) (or .cse20 .cse22 (not (= .cse62 .cse21)))) .cse63 .cse64 .cse65)) .cse17 .cse23) (or .cse2 (and (or .cse61 (and (or .cse6 .cse7 (not (= .cse62 .cse9))) (or (not (= .cse62 .cse10)) .cse11)) .cse63 .cse64 .cse65) (or .cse58 (and (or (not (= .cse57 .cse10)) .cse11) (or .cse6 (not (= .cse57 .cse9)) .cse7)) .cse59 .cse60)))))))) (and (not .cse56) .cse0) (= 1 .cse55))))))) is different from false [2023-02-18 18:27:56,038 INFO L134 CoverageAnalysis]: Checked inductivity of 1146 backedges. 110 proven. 136 refuted. 0 times theorem prover too weak. 886 trivial. 14 not checked. [2023-02-18 18:27:56,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 18:27:56,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966877278] [2023-02-18 18:27:56,038 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 18:27:56,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1949480605] [2023-02-18 18:27:56,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1949480605] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 18:27:56,038 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 18:27:56,038 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 30 [2023-02-18 18:27:56,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631976771] [2023-02-18 18:27:56,038 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 18:27:56,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-02-18 18:27:56,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 18:27:56,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-02-18 18:27:56,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=640, Unknown=3, NotChecked=54, Total=870 [2023-02-18 18:27:56,041 INFO L87 Difference]: Start difference. First operand 220 states and 267 transitions. Second operand has 30 states, 30 states have (on average 2.1333333333333333) internal successors, (64), 27 states have internal predecessors, (64), 18 states have call successors, (48), 3 states have call predecessors, (48), 2 states have return successors, (46), 17 states have call predecessors, (46), 16 states have call successors, (46) [2023-02-18 18:27:58,600 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 18:27:59,908 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 18:28:02,197 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 18:28:04,309 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 18:28:07,327 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 18:28:09,955 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 18:28:12,047 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 18:28:14,769 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 18:28:22,742 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 18:28:25,102 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 18:28:38,736 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 18:28:48,531 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 18:28:50,537 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 18:28:52,542 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 18:29:07,666 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 18:29:15,750 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 18:29:17,767 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 18:29:20,097 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 18:29:22,538 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 18:29:24,551 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 18:29:26,559 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 18:29:40,908 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 18:29:42,145 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 18:29:57,481 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 18:30:01,020 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 18:30:04,453 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 18:30:06,463 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 18:30:08,472 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 18:30:10,067 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 18:30:22,466 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 18:30:27,074 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 18:30:29,143 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 18:30:31,199 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 18:30:33,582 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 18:30:35,613 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 18:30:38,158 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 18:30:58,755 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 18:30:59,969 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 18:31:02,724 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 18:31:03,922 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 18:31:06,050 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 18:31:08,241 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 18:31:18,974 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 18:31:20,980 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 18:31:23,034 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 18:31:25,134 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 18:31:27,877 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 18:31:29,595 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 18:31:32,880 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 18:31:34,926 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 18:31:37,054 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse357 (div |c_ULTIMATE.start_main_~p~0#1| 2))) (let ((.cse393 (div |c_ULTIMATE.start_main_~d~0#1| 2)) (.cse179 (+ .cse357 1))) (let ((.cse379 (div .cse179 2)) (.cse363 (div |c_ULTIMATE.start_main_~p~0#1| 4)) (.cse394 (+ .cse393 1))) (let ((.cse375 (div .cse394 2)) (.cse373 (div |c_ULTIMATE.start_main_~d~0#1| 4)) (.cse374 (* |c_ULTIMATE.start_main_~B~0#1| .cse363)) (.cse364 (+ 1 .cse363)) (.cse390 (* .cse379 |c_ULTIMATE.start_main_~B~0#1|)) (.cse382 (+ 1 .cse379))) (let ((.cse146 (= 0 (mod .cse393 2))) (.cse387 (< .cse393 0)) (.cse83 (= 0 (mod .cse394 2))) (.cse388 (< (+ 1 .cse393) 0)) (.cse385 (* |c_ULTIMATE.start_main_~B~0#1| .cse382)) (.cse389 (+ |c_ULTIMATE.start_main_~B~0#1| .cse390)) (.cse386 (* |c_ULTIMATE.start_main_~B~0#1| .cse379)) (.cse377 (+ 1 .cse357)) (.cse177 (+ .cse379 1)) (.cse371 (* |c_ULTIMATE.start_main_~B~0#1| .cse364)) (.cse391 (+ |c_ULTIMATE.start_main_~B~0#1| .cse374)) (.cse372 (+ 1 .cse373)) (.cse392 (+ .cse373 1)) (.cse376 (+ 1 .cse375)) (.cse395 (+ .cse375 1)) (.cse353 (+ .cse363 1))) (let ((.cse5 (= 0 (mod |c_ULTIMATE.start_main_~p~0#1| 2))) (.cse218 (div .cse353 2)) (.cse205 (div |c_ULTIMATE.start_main_~p~0#1| 8)) (.cse189 (= 0 (mod .cse357 2))) (.cse80 (= 0 (mod .cse395 2))) (.cse360 (< .cse376 0)) (.cse81 (div .cse395 2)) (.cse196 (= 0 (mod .cse363 2))) (.cse361 (< .cse363 0)) (.cse72 (= 0 (mod .cse375 2))) (.cse69 (div .cse394 4)) (.cse362 (< .cse375 0)) (.cse358 (< .cse357 0)) (.cse209 (= 0 (mod .cse353 2))) (.cse365 (< .cse364 0)) (.cse359 (- .cse393)) (.cse142 (div .cse392 2)) (.cse367 (< .cse372 0)) (.cse139 (= 0 (mod .cse392 2))) (.cse151 (div |c_ULTIMATE.start_main_~d~0#1| 8)) (.cse147 (= 0 (mod .cse373 2))) (.cse368 (< .cse373 0)) (.cse0 (= 0 (mod |c_ULTIMATE.start_main_~d~0#1| 2))) (.cse366 (< |c_ULTIMATE.start_main_~d~0#1| 0)) (.cse199 (- (div .cse374 2))) (.cse203 (= 0 (mod .cse374 2))) (.cse369 (< .cse374 0)) (.cse212 (- (div .cse391 2))) (.cse370 (< .cse371 0)) (.cse214 (= 0 (mod .cse391 2))) (.cse356 (< |c_ULTIMATE.start_main_~p~0#1| 0)) (.cse53 (div .cse177 2)) (.cse38 (div .cse179 4)) (.cse28 (= 0 (mod .cse379 2))) (.cse378 (< .cse379 0)) (.cse14 (= 0 (mod .cse179 2))) (.cse381 (< .cse382 0)) (.cse41 (= 0 (mod .cse177 2))) (.cse380 (< .cse377 0)) (.cse35 (= 0 (mod .cse390 2))) (.cse383 (< .cse386 0)) (.cse32 (- (div .cse390 2))) (.cse50 (- (div .cse389 2))) (.cse384 (< .cse385 0)) (.cse47 (= 0 (mod .cse389 2))) (.cse76 (and (not .cse83) .cse388)) (.cse77 (not .cse388)) (.cse138 (not .cse387)) (.cse152 (and (not .cse146) .cse387))) (let ((.cse54 (= 1 .cse377)) (.cse23 (and (or .cse138 .cse146 (not (= .cse386 .cse372))) (or (not (= .cse386 .cse373)) .cse152))) (.cse22 (and (or (not (= .cse385 .cse372)) .cse138 .cse146) (or (not (= .cse385 .cse373)) .cse152))) (.cse21 (and (or .cse76 (not (= .cse386 .cse375))) (or .cse77 (not (= .cse386 .cse376)) .cse83))) (.cse16 (and (or (not (= .cse385 .cse376)) .cse77 .cse83) (or .cse76 (not (= .cse385 .cse375))))) (.cse51 (and .cse384 (not .cse47))) (.cse46 (+ (- 1) .cse50)) (.cse48 (not .cse384)) (.cse34 (+ (- 1) .cse32)) (.cse36 (not .cse383)) (.cse24 (and .cse383 (not .cse35))) (.cse13 (not .cse380)) (.cse15 (= 1 .cse382)) (.cse45 (and .cse381 (not .cse41))) (.cse40 (not .cse381)) (.cse18 (and (not .cse14) .cse380)) (.cse19 (= 1 .cse379)) (.cse29 (not .cse378)) (.cse25 (and (not .cse28) .cse378)) (.cse10 (+ |c_ULTIMATE.start_main_~q~0#1| .cse377)) (.cse39 (+ 1 .cse38)) (.cse52 (+ 1 .cse53)) (.cse4 (not .cse356)) (.cse12 (= 1 |c_ULTIMATE.start_main_~p~0#1|)) (.cse186 (and (or .cse76 (not (= .cse371 .cse375))) (or .cse77 .cse83 (not (= .cse371 .cse376))))) (.cse181 (and (or .cse76 (not (= .cse374 .cse375))) (or .cse77 (not (= .cse374 .cse376)) .cse83))) (.cse191 (and (or (not (= .cse374 .cse373)) .cse152) (or .cse138 (not (= .cse374 .cse372)) .cse146))) (.cse190 (and (or .cse138 .cse146 (not (= .cse371 .cse372))) (or (not (= .cse371 .cse373)) .cse152))) (.cse213 (and .cse370 (not .cse214))) (.cse216 (+ (- 1) .cse212)) (.cse217 (not .cse370)) (.cse192 (and (not .cse203) .cse369)) (.cse202 (not .cse369)) (.cse31 (+ |c_ULTIMATE.start_main_~r~0#1| (- |c_ULTIMATE.start_main_~d~0#1|))) (.cse201 (+ (- 1) .cse199)) (.cse37 (+ |c_ULTIMATE.start_main_~q~0#1| |c_ULTIMATE.start_main_~p~0#1|)) (.cse220 (= 1 .cse357)) (.cse8 (and (not .cse0) .cse366)) (.cse150 (and (not .cse147) .cse368)) (.cse148 (not .cse368)) (.cse149 (+ 1 .cse151)) (.cse143 (and .cse367 (not .cse139))) (.cse141 (+ 1 .cse142)) (.cse140 (not .cse367)) (.cse9 (+ |c_ULTIMATE.start_main_~r~0#1| .cse359)) (.cse1 (not .cse366)) (.cse210 (and (not .cse209) .cse365)) (.cse208 (not .cse365)) (.cse187 (= 1 .cse364)) (.cse188 (not .cse358)) (.cse182 (= 1 .cse363)) (.cse70 (not .cse362)) (.cse71 (+ 1 .cse69)) (.cse67 (and (not .cse72) .cse362)) (.cse197 (not .cse361)) (.cse193 (and (not .cse196) .cse361)) (.cse79 (+ 1 .cse81)) (.cse78 (not .cse360)) (.cse82 (and (not .cse80) .cse360)) (.cse3 (+ |c_ULTIMATE.start_main_~r~0#1| (+ (- 1) .cse359))) (.cse183 (and (not .cse189) .cse358)) (.cse11 (+ |c_ULTIMATE.start_main_~q~0#1| .cse357)) (.cse204 (+ 1 .cse205)) (.cse219 (+ 1 .cse218)) (.cse7 (and (not .cse5) .cse356))) (and (or (let ((.cse6 (* .cse11 |c_ULTIMATE.start_main_~B~0#1|)) (.cse2 (* .cse10 |c_ULTIMATE.start_main_~B~0#1|))) (and (or .cse0 .cse1 (and (or (= |c_ULTIMATE.start_main_~A~0#1| (+ .cse2 .cse3)) .cse4 .cse5) (or (= |c_ULTIMATE.start_main_~A~0#1| (+ .cse6 .cse3)) .cse7))) (or .cse8 (and (or (= |c_ULTIMATE.start_main_~A~0#1| (+ .cse6 .cse9)) .cse7) (or .cse4 (= |c_ULTIMATE.start_main_~A~0#1| (+ .cse2 .cse9)) .cse5))))) .cse12) (or .cse4 (let ((.cse17 (let ((.cse44 (* (+ .cse37 .cse53) |c_ULTIMATE.start_main_~B~0#1|)) (.cse42 (* (+ .cse37 .cse52) |c_ULTIMATE.start_main_~B~0#1|))) (and (or (let ((.cse43 (+ .cse31 .cse46))) (and (or .cse40 .cse41 (= |c_ULTIMATE.start_main_~A~0#1| (+ .cse42 .cse43))) (or (= |c_ULTIMATE.start_main_~A~0#1| (+ .cse44 .cse43)) .cse45))) .cse47 .cse48) (or (let ((.cse49 (+ .cse31 .cse50))) (and (or (= |c_ULTIMATE.start_main_~A~0#1| (+ .cse44 .cse49)) .cse45) (or (= |c_ULTIMATE.start_main_~A~0#1| (+ .cse42 .cse49)) .cse40 .cse41))) .cse51)))) (.cse20 (let ((.cse30 (* (+ .cse37 .cse39) |c_ULTIMATE.start_main_~B~0#1|)) (.cse26 (* (+ .cse37 .cse38) |c_ULTIMATE.start_main_~B~0#1|))) (and (or .cse24 (let ((.cse27 (+ .cse31 .cse32))) (and (or .cse25 (= |c_ULTIMATE.start_main_~A~0#1| (+ .cse26 .cse27))) (or .cse28 .cse29 (= |c_ULTIMATE.start_main_~A~0#1| (+ .cse30 .cse27)))))) (or (let ((.cse33 (+ .cse31 .cse34))) (and (or (= |c_ULTIMATE.start_main_~A~0#1| (+ .cse30 .cse33)) .cse28 .cse29) (or .cse25 (= |c_ULTIMATE.start_main_~A~0#1| (+ .cse26 .cse33))))) .cse35 .cse36))))) (and (or (and (or .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse18 .cse19 .cse20 .cse21)) .cse0 .cse1) (or (and (or .cse13 .cse14 .cse15 .cse22 .cse17) (or .cse18 .cse19 .cse20 .cse23)) .cse8))) .cse54 .cse5) (= (+ |c_ULTIMATE.start_main_~q~0#1| (- 10)) (+ 5 (- 4))) (or .cse4 .cse54 (let ((.cse55 (let ((.cse63 (* (+ |c_ULTIMATE.start_main_~q~0#1| .cse38) |c_ULTIMATE.start_main_~B~0#1|)) (.cse61 (* (+ |c_ULTIMATE.start_main_~q~0#1| .cse39) |c_ULTIMATE.start_main_~B~0#1|))) (and (or (let ((.cse62 (+ |c_ULTIMATE.start_main_~r~0#1| .cse34))) (and (or .cse28 (= |c_ULTIMATE.start_main_~A~0#1| (+ .cse61 .cse62)) .cse29) (or (= |c_ULTIMATE.start_main_~A~0#1| (+ .cse63 .cse62)) .cse25))) .cse35 .cse36) (or (let ((.cse64 (+ |c_ULTIMATE.start_main_~r~0#1| .cse32))) (and (or .cse25 (= |c_ULTIMATE.start_main_~A~0#1| (+ .cse63 .cse64))) (or (= |c_ULTIMATE.start_main_~A~0#1| (+ .cse61 .cse64)) .cse28 .cse29))) .cse24)))) (.cse56 (let ((.cse59 (* (+ |c_ULTIMATE.start_main_~q~0#1| .cse52) |c_ULTIMATE.start_main_~B~0#1|)) (.cse57 (* (+ |c_ULTIMATE.start_main_~q~0#1| .cse53) |c_ULTIMATE.start_main_~B~0#1|))) (and (or .cse51 (let ((.cse58 (+ |c_ULTIMATE.start_main_~r~0#1| .cse50))) (and (or (= |c_ULTIMATE.start_main_~A~0#1| (+ .cse57 .cse58)) .cse45) (or (= |c_ULTIMATE.start_main_~A~0#1| (+ .cse59 .cse58)) .cse40 .cse41)))) (or (let ((.cse60 (+ |c_ULTIMATE.start_main_~r~0#1| .cse46))) (and (or (= |c_ULTIMATE.start_main_~A~0#1| (+ .cse59 .cse60)) .cse40 .cse41) (or (= |c_ULTIMATE.start_main_~A~0#1| (+ .cse57 .cse60)) .cse45))) .cse47 .cse48))))) (and (or .cse8 (and (or .cse18 .cse19 .cse55 .cse23) (or .cse13 .cse14 .cse15 .cse56 .cse22))) (or .cse0 (and (or .cse18 .cse19 .cse55 .cse21) (or .cse13 .cse14 .cse15 .cse16 .cse56)) .cse1))) .cse5) (= |c_ULTIMATE.start_main_~B~0#1| 1) (or .cse4 (let ((.cse111 (* |c_ULTIMATE.start_main_~B~0#1| .cse53))) (let ((.cse109 (* |c_ULTIMATE.start_main_~B~0#1| .cse52)) (.cse175 (+ |c_ULTIMATE.start_main_~B~0#1| .cse111)) (.cse176 (+ .cse53 1)) (.cse68 (* |c_ULTIMATE.start_main_~B~0#1| .cse38)) (.cse73 (* |c_ULTIMATE.start_main_~B~0#1| .cse39)) (.cse180 (+ .cse38 1)) (.cse178 (* .cse38 |c_ULTIMATE.start_main_~B~0#1|))) (let ((.cse94 (- (div (+ |c_ULTIMATE.start_main_~B~0#1| .cse178) 2))) (.cse163 (< .cse39 0)) (.cse87 (= 0 (mod .cse180 2))) (.cse164 (div .cse180 2)) (.cse92 (= 0 (mod (+ .cse178 |c_ULTIMATE.start_main_~B~0#1|) 2))) (.cse165 (< .cse73 0)) (.cse102 (- (div .cse178 2))) (.cse99 (= 0 (mod .cse38 2))) (.cse166 (< .cse38 0)) (.cse167 (div .cse179 8)) (.cse106 (= 0 (mod .cse178 2))) (.cse168 (< .cse68 0)) (.cse125 (= 0 (mod .cse111 2))) (.cse171 (div .cse177 4)) (.cse120 (= 0 (mod .cse53 2))) (.cse170 (< .cse53 0)) (.cse121 (- (div .cse111 2))) (.cse169 (< .cse111 0)) (.cse132 (= 0 (mod .cse176 2))) (.cse172 (< .cse52 0)) (.cse173 (div .cse176 2)) (.cse126 (= 0 (mod .cse175 2))) (.cse136 (- (div .cse175 2))) (.cse174 (< .cse109 0))) (let ((.cse112 (= 1 .cse53)) (.cse110 (= 1 .cse52)) (.cse127 (not .cse174)) (.cse134 (+ (- 1) .cse136)) (.cse137 (and .cse174 (not .cse126))) (.cse131 (* (+ .cse10 (+ 1 .cse173)) |c_ULTIMATE.start_main_~B~0#1|)) (.cse133 (not .cse172)) (.cse129 (* (+ .cse10 .cse173) |c_ULTIMATE.start_main_~B~0#1|)) (.cse128 (and (not .cse132) .cse172)) (.cse122 (not .cse169)) (.cse124 (+ (- 1) .cse121)) (.cse115 (and (not .cse120) .cse170)) (.cse116 (* (+ .cse10 .cse171) |c_ULTIMATE.start_main_~B~0#1|)) (.cse118 (* (+ .cse10 (+ 1 .cse171)) |c_ULTIMATE.start_main_~B~0#1|)) (.cse119 (not .cse170)) (.cse114 (and .cse169 (not .cse125))) (.cse75 (= 1 .cse39)) (.cse65 (= 1 .cse38)) (.cse103 (and (not .cse106) .cse168)) (.cse107 (not .cse168)) (.cse100 (* (+ .cse10 (+ 1 .cse167)) |c_ULTIMATE.start_main_~B~0#1|)) (.cse101 (not .cse166)) (.cse96 (* (+ .cse10 .cse167) |c_ULTIMATE.start_main_~B~0#1|)) (.cse98 (and .cse166 (not .cse99))) (.cse105 (+ (- 1) .cse102)) (.cse95 (and (not .cse92) .cse165)) (.cse91 (not .cse165)) (.cse88 (* (+ .cse10 .cse164) |c_ULTIMATE.start_main_~B~0#1|)) (.cse89 (and .cse163 (not .cse87))) (.cse84 (* (+ .cse10 (+ 1 .cse164)) |c_ULTIMATE.start_main_~B~0#1|)) (.cse86 (not .cse163)) (.cse90 (+ (- 1) .cse94))) (and (or .cse0 .cse1 (and (or .cse18 .cse19 (let ((.cse66 (and (or (let ((.cse97 (+ .cse3 .cse102))) (and (or (= |c_ULTIMATE.start_main_~A~0#1| (+ .cse96 .cse97)) .cse98) (or .cse99 (= |c_ULTIMATE.start_main_~A~0#1| (+ .cse100 .cse97)) .cse101))) .cse103) (or (let ((.cse104 (+ .cse3 .cse105))) (and (or .cse99 .cse101 (= |c_ULTIMATE.start_main_~A~0#1| (+ .cse100 .cse104))) (or (= |c_ULTIMATE.start_main_~A~0#1| (+ .cse96 .cse104)) .cse98))) .cse106 .cse107))) (.cse74 (and (or (let ((.cse85 (+ .cse3 .cse90))) (and (or (= |c_ULTIMATE.start_main_~A~0#1| (+ .cse84 .cse85)) .cse86 .cse87) (or (= |c_ULTIMATE.start_main_~A~0#1| (+ .cse88 .cse85)) .cse89))) .cse91 .cse92) (or (let ((.cse93 (+ .cse3 .cse94))) (and (or .cse86 .cse87 (= |c_ULTIMATE.start_main_~A~0#1| (+ .cse84 .cse93))) (or (= |c_ULTIMATE.start_main_~A~0#1| (+ .cse88 .cse93)) .cse89))) .cse95)))) (and (or (and (or .cse25 .cse65 .cse66 (and (or .cse67 (not (= .cse68 .cse69))) (or .cse70 (not (= .cse68 .cse71)) .cse72))) (or (and (or .cse67 (not (= .cse73 .cse69))) (or .cse70 (not (= .cse73 .cse71)) .cse72)) .cse28 .cse74 .cse29 .cse75)) .cse76) (or .cse77 (and (or .cse25 .cse65 .cse66 (and (or .cse78 (not (= .cse68 .cse79)) .cse80) (or (not (= .cse68 .cse81)) .cse82))) (or .cse28 (and (or .cse78 .cse80 (not (= .cse73 .cse79))) (or (not (= .cse73 .cse81)) .cse82)) .cse74 .cse29 .cse75)) .cse83)))) (or .cse13 .cse14 .cse15 (let ((.cse108 (and (or .cse126 .cse127 (let ((.cse130 (+ .cse3 .cse134))) (and (or .cse128 (= |c_ULTIMATE.start_main_~A~0#1| (+ .cse129 .cse130))) (or (= |c_ULTIMATE.start_main_~A~0#1| (+ .cse131 .cse130)) .cse132 .cse133)))) (or (let ((.cse135 (+ .cse3 .cse136))) (and (or (= |c_ULTIMATE.start_main_~A~0#1| (+ .cse131 .cse135)) .cse132 .cse133) (or .cse128 (= |c_ULTIMATE.start_main_~A~0#1| (+ .cse129 .cse135))))) .cse137))) (.cse113 (and (or .cse114 (let ((.cse117 (+ .cse3 .cse121))) (and (or .cse115 (= |c_ULTIMATE.start_main_~A~0#1| (+ .cse116 .cse117))) (or (= |c_ULTIMATE.start_main_~A~0#1| (+ .cse118 .cse117)) .cse119 .cse120)))) (or .cse122 (let ((.cse123 (+ .cse3 .cse124))) (and (or .cse115 (= |c_ULTIMATE.start_main_~A~0#1| (+ .cse116 .cse123))) (or (= |c_ULTIMATE.start_main_~A~0#1| (+ .cse118 .cse123)) .cse119 .cse120))) .cse125)))) (and (or .cse77 (and (or .cse108 .cse40 .cse41 (and (or .cse78 (not (= .cse109 .cse79)) .cse80) (or (not (= .cse109 .cse81)) .cse82)) .cse110) (or (and (or (not (= .cse111 .cse79)) .cse78 .cse80) (or (not (= .cse111 .cse81)) .cse82)) .cse112 .cse113 .cse45)) .cse83) (or .cse76 (and (or (and (or (not (= .cse109 .cse69)) .cse67) (or .cse70 (not (= .cse109 .cse71)) .cse72)) .cse108 .cse40 .cse41 .cse110) (or (and (or (not (= .cse111 .cse69)) .cse67) (or .cse70 (not (= .cse111 .cse71)) .cse72)) .cse112 .cse113 .cse45)))))))) (or .cse8 (and (or .cse13 .cse14 .cse15 (let ((.cse144 (and (or .cse122 .cse125 (let ((.cse155 (+ .cse9 .cse124))) (and (or (= |c_ULTIMATE.start_main_~A~0#1| (+ .cse116 .cse155)) .cse115) (or (= |c_ULTIMATE.start_main_~A~0#1| (+ .cse118 .cse155)) .cse119 .cse120)))) (or (let ((.cse156 (+ .cse9 .cse121))) (and (or .cse115 (= |c_ULTIMATE.start_main_~A~0#1| (+ .cse116 .cse156))) (or (= |c_ULTIMATE.start_main_~A~0#1| (+ .cse118 .cse156)) .cse119 .cse120))) .cse114))) (.cse145 (and (or .cse126 .cse127 (let ((.cse153 (+ .cse9 .cse134))) (and (or .cse128 (= |c_ULTIMATE.start_main_~A~0#1| (+ .cse129 .cse153))) (or .cse132 .cse133 (= |c_ULTIMATE.start_main_~A~0#1| (+ .cse131 .cse153)))))) (or .cse137 (let ((.cse154 (+ .cse9 .cse136))) (and (or (= |c_ULTIMATE.start_main_~A~0#1| (+ .cse131 .cse154)) .cse132 .cse133) (or (= |c_ULTIMATE.start_main_~A~0#1| (+ .cse129 .cse154)) .cse128))))))) (and (or .cse138 (and (or .cse112 (and (or .cse139 .cse140 (not (= .cse111 .cse141))) (or (not (= .cse111 .cse142)) .cse143)) .cse144 .cse45) (or .cse40 (and (or .cse139 (not (= .cse109 .cse141)) .cse140) (or .cse143 (not (= .cse109 .cse142)))) .cse145 .cse41 .cse110)) .cse146) (or (and (or .cse112 (and (or .cse147 .cse148 (not (= .cse111 .cse149))) (or .cse150 (not (= .cse111 .cse151)))) .cse144 .cse45) (or .cse40 .cse145 (and (or .cse147 (not (= .cse109 .cse149)) .cse148) (or .cse150 (not (= .cse109 .cse151)))) .cse41 .cse110)) .cse152)))) (or .cse18 .cse19 (let ((.cse157 (and (or (let ((.cse161 (+ .cse9 .cse94))) (and (or .cse89 (= |c_ULTIMATE.start_main_~A~0#1| (+ .cse88 .cse161))) (or (= |c_ULTIMATE.start_main_~A~0#1| (+ .cse84 .cse161)) .cse86 .cse87))) .cse95) (or .cse91 .cse92 (let ((.cse162 (+ .cse9 .cse90))) (and (or (= |c_ULTIMATE.start_main_~A~0#1| (+ .cse88 .cse162)) .cse89) (or (= |c_ULTIMATE.start_main_~A~0#1| (+ .cse84 .cse162)) .cse86 .cse87)))))) (.cse158 (and (or (let ((.cse159 (+ .cse9 .cse102))) (and (or (= |c_ULTIMATE.start_main_~A~0#1| (+ .cse96 .cse159)) .cse98) (or (= |c_ULTIMATE.start_main_~A~0#1| (+ .cse100 .cse159)) .cse99 .cse101))) .cse103) (or .cse106 .cse107 (let ((.cse160 (+ .cse9 .cse105))) (and (or .cse99 (= |c_ULTIMATE.start_main_~A~0#1| (+ .cse100 .cse160)) .cse101) (or (= |c_ULTIMATE.start_main_~A~0#1| (+ .cse96 .cse160)) .cse98))))))) (and (or .cse138 .cse146 (and (or .cse28 (and (or (not (= .cse73 .cse142)) .cse143) (or .cse139 .cse140 (not (= .cse73 .cse141)))) .cse157 .cse29 .cse75) (or .cse25 .cse158 .cse65 (and (or .cse143 (not (= .cse68 .cse142))) (or .cse139 .cse140 (not (= .cse68 .cse141))))))) (or (and (or .cse28 .cse157 .cse29 (and (or .cse147 .cse148 (not (= .cse73 .cse149))) (or .cse150 (not (= .cse73 .cse151)))) .cse75) (or .cse25 .cse158 .cse65 (and (or .cse147 .cse148 (not (= .cse68 .cse149))) (or .cse150 (not (= .cse68 .cse151)))))) .cse152))))))))))) .cse5) (or (let ((.cse185 (let ((.cse206 (* (+ |c_ULTIMATE.start_main_~q~0#1| .cse219) |c_ULTIMATE.start_main_~B~0#1|)) (.cse211 (* (+ |c_ULTIMATE.start_main_~q~0#1| .cse218) |c_ULTIMATE.start_main_~B~0#1|))) (and (or (let ((.cse207 (+ |c_ULTIMATE.start_main_~r~0#1| .cse212))) (and (or (= |c_ULTIMATE.start_main_~A~0#1| (+ .cse206 .cse207)) .cse208 .cse209) (or .cse210 (= |c_ULTIMATE.start_main_~A~0#1| (+ .cse211 .cse207))))) .cse213) (or .cse214 (let ((.cse215 (+ |c_ULTIMATE.start_main_~r~0#1| .cse216))) (and (or .cse208 .cse209 (= |c_ULTIMATE.start_main_~A~0#1| (+ .cse206 .cse215))) (or .cse210 (= |c_ULTIMATE.start_main_~A~0#1| (+ .cse211 .cse215))))) .cse217)))) (.cse184 (let ((.cse194 (* (+ |c_ULTIMATE.start_main_~q~0#1| .cse205) |c_ULTIMATE.start_main_~B~0#1|)) (.cse198 (* (+ |c_ULTIMATE.start_main_~q~0#1| .cse204) |c_ULTIMATE.start_main_~B~0#1|))) (and (or .cse192 (let ((.cse195 (+ |c_ULTIMATE.start_main_~r~0#1| .cse199))) (and (or .cse193 (= |c_ULTIMATE.start_main_~A~0#1| (+ .cse194 .cse195))) (or .cse196 .cse197 (= |c_ULTIMATE.start_main_~A~0#1| (+ .cse198 .cse195)))))) (or (let ((.cse200 (+ |c_ULTIMATE.start_main_~r~0#1| .cse201))) (and (or .cse193 (= |c_ULTIMATE.start_main_~A~0#1| (+ .cse194 .cse200))) (or .cse196 .cse197 (= |c_ULTIMATE.start_main_~A~0#1| (+ .cse198 .cse200))))) .cse202 .cse203))))) (and (or (and (or .cse181 .cse182 .cse183 .cse184) (or .cse185 .cse186 .cse187 .cse188 .cse189)) .cse0 .cse1) (or .cse8 (and (or .cse185 .cse190 .cse187 .cse188 .cse189) (or .cse182 .cse191 .cse183 .cse184))))) .cse7 .cse220) (or (let ((.cse256 (* 2 |c_ULTIMATE.start_main_~d~0#1|)) (.cse239 (* 2 |c_ULTIMATE.start_main_~p~0#1|))) (let ((.cse221 (div .cse239 4)) (.cse224 (div .cse256 4))) (let ((.cse223 (+ 1 .cse224)) (.cse231 (+ |c_ULTIMATE.start_main_~r~0#1| (- .cse256))) (.cse237 (+ |c_ULTIMATE.start_main_~q~0#1| .cse239)) (.cse222 (* |c_ULTIMATE.start_main_~B~0#1| .cse221))) (and (or (= 1 .cse221) (and (or .cse0 (not (= .cse222 .cse223)) .cse1) (or .cse8 (not (= .cse222 .cse224)))) (let ((.cse229 (= 0 (mod .cse221 2))) (.cse238 (div .cse239 8)) (.cse236 (< .cse221 0))) (let ((.cse228 (not .cse236)) (.cse230 (* (+ .cse237 (+ 1 .cse238)) |c_ULTIMATE.start_main_~B~0#1|)) (.cse225 (* (+ .cse237 .cse238) |c_ULTIMATE.start_main_~B~0#1|)) (.cse227 (and (not .cse229) .cse236)) (.cse232 (- (div .cse222 2))) (.cse234 (= 0 (mod .cse222 2))) (.cse233 (< .cse222 0))) (and (or (let ((.cse226 (+ .cse231 .cse232))) (and (or (= |c_ULTIMATE.start_main_~A~0#1| (+ .cse225 .cse226)) .cse227) (or .cse228 .cse229 (= |c_ULTIMATE.start_main_~A~0#1| (+ .cse230 .cse226))))) (and .cse233 (not .cse234))) (or (let ((.cse235 (+ .cse231 (+ (- 1) .cse232)))) (and (or .cse228 .cse229 (= |c_ULTIMATE.start_main_~A~0#1| (+ .cse230 .cse235))) (or (= |c_ULTIMATE.start_main_~A~0#1| (+ .cse225 .cse235)) .cse227))) .cse234 (not .cse233))))) .cse7) (let ((.cse241 (+ 1 .cse221))) (let ((.cse240 (* |c_ULTIMATE.start_main_~B~0#1| .cse241))) (or (and (or .cse0 .cse1 (not (= .cse240 .cse223))) (or .cse8 (not (= .cse240 .cse224)))) (= 1 .cse241) .cse4 (let ((.cse255 (+ .cse221 1))) (let ((.cse246 (= 0 (mod .cse255 2))) (.cse253 (div .cse255 2)) (.cse254 (< .cse241 0)) (.cse252 (+ |c_ULTIMATE.start_main_~B~0#1| .cse222))) (let ((.cse250 (= 0 (mod .cse252 2))) (.cse242 (< .cse240 0)) (.cse247 (not .cse254)) (.cse248 (* (+ .cse237 (+ 1 .cse253)) |c_ULTIMATE.start_main_~B~0#1|)) (.cse245 (and .cse254 (not .cse246))) (.cse243 (* (+ .cse237 .cse253) |c_ULTIMATE.start_main_~B~0#1|)) (.cse249 (- (div .cse252 2)))) (and (or (not .cse242) (let ((.cse244 (+ .cse231 (+ (- 1) .cse249)))) (and (or (= |c_ULTIMATE.start_main_~A~0#1| (+ .cse243 .cse244)) .cse245) (or .cse246 .cse247 (= |c_ULTIMATE.start_main_~A~0#1| (+ .cse248 .cse244))))) .cse250) (or (and (not .cse250) .cse242) (let ((.cse251 (+ .cse231 .cse249))) (and (or .cse246 .cse247 (= |c_ULTIMATE.start_main_~A~0#1| (+ .cse248 .cse251))) (or .cse245 (= |c_ULTIMATE.start_main_~A~0#1| (+ .cse243 .cse251)))))))))) .cse5))))))) .cse12) (or (let ((.cse258 (let ((.cse263 (* (+ .cse37 .cse205) |c_ULTIMATE.start_main_~B~0#1|)) (.cse265 (* (+ .cse37 .cse204) |c_ULTIMATE.start_main_~B~0#1|))) (and (or (let ((.cse264 (+ .cse31 .cse199))) (and (or (= |c_ULTIMATE.start_main_~A~0#1| (+ .cse263 .cse264)) .cse193) (or .cse196 .cse197 (= |c_ULTIMATE.start_main_~A~0#1| (+ .cse265 .cse264))))) .cse192) (or .cse202 (let ((.cse266 (+ .cse31 .cse201))) (and (or .cse193 (= |c_ULTIMATE.start_main_~A~0#1| (+ .cse263 .cse266))) (or .cse196 .cse197 (= |c_ULTIMATE.start_main_~A~0#1| (+ .cse265 .cse266))))) .cse203)))) (.cse257 (let ((.cse259 (* (+ .cse37 .cse219) |c_ULTIMATE.start_main_~B~0#1|)) (.cse261 (* (+ .cse37 .cse218) |c_ULTIMATE.start_main_~B~0#1|))) (and (or (let ((.cse260 (+ .cse31 .cse212))) (and (or (= |c_ULTIMATE.start_main_~A~0#1| (+ .cse259 .cse260)) .cse208 .cse209) (or .cse210 (= |c_ULTIMATE.start_main_~A~0#1| (+ .cse261 .cse260))))) .cse213) (or .cse214 (let ((.cse262 (+ .cse31 .cse216))) (and (or (= |c_ULTIMATE.start_main_~A~0#1| (+ .cse259 .cse262)) .cse208 .cse209) (or .cse210 (= |c_ULTIMATE.start_main_~A~0#1| (+ .cse261 .cse262))))) .cse217))))) (and (or .cse0 (and (or .cse186 .cse187 .cse188 .cse189 .cse257) (or .cse181 .cse182 .cse183 .cse258)) .cse1) (or .cse8 (and (or .cse182 .cse191 .cse183 .cse258) (or .cse190 .cse187 .cse188 .cse189 .cse257))))) .cse7 .cse220) (or (let ((.cse300 (* |c_ULTIMATE.start_main_~B~0#1| .cse205)) (.cse268 (* |c_ULTIMATE.start_main_~B~0#1| .cse218))) (let ((.cse270 (* |c_ULTIMATE.start_main_~B~0#1| .cse219)) (.cse352 (+ .cse218 1)) (.cse351 (+ |c_ULTIMATE.start_main_~B~0#1| .cse268)) (.cse297 (* |c_ULTIMATE.start_main_~B~0#1| .cse204)) (.cse355 (+ .cse205 1)) (.cse354 (+ |c_ULTIMATE.start_main_~B~0#1| .cse300))) (let ((.cse314 (- (div .cse354 2))) (.cse340 (div .cse355 2)) (.cse341 (< .cse204 0)) (.cse308 (= 0 (mod .cse355 2))) (.cse339 (< .cse297 0)) (.cse303 (= 0 (mod .cse354 2))) (.cse320 (= 0 (mod .cse205 2))) (.cse343 (< .cse205 0)) (.cse342 (div |c_ULTIMATE.start_main_~p~0#1| 16)) (.cse326 (= 0 (mod .cse300 2))) (.cse321 (- (div .cse300 2))) (.cse344 (< .cse300 0)) (.cse295 (= 0 (mod .cse268 2))) (.cse346 (div .cse353 4)) (.cse290 (= 0 (mod .cse218 2))) (.cse347 (< .cse218 0)) (.cse345 (< .cse268 0)) (.cse291 (- (div .cse268 2))) (.cse280 (- (div .cse351 2))) (.cse277 (= 0 (mod .cse352 2))) (.cse348 (div .cse352 2)) (.cse349 (< .cse219 0)) (.cse350 (< .cse270 0)) (.cse282 (= 0 (mod .cse351 2)))) (let ((.cse267 (= 1 .cse218)) (.cse272 (= 1 .cse219)) (.cse273 (and .cse350 (not .cse282))) (.cse281 (not .cse350)) (.cse274 (not .cse349)) (.cse275 (* (+ .cse11 (+ 1 .cse348)) |c_ULTIMATE.start_main_~B~0#1|)) (.cse278 (and .cse349 (not .cse277))) (.cse279 (* (+ .cse11 .cse348) |c_ULTIMATE.start_main_~B~0#1|)) (.cse284 (+ (- 1) .cse280)) (.cse294 (+ (- 1) .cse291)) (.cse296 (not .cse345)) (.cse287 (and (not .cse290) .cse347)) (.cse285 (* (+ .cse11 .cse346) |c_ULTIMATE.start_main_~B~0#1|)) (.cse289 (not .cse347)) (.cse288 (* (+ .cse11 (+ 1 .cse346)) |c_ULTIMATE.start_main_~B~0#1|)) (.cse292 (and .cse345 (not .cse295))) (.cse298 (= 1 .cse204)) (.cse302 (= 1 .cse205)) (.cse323 (not .cse344)) (.cse325 (+ (- 1) .cse321)) (.cse322 (and (not .cse326) .cse344)) (.cse318 (* (+ .cse11 (+ 1 .cse342)) |c_ULTIMATE.start_main_~B~0#1|)) (.cse319 (not .cse343)) (.cse315 (and .cse343 (not .cse320))) (.cse316 (* (+ .cse11 .cse342) |c_ULTIMATE.start_main_~B~0#1|)) (.cse312 (and .cse339 (not .cse303))) (.cse304 (and .cse341 (not .cse308))) (.cse305 (* (+ .cse11 .cse340) |c_ULTIMATE.start_main_~B~0#1|)) (.cse309 (not .cse341)) (.cse307 (* (+ .cse11 (+ 1 .cse340)) |c_ULTIMATE.start_main_~B~0#1|)) (.cse310 (+ (- 1) .cse314)) (.cse311 (not .cse339))) (and (or .cse8 (and (or (let ((.cse269 (and (or (let ((.cse286 (+ .cse9 .cse291))) (and (or (= |c_ULTIMATE.start_main_~A~0#1| (+ .cse285 .cse286)) .cse287) (or (= |c_ULTIMATE.start_main_~A~0#1| (+ .cse288 .cse286)) .cse289 .cse290))) .cse292) (or (let ((.cse293 (+ .cse9 .cse294))) (and (or (= |c_ULTIMATE.start_main_~A~0#1| (+ .cse288 .cse293)) .cse289 .cse290) (or (= |c_ULTIMATE.start_main_~A~0#1| (+ .cse285 .cse293)) .cse287))) .cse295 .cse296))) (.cse271 (and (or .cse273 (let ((.cse276 (+ .cse9 .cse280))) (and (or .cse274 (= |c_ULTIMATE.start_main_~A~0#1| (+ .cse275 .cse276)) .cse277) (or .cse278 (= |c_ULTIMATE.start_main_~A~0#1| (+ .cse279 .cse276)))))) (or .cse281 .cse282 (let ((.cse283 (+ .cse9 .cse284))) (and (or .cse274 .cse277 (= |c_ULTIMATE.start_main_~A~0#1| (+ .cse275 .cse283))) (or .cse278 (= |c_ULTIMATE.start_main_~A~0#1| (+ .cse279 .cse283))))))))) (and (or (and (or .cse267 .cse210 (and (or (not (= .cse268 .cse151)) .cse150) (or .cse147 .cse148 (not (= .cse268 .cse149)))) .cse269) (or (and (or .cse147 .cse148 (not (= .cse270 .cse149))) (or .cse150 (not (= .cse270 .cse151)))) .cse208 .cse209 .cse271 .cse272)) .cse152) (or .cse138 .cse146 (and (or .cse267 .cse210 (and (or (not (= .cse268 .cse141)) .cse139 .cse140) (or .cse143 (not (= .cse268 .cse142)))) .cse269) (or (and (or .cse139 .cse140 (not (= .cse270 .cse141))) (or .cse143 (not (= .cse270 .cse142)))) .cse208 .cse209 .cse271 .cse272))))) .cse187 .cse188 .cse189) (or .cse182 (let ((.cse301 (and (or (let ((.cse317 (+ .cse9 .cse321))) (and (or .cse315 (= |c_ULTIMATE.start_main_~A~0#1| (+ .cse316 .cse317))) (or (= |c_ULTIMATE.start_main_~A~0#1| (+ .cse318 .cse317)) .cse319 .cse320))) .cse322) (or .cse323 (let ((.cse324 (+ .cse9 .cse325))) (and (or .cse315 (= |c_ULTIMATE.start_main_~A~0#1| (+ .cse316 .cse324))) (or (= |c_ULTIMATE.start_main_~A~0#1| (+ .cse318 .cse324)) .cse319 .cse320))) .cse326))) (.cse299 (and (or .cse303 (let ((.cse306 (+ .cse9 .cse310))) (and (or .cse304 (= |c_ULTIMATE.start_main_~A~0#1| (+ .cse305 .cse306))) (or (= |c_ULTIMATE.start_main_~A~0#1| (+ .cse307 .cse306)) .cse308 .cse309))) .cse311) (or .cse312 (let ((.cse313 (+ .cse9 .cse314))) (and (or .cse304 (= |c_ULTIMATE.start_main_~A~0#1| (+ .cse305 .cse313))) (or .cse308 .cse309 (= |c_ULTIMATE.start_main_~A~0#1| (+ .cse307 .cse313))))))))) (and (or (and (or .cse196 .cse197 (and (or .cse147 .cse148 (not (= .cse297 .cse149))) (or .cse150 (not (= .cse297 .cse151)))) .cse298 .cse299) (or (and (or .cse150 (not (= .cse300 .cse151))) (or .cse147 .cse148 (not (= .cse300 .cse149)))) .cse193 .cse301 .cse302)) .cse152) (or (and (or (and (or .cse139 (not (= .cse300 .cse141)) .cse140) (or (not (= .cse300 .cse142)) .cse143)) .cse193 .cse301 .cse302) (or (and (or (not (= .cse297 .cse142)) .cse143) (or (not (= .cse297 .cse141)) .cse139 .cse140)) .cse196 .cse197 .cse298 .cse299)) .cse138 .cse146))) .cse183))) (or .cse0 .cse1 (and (or (let ((.cse327 (and (or .cse295 (let ((.cse331 (+ .cse3 .cse294))) (and (or .cse289 .cse290 (= |c_ULTIMATE.start_main_~A~0#1| (+ .cse288 .cse331))) (or (= |c_ULTIMATE.start_main_~A~0#1| (+ .cse285 .cse331)) .cse287))) .cse296) (or (let ((.cse332 (+ .cse3 .cse291))) (and (or .cse287 (= |c_ULTIMATE.start_main_~A~0#1| (+ .cse285 .cse332))) (or .cse289 .cse290 (= |c_ULTIMATE.start_main_~A~0#1| (+ .cse288 .cse332))))) .cse292))) (.cse328 (and (or (let ((.cse329 (+ .cse3 .cse280))) (and (or .cse278 (= |c_ULTIMATE.start_main_~A~0#1| (+ .cse279 .cse329))) (or .cse274 (= |c_ULTIMATE.start_main_~A~0#1| (+ .cse275 .cse329)) .cse277))) .cse273) (or .cse281 .cse282 (let ((.cse330 (+ .cse3 .cse284))) (and (or .cse274 (= |c_ULTIMATE.start_main_~A~0#1| (+ .cse275 .cse330)) .cse277) (or .cse278 (= |c_ULTIMATE.start_main_~A~0#1| (+ .cse279 .cse330))))))))) (and (or (and (or .cse267 .cse210 .cse327 (and (or .cse78 .cse80 (not (= .cse268 .cse79))) (or (not (= .cse268 .cse81)) .cse82))) (or .cse328 (and (or .cse78 (not (= .cse270 .cse79)) .cse80) (or .cse82 (not (= .cse270 .cse81)))) .cse208 .cse209 .cse272)) .cse77 .cse83) (or .cse76 (and (or .cse267 .cse210 .cse327 (and (or (not (= .cse268 .cse69)) .cse67) (or .cse70 .cse72 (not (= .cse268 .cse71))))) (or .cse328 (and (or .cse70 (not (= .cse270 .cse71)) .cse72) (or (not (= .cse270 .cse69)) .cse67)) .cse208 .cse209 .cse272))))) .cse187 .cse188 .cse189) (or .cse182 (let ((.cse334 (and (or (let ((.cse337 (+ .cse3 .cse314))) (and (or (= |c_ULTIMATE.start_main_~A~0#1| (+ .cse307 .cse337)) .cse308 .cse309) (or .cse304 (= |c_ULTIMATE.start_main_~A~0#1| (+ .cse305 .cse337))))) .cse312) (or .cse303 (let ((.cse338 (+ .cse3 .cse310))) (and (or .cse304 (= |c_ULTIMATE.start_main_~A~0#1| (+ .cse305 .cse338))) (or .cse308 .cse309 (= |c_ULTIMATE.start_main_~A~0#1| (+ .cse307 .cse338))))) .cse311))) (.cse333 (and (or .cse323 (let ((.cse335 (+ .cse3 .cse325))) (and (or (= |c_ULTIMATE.start_main_~A~0#1| (+ .cse318 .cse335)) .cse319 .cse320) (or .cse315 (= |c_ULTIMATE.start_main_~A~0#1| (+ .cse316 .cse335))))) .cse326) (or .cse322 (let ((.cse336 (+ .cse3 .cse321))) (and (or (= |c_ULTIMATE.start_main_~A~0#1| (+ .cse318 .cse336)) .cse319 .cse320) (or .cse315 (= |c_ULTIMATE.start_main_~A~0#1| (+ .cse316 .cse336))))))))) (and (or .cse76 (and (or .cse333 .cse193 .cse302 (and (or .cse70 (not (= .cse300 .cse71)) .cse72) (or (not (= .cse300 .cse69)) .cse67))) (or .cse196 (and (or .cse70 (not (= .cse297 .cse71)) .cse72) (or (not (= .cse297 .cse69)) .cse67)) .cse197 .cse298 .cse334))) (or .cse77 (and (or .cse196 .cse197 (and (or (not (= .cse297 .cse81)) .cse82) (or .cse78 .cse80 (not (= .cse297 .cse79)))) .cse298 .cse334) (or .cse333 .cse193 (and (or (not (= .cse300 .cse79)) .cse78 .cse80) (or .cse82 (not (= .cse300 .cse81)))) .cse302)) .cse83))) .cse183)))))))) .cse7) (= (+ |c_ULTIMATE.start_main_~A~0#1| (* |c_ULTIMATE.start_main_~r~0#1| (- 1)) (* |c_ULTIMATE.start_main_~B~0#1| (- 10))) |c_ULTIMATE.start_main_~B~0#1|))))))))) is different from false [2023-02-18 18:32:05,732 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 18:32:07,159 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 18:32:09,850 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 18:32:23,049 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 18:32:25,052 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 18:32:27,062 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 18:32:28,588 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 18:32:47,464 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 18:32:50,282 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 18:32:52,165 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 18:32:53,832 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 18:32:55,258 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 18:32:58,462 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 18:33:00,481 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 18:33:08,693 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 18:33:10,371 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 18:33:13,937 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 18:33:13,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 18:33:13,946 INFO L93 Difference]: Finished difference Result 453 states and 608 transitions. [2023-02-18 18:33:13,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-02-18 18:33:13,946 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.1333333333333333) internal successors, (64), 27 states have internal predecessors, (64), 18 states have call successors, (48), 3 states have call predecessors, (48), 2 states have return successors, (46), 17 states have call predecessors, (46), 16 states have call successors, (46) Word has length 146 [2023-02-18 18:33:13,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 18:33:13,948 INFO L225 Difference]: With dead ends: 453 [2023-02-18 18:33:13,948 INFO L226 Difference]: Without dead ends: 411 [2023-02-18 18:33:13,951 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 255 SyntacticMatches, 15 SemanticMatches, 46 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 271 ImplicationChecksByTransitivity, 190.4s TimeCoverageRelationStatistics Valid=519, Invalid=1528, Unknown=31, NotChecked=178, Total=2256 [2023-02-18 18:33:13,951 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 107 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 1441 mSolverCounterSat, 245 mSolverCounterUnsat, 47 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 158.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 1874 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 245 IncrementalHoareTripleChecker+Valid, 1441 IncrementalHoareTripleChecker+Invalid, 47 IncrementalHoareTripleChecker+Unknown, 141 IncrementalHoareTripleChecker+Unchecked, 159.2s IncrementalHoareTripleChecker+Time [2023-02-18 18:33:13,951 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 293 Invalid, 1874 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [245 Valid, 1441 Invalid, 47 Unknown, 141 Unchecked, 159.2s Time] [2023-02-18 18:33:13,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2023-02-18 18:33:14,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 407. [2023-02-18 18:33:14,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 239 states have (on average 1.1422594142259415) internal successors, (273), 266 states have internal predecessors, (273), 137 states have call successors, (137), 30 states have call predecessors, (137), 30 states have return successors, (137), 110 states have call predecessors, (137), 137 states have call successors, (137) [2023-02-18 18:33:14,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 547 transitions. [2023-02-18 18:33:14,847 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 547 transitions. Word has length 146 [2023-02-18 18:33:14,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 18:33:14,848 INFO L495 AbstractCegarLoop]: Abstraction has 407 states and 547 transitions. [2023-02-18 18:33:14,848 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.1333333333333333) internal successors, (64), 27 states have internal predecessors, (64), 18 states have call successors, (48), 3 states have call predecessors, (48), 2 states have return successors, (46), 17 states have call predecessors, (46), 16 states have call successors, (46) [2023-02-18 18:33:14,849 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 547 transitions. [2023-02-18 18:33:14,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2023-02-18 18:33:14,855 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 18:33:14,855 INFO L195 NwaCegarLoop]: trace histogram [25, 24, 24, 7, 7, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 18:33:14,865 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-02-18 18:33:15,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-02-18 18:33:15,061 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 18:33:15,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 18:33:15,061 INFO L85 PathProgramCache]: Analyzing trace with hash -476962413, now seen corresponding path program 5 times [2023-02-18 18:33:15,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 18:33:15,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169920245] [2023-02-18 18:33:15,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 18:33:15,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 18:33:15,067 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 18:33:15,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [747778043] [2023-02-18 18:33:15,067 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-02-18 18:33:15,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 18:33:15,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 18:33:15,070 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 18:33:15,070 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-02-18 18:33:26,257 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 15 check-sat command(s) [2023-02-18 18:33:26,257 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 18:33:26,262 INFO L263 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-18 18:33:26,264 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 18:34:31,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 18:34:31,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169920245] [2023-02-18 18:34:31,923 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 18:34:31,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [747778043] [2023-02-18 18:34:31,924 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2023-02-18 18:34:31,932 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-02-18 18:34:32,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 18:34:32,125 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Probably an infinite loop! at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtils.preprocessDualFiniteJunction(QuantifierPushUtils.java:124) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:323) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:188) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:295) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:345) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:188) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:65) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:295) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:345) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:188) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:65) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:295) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:345) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:188) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:65) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:295) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:345) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:188) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:295) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:281) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:90) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:299) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-02-18 18:34:32,129 INFO L158 Benchmark]: Toolchain (without parser) took 551803.20ms. Allocated memory was 121.6MB in the beginning and 262.1MB in the end (delta: 140.5MB). Free memory was 87.9MB in the beginning and 214.1MB in the end (delta: -126.3MB). Peak memory consumption was 165.6MB. Max. memory is 16.1GB. [2023-02-18 18:34:32,129 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 92.3MB. Free memory is still 67.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-18 18:34:32,129 INFO L158 Benchmark]: CACSL2BoogieTranslator took 179.55ms. Allocated memory is still 121.6MB. Free memory was 87.9MB in the beginning and 77.3MB in the end (delta: 10.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-02-18 18:34:32,130 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.26ms. Allocated memory is still 121.6MB. Free memory was 77.3MB in the beginning and 75.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-18 18:34:32,130 INFO L158 Benchmark]: Boogie Preprocessor took 33.60ms. Allocated memory is still 121.6MB. Free memory was 75.7MB in the beginning and 74.6MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-18 18:34:32,130 INFO L158 Benchmark]: RCFGBuilder took 187.36ms. Allocated memory is still 121.6MB. Free memory was 74.6MB in the beginning and 64.1MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-18 18:34:32,130 INFO L158 Benchmark]: TraceAbstraction took 551373.48ms. Allocated memory was 121.6MB in the beginning and 262.1MB in the end (delta: 140.5MB). Free memory was 63.7MB in the beginning and 214.1MB in the end (delta: -150.5MB). Peak memory consumption was 140.4MB. Max. memory is 16.1GB. [2023-02-18 18:34:32,131 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.12ms. Allocated memory is still 92.3MB. Free memory is still 67.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 179.55ms. Allocated memory is still 121.6MB. Free memory was 87.9MB in the beginning and 77.3MB in the end (delta: 10.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.26ms. Allocated memory is still 121.6MB. Free memory was 77.3MB in the beginning and 75.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 33.60ms. Allocated memory is still 121.6MB. Free memory was 75.7MB in the beginning and 74.6MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 187.36ms. Allocated memory is still 121.6MB. Free memory was 74.6MB in the beginning and 64.1MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 551373.48ms. Allocated memory was 121.6MB in the beginning and 262.1MB in the end (delta: 140.5MB). Free memory was 63.7MB in the beginning and 214.1MB in the end (delta: -150.5MB). Peak memory consumption was 140.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: Probably an infinite loop! de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Probably an infinite loop!: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtils.preprocessDualFiniteJunction(QuantifierPushUtils.java:124) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2023-02-18 18:34:32,341 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2023-02-18 18:34:32,381 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 137 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/nla-digbench-scaling/hard2_valuebound20.c -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 1619c1c02ba7c9b660af32e6427e3b3d5cd6ca3ff286b9db386918ae0c8b508c --- Real Ultimate output --- This is Ultimate 0.2.2-?-574ddb4 [2023-02-18 18:34:33,860 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-18 18:34:33,862 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-18 18:34:33,888 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-18 18:34:33,888 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-18 18:34:33,889 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-18 18:34:33,890 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-18 18:34:33,891 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-18 18:34:33,892 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-18 18:34:33,892 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-18 18:34:33,893 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-18 18:34:33,894 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-18 18:34:33,894 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-18 18:34:33,895 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-18 18:34:33,895 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-18 18:34:33,896 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-18 18:34:33,897 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-18 18:34:33,897 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-18 18:34:33,898 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-18 18:34:33,899 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-18 18:34:33,900 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-18 18:34:33,901 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-18 18:34:33,902 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-18 18:34:33,902 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-18 18:34:33,904 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-18 18:34:33,905 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-18 18:34:33,905 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-18 18:34:33,905 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-18 18:34:33,906 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-18 18:34:33,906 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-18 18:34:33,907 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-18 18:34:33,907 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-18 18:34:33,907 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-18 18:34:33,908 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-18 18:34:33,909 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-18 18:34:33,909 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-18 18:34:33,909 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-18 18:34:33,909 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-18 18:34:33,910 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-18 18:34:33,910 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-18 18:34:33,911 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-18 18:34:33,911 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-02-18 18:34:33,942 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-18 18:34:33,942 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-18 18:34:33,943 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-18 18:34:33,943 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-18 18:34:33,944 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-18 18:34:33,944 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-18 18:34:33,945 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-18 18:34:33,945 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-18 18:34:33,945 INFO L138 SettingsManager]: * Use SBE=true [2023-02-18 18:34:33,945 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-18 18:34:33,945 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-18 18:34:33,946 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-18 18:34:33,946 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-18 18:34:33,946 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-18 18:34:33,946 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-18 18:34:33,946 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-18 18:34:33,946 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-18 18:34:33,946 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-02-18 18:34:33,947 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-02-18 18:34:33,947 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-18 18:34:33,947 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-18 18:34:33,947 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-18 18:34:33,947 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-18 18:34:33,947 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-18 18:34:33,948 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-18 18:34:33,948 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-18 18:34:33,948 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 18:34:33,948 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-18 18:34:33,948 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-18 18:34:33,948 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-18 18:34:33,949 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-02-18 18:34:33,949 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-02-18 18:34:33,949 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-18 18:34:33,949 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-18 18:34:33,949 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-18 18:34:33,949 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-18 18:34:33,949 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-02-18 18:34:33,950 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-18 18:34:33,950 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 -> 1619c1c02ba7c9b660af32e6427e3b3d5cd6ca3ff286b9db386918ae0c8b508c [2023-02-18 18:34:34,155 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-18 18:34:34,174 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-18 18:34:34,176 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-18 18:34:34,178 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-18 18:34:34,179 INFO L275 PluginConnector]: CDTParser initialized [2023-02-18 18:34:34,180 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/hard2_valuebound20.c [2023-02-18 18:34:35,217 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-18 18:34:35,367 INFO L351 CDTParser]: Found 1 translation units. [2023-02-18 18:34:35,368 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/hard2_valuebound20.c [2023-02-18 18:34:35,374 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f02aee26b/a2ac46a9e8ac41b0a3617e24387e2ee3/FLAGb3fc0aa3d [2023-02-18 18:34:35,384 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f02aee26b/a2ac46a9e8ac41b0a3617e24387e2ee3 [2023-02-18 18:34:35,386 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-18 18:34:35,387 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-18 18:34:35,388 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-18 18:34:35,388 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-18 18:34:35,397 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-18 18:34:35,398 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 06:34:35" (1/1) ... [2023-02-18 18:34:35,400 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1cebd31e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 06:34:35, skipping insertion in model container [2023-02-18 18:34:35,401 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 06:34:35" (1/1) ... [2023-02-18 18:34:35,406 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-18 18:34:35,422 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-18 18:34:35,540 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/nla-digbench-scaling/hard2_valuebound20.c[526,539] [2023-02-18 18:34:35,555 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 18:34:35,565 INFO L203 MainTranslator]: Completed pre-run [2023-02-18 18:34:35,578 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/nla-digbench-scaling/hard2_valuebound20.c[526,539] [2023-02-18 18:34:35,591 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 18:34:35,604 INFO L208 MainTranslator]: Completed translation [2023-02-18 18:34:35,605 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 06:34:35 WrapperNode [2023-02-18 18:34:35,605 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-18 18:34:35,606 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-18 18:34:35,606 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-18 18:34:35,606 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-18 18:34:35,611 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 06:34:35" (1/1) ... [2023-02-18 18:34:35,618 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 06:34:35" (1/1) ... [2023-02-18 18:34:35,635 INFO L138 Inliner]: procedures = 14, calls = 23, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 63 [2023-02-18 18:34:35,636 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-18 18:34:35,636 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-18 18:34:35,637 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-18 18:34:35,637 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-18 18:34:35,643 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 06:34:35" (1/1) ... [2023-02-18 18:34:35,644 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 06:34:35" (1/1) ... [2023-02-18 18:34:35,653 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 06:34:35" (1/1) ... [2023-02-18 18:34:35,654 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 06:34:35" (1/1) ... [2023-02-18 18:34:35,664 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 06:34:35" (1/1) ... [2023-02-18 18:34:35,667 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 06:34:35" (1/1) ... [2023-02-18 18:34:35,671 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 06:34:35" (1/1) ... [2023-02-18 18:34:35,674 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 06:34:35" (1/1) ... [2023-02-18 18:34:35,676 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-18 18:34:35,677 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-18 18:34:35,677 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-18 18:34:35,677 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-18 18:34:35,678 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 06:34:35" (1/1) ... [2023-02-18 18:34:35,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 18:34:35,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 18:34:35,706 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-18 18:34:35,742 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-18 18:34:35,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-02-18 18:34:35,743 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-18 18:34:35,743 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-18 18:34:35,743 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-02-18 18:34:35,743 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-02-18 18:34:35,724 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-18 18:34:35,798 INFO L235 CfgBuilder]: Building ICFG [2023-02-18 18:34:35,800 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-18 18:34:36,026 INFO L276 CfgBuilder]: Performing block encoding [2023-02-18 18:34:36,030 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-18 18:34:36,030 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2023-02-18 18:34:36,032 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 06:34:36 BoogieIcfgContainer [2023-02-18 18:34:36,032 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-18 18:34:36,033 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-18 18:34:36,033 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-18 18:34:36,035 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-18 18:34:36,036 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.02 06:34:35" (1/3) ... [2023-02-18 18:34:36,036 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f47d8c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 06:34:36, skipping insertion in model container [2023-02-18 18:34:36,036 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 06:34:35" (2/3) ... [2023-02-18 18:34:36,036 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f47d8c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 06:34:36, skipping insertion in model container [2023-02-18 18:34:36,037 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 06:34:36" (3/3) ... [2023-02-18 18:34:36,037 INFO L112 eAbstractionObserver]: Analyzing ICFG hard2_valuebound20.c [2023-02-18 18:34:36,063 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-18 18:34:36,063 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-18 18:34:36,104 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-18 18:34:36,110 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;@5bb893e9, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-18 18:34:36,110 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-18 18:34:36,113 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 16 states have (on average 1.625) internal successors, (26), 17 states have internal predecessors, (26), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-18 18:34:36,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-18 18:34:36,120 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 18:34:36,121 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 18:34:36,121 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 18:34:36,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 18:34:36,126 INFO L85 PathProgramCache]: Analyzing trace with hash -586848446, now seen corresponding path program 1 times [2023-02-18 18:34:36,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 18:34:36,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1215560810] [2023-02-18 18:34:36,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 18:34:36,136 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-18 18:34:36,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 18:34:36,139 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-18 18:34:36,156 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-18 18:34:36,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 18:34:36,205 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 1 conjunts are in the unsatisfiable core [2023-02-18 18:34:36,207 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 18:34:36,220 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-18 18:34:36,221 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 18:34:36,222 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 18:34:36,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1215560810] [2023-02-18 18:34:36,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1215560810] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 18:34:36,223 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 18:34:36,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-18 18:34:36,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292080675] [2023-02-18 18:34:36,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 18:34:36,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-18 18:34:36,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 18:34:36,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-18 18:34:36,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-18 18:34:36,253 INFO L87 Difference]: Start difference. First operand has 26 states, 16 states have (on average 1.625) internal successors, (26), 17 states have internal predecessors, (26), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 18:34:36,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 18:34:36,272 INFO L93 Difference]: Finished difference Result 49 states and 83 transitions. [2023-02-18 18:34:36,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-18 18:34:36,274 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-02-18 18:34:36,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 18:34:36,279 INFO L225 Difference]: With dead ends: 49 [2023-02-18 18:34:36,279 INFO L226 Difference]: Without dead ends: 22 [2023-02-18 18:34:36,282 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 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-18 18:34:36,286 INFO L413 NwaCegarLoop]: 34 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, 34 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-18 18:34:36,287 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 18:34:36,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-02-18 18:34:36,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2023-02-18 18:34:36,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-18 18:34:36,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 30 transitions. [2023-02-18 18:34:36,312 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 30 transitions. Word has length 9 [2023-02-18 18:34:36,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 18:34:36,312 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 30 transitions. [2023-02-18 18:34:36,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 18:34:36,312 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 30 transitions. [2023-02-18 18:34:36,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-18 18:34:36,315 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 18:34:36,315 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 18:34:36,325 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 (2)] Forceful destruction successful, exit code 0 [2023-02-18 18:34:36,521 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-18 18:34:36,521 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 18:34:36,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 18:34:36,522 INFO L85 PathProgramCache]: Analyzing trace with hash 1188158916, now seen corresponding path program 1 times [2023-02-18 18:34:36,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 18:34:36,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [484903083] [2023-02-18 18:34:36,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 18:34:36,523 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-18 18:34:36,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 18:34:36,524 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-18 18:34:36,526 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-18 18:34:36,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 18:34:36,599 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-18 18:34:36,600 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 18:34:36,627 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-18 18:34:36,629 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 18:34:36,629 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 18:34:36,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [484903083] [2023-02-18 18:34:36,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [484903083] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 18:34:36,630 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 18:34:36,630 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-18 18:34:36,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306301139] [2023-02-18 18:34:36,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 18:34:36,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-18 18:34:36,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 18:34:36,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-18 18:34:36,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-18 18:34:36,634 INFO L87 Difference]: Start difference. First operand 22 states and 30 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 18:34:36,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 18:34:36,731 INFO L93 Difference]: Finished difference Result 35 states and 47 transitions. [2023-02-18 18:34:36,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-18 18:34:36,732 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-02-18 18:34:36,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 18:34:36,732 INFO L225 Difference]: With dead ends: 35 [2023-02-18 18:34:36,732 INFO L226 Difference]: Without dead ends: 33 [2023-02-18 18:34:36,733 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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-18 18:34:36,733 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 11 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 18:34:36,734 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 93 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 18:34:36,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2023-02-18 18:34:36,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 26. [2023-02-18 18:34:36,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-18 18:34:36,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2023-02-18 18:34:36,740 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 9 [2023-02-18 18:34:36,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 18:34:36,740 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2023-02-18 18:34:36,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 18:34:36,740 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2023-02-18 18:34:36,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-02-18 18:34:36,745 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 18:34:36,745 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 18:34:36,755 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-18 18:34:36,949 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-18 18:34:36,949 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 18:34:36,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 18:34:36,950 INFO L85 PathProgramCache]: Analyzing trace with hash -697944935, now seen corresponding path program 1 times [2023-02-18 18:34:36,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 18:34:36,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1199729394] [2023-02-18 18:34:36,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 18:34:36,950 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-18 18:34:36,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 18:34:36,952 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-18 18:34:36,954 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-18 18:34:36,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 18:34:36,973 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-18 18:34:36,974 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 18:34:36,991 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 18:34:37,004 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 18:34:37,004 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 18:34:37,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1199729394] [2023-02-18 18:34:37,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1199729394] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 18:34:37,005 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 18:34:37,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-18 18:34:37,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592892037] [2023-02-18 18:34:37,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 18:34:37,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-18 18:34:37,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 18:34:37,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-18 18:34:37,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-18 18:34:37,007 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-18 18:34:37,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 18:34:37,115 INFO L93 Difference]: Finished difference Result 39 states and 50 transitions. [2023-02-18 18:34:37,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-18 18:34:37,116 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2023-02-18 18:34:37,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 18:34:37,116 INFO L225 Difference]: With dead ends: 39 [2023-02-18 18:34:37,116 INFO L226 Difference]: Without dead ends: 37 [2023-02-18 18:34:37,117 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 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-18 18:34:37,117 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 11 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 18:34:37,118 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 89 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 18:34:37,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2023-02-18 18:34:37,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 30. [2023-02-18 18:34:37,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-18 18:34:37,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2023-02-18 18:34:37,123 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 14 [2023-02-18 18:34:37,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 18:34:37,124 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2023-02-18 18:34:37,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-18 18:34:37,124 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2023-02-18 18:34:37,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-18 18:34:37,124 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 18:34:37,125 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 18:34:37,134 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-18 18:34:37,325 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-18 18:34:37,325 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 18:34:37,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 18:34:37,326 INFO L85 PathProgramCache]: Analyzing trace with hash 262992548, now seen corresponding path program 1 times [2023-02-18 18:34:37,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 18:34:37,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [21023486] [2023-02-18 18:34:37,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 18:34:37,327 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-18 18:34:37,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 18:34:37,330 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-18 18:34:37,332 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-18 18:34:37,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 18:34:37,379 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-18 18:34:37,381 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 18:34:37,405 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-18 18:34:37,405 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 18:34:37,405 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 18:34:37,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [21023486] [2023-02-18 18:34:37,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [21023486] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 18:34:37,406 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 18:34:37,406 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-18 18:34:37,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630098891] [2023-02-18 18:34:37,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 18:34:37,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-18 18:34:37,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 18:34:37,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-18 18:34:37,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-18 18:34:37,415 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-18 18:34:37,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 18:34:37,659 INFO L93 Difference]: Finished difference Result 58 states and 76 transitions. [2023-02-18 18:34:37,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-18 18:34:37,660 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2023-02-18 18:34:37,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 18:34:37,660 INFO L225 Difference]: With dead ends: 58 [2023-02-18 18:34:37,660 INFO L226 Difference]: Without dead ends: 44 [2023-02-18 18:34:37,661 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 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-18 18:34:37,661 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 8 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-18 18:34:37,662 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 96 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-18 18:34:37,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2023-02-18 18:34:37,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2023-02-18 18:34:37,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 28 states have internal predecessors, (31), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-02-18 18:34:37,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 55 transitions. [2023-02-18 18:34:37,668 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 55 transitions. Word has length 19 [2023-02-18 18:34:37,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 18:34:37,668 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 55 transitions. [2023-02-18 18:34:37,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-18 18:34:37,668 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 55 transitions. [2023-02-18 18:34:37,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-18 18:34:37,669 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 18:34:37,669 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 18:34:37,678 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-18 18:34:37,869 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-18 18:34:37,869 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 18:34:37,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 18:34:37,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1807142342, now seen corresponding path program 1 times [2023-02-18 18:34:37,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 18:34:37,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [91585811] [2023-02-18 18:34:37,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 18:34:37,871 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-18 18:34:37,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 18:34:37,872 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-18 18:34:37,874 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-18 18:34:37,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 18:34:37,924 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 11 conjunts are in the unsatisfiable core [2023-02-18 18:34:37,925 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 18:34:38,072 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-18 18:34:38,072 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 18:34:38,072 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 18:34:38,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [91585811] [2023-02-18 18:34:38,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [91585811] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 18:34:38,072 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 18:34:38,073 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-18 18:34:38,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845684972] [2023-02-18 18:34:38,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 18:34:38,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-18 18:34:38,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 18:34:38,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-18 18:34:38,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-02-18 18:34:38,074 INFO L87 Difference]: Start difference. First operand 44 states and 55 transitions. Second operand has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-18 18:34:38,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 18:34:38,415 INFO L93 Difference]: Finished difference Result 58 states and 66 transitions. [2023-02-18 18:34:38,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-18 18:34:38,416 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 26 [2023-02-18 18:34:38,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 18:34:38,416 INFO L225 Difference]: With dead ends: 58 [2023-02-18 18:34:38,416 INFO L226 Difference]: Without dead ends: 47 [2023-02-18 18:34:38,417 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2023-02-18 18:34:38,417 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 33 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-18 18:34:38,417 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 90 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-18 18:34:38,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2023-02-18 18:34:38,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2023-02-18 18:34:38,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 31 states have internal predecessors, (34), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-02-18 18:34:38,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2023-02-18 18:34:38,426 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 26 [2023-02-18 18:34:38,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 18:34:38,426 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2023-02-18 18:34:38,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-18 18:34:38,426 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2023-02-18 18:34:38,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-02-18 18:34:38,427 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 18:34:38,427 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 18:34:38,436 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-18 18:34:38,634 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-18 18:34:38,634 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 18:34:38,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 18:34:38,635 INFO L85 PathProgramCache]: Analyzing trace with hash -979933353, now seen corresponding path program 1 times [2023-02-18 18:34:38,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 18:34:38,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [824681536] [2023-02-18 18:34:38,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 18:34:38,636 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-18 18:34:38,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 18:34:38,641 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-18 18:34:38,642 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-18 18:34:38,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 18:34:38,687 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-18 18:34:38,688 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 18:34:38,715 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-02-18 18:34:38,716 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 18:34:38,976 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-02-18 18:34:38,976 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 18:34:38,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [824681536] [2023-02-18 18:34:38,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [824681536] provided 1 perfect and 1 imperfect interpolant sequences [2023-02-18 18:34:38,977 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-18 18:34:38,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2023-02-18 18:34:38,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086038979] [2023-02-18 18:34:38,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 18:34:38,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-18 18:34:38,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 18:34:38,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-18 18:34:38,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-02-18 18:34:38,978 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-02-18 18:34:39,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 18:34:39,735 INFO L93 Difference]: Finished difference Result 59 states and 68 transitions. [2023-02-18 18:34:39,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-18 18:34:39,741 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 36 [2023-02-18 18:34:39,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 18:34:39,742 INFO L225 Difference]: With dead ends: 59 [2023-02-18 18:34:39,742 INFO L226 Difference]: Without dead ends: 57 [2023-02-18 18:34:39,743 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2023-02-18 18:34:39,743 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 10 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-02-18 18:34:39,744 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 79 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-02-18 18:34:39,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2023-02-18 18:34:39,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 54. [2023-02-18 18:34:39,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 36 states have internal predecessors, (38), 12 states have call successors, (12), 7 states have call predecessors, (12), 7 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2023-02-18 18:34:39,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 61 transitions. [2023-02-18 18:34:39,755 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 61 transitions. Word has length 36 [2023-02-18 18:34:39,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 18:34:39,755 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 61 transitions. [2023-02-18 18:34:39,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-02-18 18:34:39,756 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 61 transitions. [2023-02-18 18:34:39,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-18 18:34:39,757 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 18:34:39,757 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 18:34:39,769 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-18 18:34:39,964 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-18 18:34:39,965 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 18:34:39,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 18:34:39,965 INFO L85 PathProgramCache]: Analyzing trace with hash -984335949, now seen corresponding path program 1 times [2023-02-18 18:34:39,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 18:34:39,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1783517389] [2023-02-18 18:34:39,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 18:34:39,966 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-18 18:34:39,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 18:34:39,967 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-18 18:34:39,968 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-18 18:34:40,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 18:34:40,017 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 13 conjunts are in the unsatisfiable core [2023-02-18 18:34:40,019 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 18:34:40,113 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-02-18 18:34:40,114 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 18:34:40,776 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-02-18 18:34:40,778 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 18:34:40,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1783517389] [2023-02-18 18:34:40,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1783517389] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 18:34:40,778 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 18:34:40,778 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 14 [2023-02-18 18:34:40,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777751295] [2023-02-18 18:34:40,779 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 18:34:40,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-18 18:34:40,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 18:34:40,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-18 18:34:40,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2023-02-18 18:34:40,780 INFO L87 Difference]: Start difference. First operand 54 states and 61 transitions. Second operand has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 12 states have internal predecessors, (25), 6 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2023-02-18 18:34:42,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 18:34:42,928 INFO L93 Difference]: Finished difference Result 104 states and 131 transitions. [2023-02-18 18:34:42,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-18 18:34:42,931 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 12 states have internal predecessors, (25), 6 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) Word has length 43 [2023-02-18 18:34:42,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 18:34:42,932 INFO L225 Difference]: With dead ends: 104 [2023-02-18 18:34:42,933 INFO L226 Difference]: Without dead ends: 91 [2023-02-18 18:34:42,933 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 67 SyntacticMatches, 6 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=114, Invalid=348, Unknown=0, NotChecked=0, Total=462 [2023-02-18 18:34:42,933 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 59 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-02-18 18:34:42,934 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 146 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-02-18 18:34:42,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2023-02-18 18:34:42,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 82. [2023-02-18 18:34:42,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 51 states have (on average 1.1568627450980393) internal successors, (59), 54 states have internal predecessors, (59), 20 states have call successors, (20), 10 states have call predecessors, (20), 10 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) [2023-02-18 18:34:42,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 98 transitions. [2023-02-18 18:34:42,952 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 98 transitions. Word has length 43 [2023-02-18 18:34:42,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 18:34:42,953 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 98 transitions. [2023-02-18 18:34:42,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 12 states have internal predecessors, (25), 6 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2023-02-18 18:34:42,953 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 98 transitions. [2023-02-18 18:34:42,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-02-18 18:34:42,956 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 18:34:42,956 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 18:34:42,967 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-18 18:34:43,164 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-18 18:34:43,165 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 18:34:43,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 18:34:43,165 INFO L85 PathProgramCache]: Analyzing trace with hash 1034157389, now seen corresponding path program 1 times [2023-02-18 18:34:43,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 18:34:43,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1335251870] [2023-02-18 18:34:43,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 18:34:43,166 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-18 18:34:43,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 18:34:43,167 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-18 18:34:43,167 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-18 18:34:43,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 18:34:43,226 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 19 conjunts are in the unsatisfiable core [2023-02-18 18:34:43,228 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 18:34:43,543 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 16 proven. 7 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-02-18 18:34:43,544 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 18:34:48,117 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 16 proven. 7 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-02-18 18:34:48,117 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 18:34:48,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1335251870] [2023-02-18 18:34:48,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1335251870] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 18:34:48,118 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 18:34:48,118 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 18 [2023-02-18 18:34:48,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227384530] [2023-02-18 18:34:48,118 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 18:34:48,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-02-18 18:34:48,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 18:34:48,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-02-18 18:34:48,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2023-02-18 18:34:48,120 INFO L87 Difference]: Start difference. First operand 82 states and 98 transitions. Second operand has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 16 states have internal predecessors, (31), 8 states have call successors, (18), 3 states have call predecessors, (18), 1 states have return successors, (16), 6 states have call predecessors, (16), 6 states have call successors, (16) [2023-02-18 18:34:58,073 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 18:35:05,158 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 18:35:08,133 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 18:35:21,412 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 18:35:23,275 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 18:35:25,690 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 18:35:34,506 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 18:35:40,021 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 18:35:53,452 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 18:35:56,195 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 18:36:03,174 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 18:36:06,081 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 18:36:13,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 18:36:13,172 INFO L93 Difference]: Finished difference Result 162 states and 218 transitions. [2023-02-18 18:36:13,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-02-18 18:36:13,190 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 16 states have internal predecessors, (31), 8 states have call successors, (18), 3 states have call predecessors, (18), 1 states have return successors, (16), 6 states have call predecessors, (16), 6 states have call successors, (16) Word has length 56 [2023-02-18 18:36:13,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 18:36:13,191 INFO L225 Difference]: With dead ends: 162 [2023-02-18 18:36:13,191 INFO L226 Difference]: Without dead ends: 150 [2023-02-18 18:36:13,192 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 86 SyntacticMatches, 9 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 37.7s TimeCoverageRelationStatistics Valid=288, Invalid=895, Unknown=7, NotChecked=0, Total=1190 [2023-02-18 18:36:13,192 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 136 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 234 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 49.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 777 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 234 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 52.0s IncrementalHoareTripleChecker+Time [2023-02-18 18:36:13,192 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 198 Invalid, 777 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [234 Valid, 535 Invalid, 8 Unknown, 0 Unchecked, 52.0s Time] [2023-02-18 18:36:13,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2023-02-18 18:36:13,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 123. [2023-02-18 18:36:13,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 73 states have (on average 1.2054794520547945) internal successors, (88), 78 states have internal predecessors, (88), 37 states have call successors, (37), 12 states have call predecessors, (37), 12 states have return successors, (36), 32 states have call predecessors, (36), 36 states have call successors, (36) [2023-02-18 18:36:13,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 161 transitions. [2023-02-18 18:36:13,217 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 161 transitions. Word has length 56 [2023-02-18 18:36:13,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 18:36:13,217 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 161 transitions. [2023-02-18 18:36:13,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 16 states have internal predecessors, (31), 8 states have call successors, (18), 3 states have call predecessors, (18), 1 states have return successors, (16), 6 states have call predecessors, (16), 6 states have call successors, (16) [2023-02-18 18:36:13,217 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 161 transitions. [2023-02-18 18:36:13,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-02-18 18:36:13,218 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 18:36:13,218 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 18:36:13,227 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-18 18:36:13,421 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-18 18:36:13,421 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 18:36:13,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 18:36:13,422 INFO L85 PathProgramCache]: Analyzing trace with hash -1199454569, now seen corresponding path program 1 times [2023-02-18 18:36:13,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 18:36:13,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [18291010] [2023-02-18 18:36:13,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 18:36:13,422 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-18 18:36:13,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 18:36:13,423 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-18 18:36:13,424 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-18 18:36:13,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 18:36:13,511 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 19 conjunts are in the unsatisfiable core [2023-02-18 18:36:13,513 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 18:36:13,707 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 20 proven. 9 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2023-02-18 18:36:13,708 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 18:36:19,093 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 20 proven. 9 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2023-02-18 18:36:19,093 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 18:36:19,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [18291010] [2023-02-18 18:36:19,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [18291010] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 18:36:19,094 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 18:36:19,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 18 [2023-02-18 18:36:19,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654146920] [2023-02-18 18:36:19,094 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 18:36:19,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-02-18 18:36:19,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 18:36:19,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-02-18 18:36:19,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2023-02-18 18:36:19,095 INFO L87 Difference]: Start difference. First operand 123 states and 161 transitions. Second operand has 18 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 16 states have internal predecessors, (33), 8 states have call successors, (22), 3 states have call predecessors, (22), 1 states have return successors, (20), 8 states have call predecessors, (20), 8 states have call successors, (20) [2023-02-18 18:36:36,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 18:36:36,529 INFO L93 Difference]: Finished difference Result 172 states and 229 transitions. [2023-02-18 18:36:36,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-02-18 18:36:36,551 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 16 states have internal predecessors, (33), 8 states have call successors, (22), 3 states have call predecessors, (22), 1 states have return successors, (20), 8 states have call predecessors, (20), 8 states have call successors, (20) Word has length 67 [2023-02-18 18:36:36,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 18:36:36,552 INFO L225 Difference]: With dead ends: 172 [2023-02-18 18:36:36,552 INFO L226 Difference]: Without dead ends: 142 [2023-02-18 18:36:36,553 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 108 SyntacticMatches, 9 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=174, Invalid=638, Unknown=0, NotChecked=0, Total=812 [2023-02-18 18:36:36,553 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 63 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.1s IncrementalHoareTripleChecker+Time [2023-02-18 18:36:36,553 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 150 Invalid, 482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 11.1s Time] [2023-02-18 18:36:36,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2023-02-18 18:36:36,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 129. [2023-02-18 18:36:36,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 78 states have (on average 1.1794871794871795) internal successors, (92), 82 states have internal predecessors, (92), 36 states have call successors, (36), 14 states have call predecessors, (36), 14 states have return successors, (35), 32 states have call predecessors, (35), 35 states have call successors, (35) [2023-02-18 18:36:36,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 163 transitions. [2023-02-18 18:36:36,580 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 163 transitions. Word has length 67 [2023-02-18 18:36:36,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 18:36:36,580 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 163 transitions. [2023-02-18 18:36:36,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 16 states have internal predecessors, (33), 8 states have call successors, (22), 3 states have call predecessors, (22), 1 states have return successors, (20), 8 states have call predecessors, (20), 8 states have call successors, (20) [2023-02-18 18:36:36,581 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 163 transitions. [2023-02-18 18:36:36,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-02-18 18:36:36,582 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 18:36:36,582 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 18:36:36,592 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-18 18:36:36,790 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-18 18:36:36,790 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 18:36:36,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 18:36:36,791 INFO L85 PathProgramCache]: Analyzing trace with hash 1728532070, now seen corresponding path program 1 times [2023-02-18 18:36:36,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 18:36:36,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [244331611] [2023-02-18 18:36:36,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 18:36:36,791 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-18 18:36:36,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 18:36:36,792 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-18 18:36:36,793 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-18 18:36:36,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 18:36:36,871 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-18 18:36:36,873 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 18:36:36,937 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-02-18 18:36:36,937 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 18:36:37,503 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-02-18 18:36:37,503 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 18:36:37,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [244331611] [2023-02-18 18:36:37,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [244331611] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 18:36:37,503 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 18:36:37,503 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 11 [2023-02-18 18:36:37,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019067166] [2023-02-18 18:36:37,503 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 18:36:37,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-18 18:36:37,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 18:36:37,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-18 18:36:37,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2023-02-18 18:36:37,504 INFO L87 Difference]: Start difference. First operand 129 states and 163 transitions. Second operand has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 9 states have internal predecessors, (31), 5 states have call successors, (24), 3 states have call predecessors, (24), 1 states have return successors, (22), 5 states have call predecessors, (22), 5 states have call successors, (22) [2023-02-18 18:36:38,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 18:36:38,717 INFO L93 Difference]: Finished difference Result 137 states and 171 transitions. [2023-02-18 18:36:38,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-18 18:36:38,723 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 9 states have internal predecessors, (31), 5 states have call successors, (24), 3 states have call predecessors, (24), 1 states have return successors, (22), 5 states have call predecessors, (22), 5 states have call successors, (22) Word has length 72 [2023-02-18 18:36:38,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 18:36:38,724 INFO L225 Difference]: With dead ends: 137 [2023-02-18 18:36:38,724 INFO L226 Difference]: Without dead ends: 116 [2023-02-18 18:36:38,724 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 131 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2023-02-18 18:36:38,725 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 6 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-02-18 18:36:38,725 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 234 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-02-18 18:36:38,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2023-02-18 18:36:38,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2023-02-18 18:36:38,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 70 states have (on average 1.1857142857142857) internal successors, (83), 74 states have internal predecessors, (83), 32 states have call successors, (32), 13 states have call predecessors, (32), 13 states have return successors, (31), 28 states have call predecessors, (31), 31 states have call successors, (31) [2023-02-18 18:36:38,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 146 transitions. [2023-02-18 18:36:38,741 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 146 transitions. Word has length 72 [2023-02-18 18:36:38,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 18:36:38,742 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 146 transitions. [2023-02-18 18:36:38,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 9 states have internal predecessors, (31), 5 states have call successors, (24), 3 states have call predecessors, (24), 1 states have return successors, (22), 5 states have call predecessors, (22), 5 states have call successors, (22) [2023-02-18 18:36:38,742 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 146 transitions. [2023-02-18 18:36:38,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2023-02-18 18:36:38,743 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 18:36:38,743 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 18:36:38,751 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 (11)] Ended with exit code 0 [2023-02-18 18:36:38,945 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-18 18:36:38,946 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 18:36:38,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 18:36:38,946 INFO L85 PathProgramCache]: Analyzing trace with hash 1842513023, now seen corresponding path program 1 times [2023-02-18 18:36:38,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 18:36:38,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1027202360] [2023-02-18 18:36:38,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 18:36:38,947 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-18 18:36:38,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 18:36:38,948 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-18 18:36:38,948 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-18 18:36:39,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 18:36:39,013 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-18 18:36:39,015 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 18:36:39,055 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 227 trivial. 0 not checked. [2023-02-18 18:36:39,056 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 18:36:39,056 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 18:36:39,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1027202360] [2023-02-18 18:36:39,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1027202360] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 18:36:39,056 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 18:36:39,056 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-18 18:36:39,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013868566] [2023-02-18 18:36:39,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 18:36:39,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-18 18:36:39,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 18:36:39,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-18 18:36:39,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-18 18:36:39,058 INFO L87 Difference]: Start difference. First operand 116 states and 146 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2023-02-18 18:36:40,218 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-02-18 18:36:40,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 18:36:40,426 INFO L93 Difference]: Finished difference Result 125 states and 156 transitions. [2023-02-18 18:36:40,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-18 18:36:40,426 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 76 [2023-02-18 18:36:40,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 18:36:40,427 INFO L225 Difference]: With dead ends: 125 [2023-02-18 18:36:40,427 INFO L226 Difference]: Without dead ends: 112 [2023-02-18 18:36:40,427 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 74 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-18 18:36:40,428 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 0 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-02-18 18:36:40,428 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 61 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-02-18 18:36:40,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2023-02-18 18:36:40,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2023-02-18 18:36:40,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 67 states have (on average 1.164179104477612) internal successors, (78), 70 states have internal predecessors, (78), 31 states have call successors, (31), 12 states have call predecessors, (31), 12 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2023-02-18 18:36:40,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 139 transitions. [2023-02-18 18:36:40,442 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 139 transitions. Word has length 76 [2023-02-18 18:36:40,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 18:36:40,443 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 139 transitions. [2023-02-18 18:36:40,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2023-02-18 18:36:40,443 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 139 transitions. [2023-02-18 18:36:40,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2023-02-18 18:36:40,444 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 18:36:40,444 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 18:36:40,455 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 (12)] Ended with exit code 0 [2023-02-18 18:36:40,651 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-18 18:36:40,651 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 18:36:40,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 18:36:40,652 INFO L85 PathProgramCache]: Analyzing trace with hash -947351837, now seen corresponding path program 2 times [2023-02-18 18:36:40,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 18:36:40,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1364176814] [2023-02-18 18:36:40,652 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-18 18:36:40,652 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-18 18:36:40,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 18:36:40,653 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-18 18:36:40,655 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-18 18:36:40,726 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-18 18:36:40,727 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 18:36:40,733 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-18 18:36:40,735 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 18:36:40,820 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 24 proven. 18 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-02-18 18:36:40,821 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 18:36:44,038 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 24 proven. 18 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-02-18 18:36:44,038 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 18:36:44,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1364176814] [2023-02-18 18:36:44,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1364176814] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 18:36:44,039 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 18:36:44,039 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2023-02-18 18:36:44,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369503218] [2023-02-18 18:36:44,039 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 18:36:44,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-18 18:36:44,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 18:36:44,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-18 18:36:44,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2023-02-18 18:36:44,040 INFO L87 Difference]: Start difference. First operand 111 states and 139 transitions. Second operand has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 11 states have internal predecessors, (33), 7 states have call successors, (26), 3 states have call predecessors, (26), 1 states have return successors, (24), 7 states have call predecessors, (24), 7 states have call successors, (24) [2023-02-18 18:36:51,913 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 18:36:53,929 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 18:36:59,561 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 18:37:03,345 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 18:37:06,182 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 18:37:08,195 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 18:37:11,198 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 18:37:13,288 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 18:37:15,291 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 18:37:18,080 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 18:37:20,710 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 18:37:23,096 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 18:37:25,182 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 18:37:27,683 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 18:37:29,761 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 18:37:31,765 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 18:37:34,574 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 18:37:36,647 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 18:37:38,662 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 18:37:42,512 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 18:37:42,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 18:37:42,656 INFO L93 Difference]: Finished difference Result 213 states and 291 transitions. [2023-02-18 18:37:42,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-18 18:37:42,667 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 11 states have internal predecessors, (33), 7 states have call successors, (26), 3 states have call predecessors, (26), 1 states have return successors, (24), 7 states have call predecessors, (24), 7 states have call successors, (24) Word has length 78 [2023-02-18 18:37:42,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 18:37:42,668 INFO L225 Difference]: With dead ends: 213 [2023-02-18 18:37:42,668 INFO L226 Difference]: Without dead ends: 181 [2023-02-18 18:37:42,669 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 142 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=60, Invalid=179, Unknown=1, NotChecked=0, Total=240 [2023-02-18 18:37:42,669 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 32 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 37 mSolverCounterUnsat, 19 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 50.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 19 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 52.9s IncrementalHoareTripleChecker+Time [2023-02-18 18:37:42,670 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 261 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 284 Invalid, 19 Unknown, 0 Unchecked, 52.9s Time] [2023-02-18 18:37:42,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2023-02-18 18:37:42,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 168. [2023-02-18 18:37:42,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 98 states have (on average 1.1734693877551021) internal successors, (115), 106 states have internal predecessors, (115), 54 states have call successors, (54), 15 states have call predecessors, (54), 15 states have return successors, (52), 46 states have call predecessors, (52), 52 states have call successors, (52) [2023-02-18 18:37:42,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 221 transitions. [2023-02-18 18:37:42,705 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 221 transitions. Word has length 78 [2023-02-18 18:37:42,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 18:37:42,705 INFO L495 AbstractCegarLoop]: Abstraction has 168 states and 221 transitions. [2023-02-18 18:37:42,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 11 states have internal predecessors, (33), 7 states have call successors, (26), 3 states have call predecessors, (26), 1 states have return successors, (24), 7 states have call predecessors, (24), 7 states have call successors, (24) [2023-02-18 18:37:42,705 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 221 transitions. [2023-02-18 18:37:42,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-02-18 18:37:42,706 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 18:37:42,706 INFO L195 NwaCegarLoop]: trace histogram [14, 13, 13, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 18:37:42,714 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 (13)] Ended with exit code 0 [2023-02-18 18:37:42,910 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-18 18:37:42,911 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 18:37:42,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 18:37:42,911 INFO L85 PathProgramCache]: Analyzing trace with hash 1412721000, now seen corresponding path program 1 times [2023-02-18 18:37:42,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 18:37:42,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1798720511] [2023-02-18 18:37:42,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 18:37:42,912 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-18 18:37:42,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 18:37:42,913 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-18 18:37:42,914 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-18 18:37:43,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 18:37:43,020 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-18 18:37:43,021 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 18:37:43,151 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 117 proven. 15 refuted. 0 times theorem prover too weak. 230 trivial. 0 not checked. [2023-02-18 18:37:43,152 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 18:37:44,533 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 33 proven. 15 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2023-02-18 18:37:44,533 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 18:37:44,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1798720511] [2023-02-18 18:37:44,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1798720511] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 18:37:44,533 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 18:37:44,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 14 [2023-02-18 18:37:44,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097481271] [2023-02-18 18:37:44,533 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 18:37:44,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-18 18:37:44,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 18:37:44,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-18 18:37:44,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2023-02-18 18:37:44,534 INFO L87 Difference]: Start difference. First operand 168 states and 221 transitions. Second operand has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 states have internal predecessors, (36), 9 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 9 states have call predecessors, (26), 9 states have call successors, (26) [2023-02-18 18:37:51,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 18:37:51,965 INFO L93 Difference]: Finished difference Result 206 states and 272 transitions. [2023-02-18 18:37:51,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-18 18:37:51,965 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 states have internal predecessors, (36), 9 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 9 states have call predecessors, (26), 9 states have call successors, (26) Word has length 86 [2023-02-18 18:37:51,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 18:37:51,968 INFO L225 Difference]: With dead ends: 206 [2023-02-18 18:37:51,968 INFO L226 Difference]: Without dead ends: 158 [2023-02-18 18:37:51,968 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 146 SyntacticMatches, 13 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=183, Invalid=467, Unknown=0, NotChecked=0, Total=650 [2023-02-18 18:37:51,969 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 100 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2023-02-18 18:37:51,969 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 171 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2023-02-18 18:37:51,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2023-02-18 18:37:51,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 151. [2023-02-18 18:37:51,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 89 states have (on average 1.146067415730337) internal successors, (102), 94 states have internal predecessors, (102), 47 states have call successors, (47), 14 states have call predecessors, (47), 14 states have return successors, (45), 42 states have call predecessors, (45), 45 states have call successors, (45) [2023-02-18 18:37:51,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 194 transitions. [2023-02-18 18:37:51,989 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 194 transitions. Word has length 86 [2023-02-18 18:37:51,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 18:37:51,990 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 194 transitions. [2023-02-18 18:37:51,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 states have internal predecessors, (36), 9 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 9 states have call predecessors, (26), 9 states have call successors, (26) [2023-02-18 18:37:51,990 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 194 transitions. [2023-02-18 18:37:51,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-02-18 18:37:51,991 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 18:37:51,991 INFO L195 NwaCegarLoop]: trace histogram [14, 13, 13, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 18:37:52,000 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-18 18:37:52,197 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-18 18:37:52,197 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 18:37:52,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 18:37:52,197 INFO L85 PathProgramCache]: Analyzing trace with hash -1193302554, now seen corresponding path program 3 times [2023-02-18 18:37:52,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 18:37:52,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [652295818] [2023-02-18 18:37:52,198 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-18 18:37:52,198 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-18 18:37:52,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 18:37:52,199 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-18 18:37:52,200 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-18 18:37:52,290 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-02-18 18:37:52,290 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 18:37:52,296 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 29 conjunts are in the unsatisfiable core [2023-02-18 18:37:52,298 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 18:37:55,071 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 98 proven. 42 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2023-02-18 18:37:55,072 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 18:38:17,321 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 18:38:17,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [652295818] [2023-02-18 18:38:17,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [652295818] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 18:38:17,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [218894020] [2023-02-18 18:38:17,321 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-18 18:38:17,321 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-18 18:38:17,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-18 18:38:17,322 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-18 18:38:17,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (16)] Waiting until timeout for monitored process [2023-02-18 18:38:17,448 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-02-18 18:38:17,449 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 18:38:17,451 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 26 conjunts are in the unsatisfiable core [2023-02-18 18:38:17,453 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 18:38:20,607 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 26 proven. 24 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2023-02-18 18:38:20,607 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 18:38:47,969 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 26 proven. 24 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2023-02-18 18:38:47,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [218894020] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 18:38:47,969 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 18:38:47,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 11] total 31 [2023-02-18 18:38:47,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303717173] [2023-02-18 18:38:47,970 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 18:38:47,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-02-18 18:38:47,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 18:38:47,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-02-18 18:38:47,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=261, Invalid=1145, Unknown=0, NotChecked=0, Total=1406 [2023-02-18 18:38:47,973 INFO L87 Difference]: Start difference. First operand 151 states and 194 transitions. Second operand has 31 states, 31 states have (on average 1.8709677419354838) internal successors, (58), 29 states have internal predecessors, (58), 16 states have call successors, (42), 3 states have call predecessors, (42), 2 states have return successors, (39), 13 states have call predecessors, (39), 13 states have call successors, (39) [2023-02-18 18:39:26,557 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 18:39:32,084 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.22s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 18:39:34,090 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 18:39:36,084 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.99s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []