./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/prod4br-ll_unwindbound20.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b5317dae 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/prod4br-ll_unwindbound20.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 97fbca6e87e25b4f87eb503f3dd8cdf02cc5219f6d8160a4d7fb4354cdd218ca --- Real Ultimate output --- This is Ultimate 0.2.2-?-b5317da-m [2023-02-16 02:43:15,381 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-16 02:43:15,383 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-16 02:43:15,413 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-16 02:43:15,414 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-16 02:43:15,416 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-16 02:43:15,419 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-16 02:43:15,421 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-16 02:43:15,422 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-16 02:43:15,426 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-16 02:43:15,426 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-16 02:43:15,428 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-16 02:43:15,428 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-16 02:43:15,430 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-16 02:43:15,430 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-16 02:43:15,431 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-16 02:43:15,432 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-16 02:43:15,433 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-16 02:43:15,434 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-16 02:43:15,438 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-16 02:43:15,439 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-16 02:43:15,439 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-16 02:43:15,440 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-16 02:43:15,441 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-16 02:43:15,446 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-16 02:43:15,446 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-16 02:43:15,447 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-16 02:43:15,448 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-16 02:43:15,448 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-16 02:43:15,449 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-16 02:43:15,449 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-16 02:43:15,449 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-16 02:43:15,450 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-16 02:43:15,451 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-16 02:43:15,452 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-16 02:43:15,452 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-16 02:43:15,453 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-16 02:43:15,453 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-16 02:43:15,453 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-16 02:43:15,454 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-16 02:43:15,454 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-16 02:43:15,455 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-16 02:43:15,476 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-16 02:43:15,476 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-16 02:43:15,476 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-16 02:43:15,477 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-16 02:43:15,477 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-16 02:43:15,477 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-16 02:43:15,478 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-16 02:43:15,478 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-16 02:43:15,478 INFO L138 SettingsManager]: * Use SBE=true [2023-02-16 02:43:15,478 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-16 02:43:15,478 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-16 02:43:15,478 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-16 02:43:15,479 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-16 02:43:15,479 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-16 02:43:15,479 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-16 02:43:15,479 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-16 02:43:15,479 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-16 02:43:15,479 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-16 02:43:15,479 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-16 02:43:15,479 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-16 02:43:15,480 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-16 02:43:15,480 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-16 02:43:15,480 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-16 02:43:15,480 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-16 02:43:15,480 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 02:43:15,480 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-16 02:43:15,480 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-16 02:43:15,481 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-16 02:43:15,481 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-16 02:43:15,481 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-16 02:43:15,481 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-16 02:43:15,481 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-16 02:43:15,481 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-16 02:43:15,482 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-16 02:43:15,482 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-16 02:43:15,482 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 -> 97fbca6e87e25b4f87eb503f3dd8cdf02cc5219f6d8160a4d7fb4354cdd218ca [2023-02-16 02:43:15,660 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-16 02:43:15,677 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-16 02:43:15,679 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-16 02:43:15,679 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-16 02:43:15,680 INFO L275 PluginConnector]: CDTParser initialized [2023-02-16 02:43:15,681 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/prod4br-ll_unwindbound20.c [2023-02-16 02:43:16,644 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-16 02:43:16,783 INFO L351 CDTParser]: Found 1 translation units. [2023-02-16 02:43:16,783 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/prod4br-ll_unwindbound20.c [2023-02-16 02:43:16,788 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8943ad50e/b439bd5ff8774c7f945d55e07afeb13a/FLAG91696f2cc [2023-02-16 02:43:16,799 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8943ad50e/b439bd5ff8774c7f945d55e07afeb13a [2023-02-16 02:43:16,801 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-16 02:43:16,802 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-16 02:43:16,804 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-16 02:43:16,804 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-16 02:43:16,807 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-16 02:43:16,807 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 02:43:16" (1/1) ... [2023-02-16 02:43:16,808 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7212b196 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 02:43:16, skipping insertion in model container [2023-02-16 02:43:16,808 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 02:43:16" (1/1) ... [2023-02-16 02:43:16,813 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-16 02:43:16,828 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-16 02:43:16,920 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/prod4br-ll_unwindbound20.c[524,537] [2023-02-16 02:43:16,934 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 02:43:16,939 INFO L203 MainTranslator]: Completed pre-run [2023-02-16 02:43:16,948 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/prod4br-ll_unwindbound20.c[524,537] [2023-02-16 02:43:16,956 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 02:43:16,964 INFO L208 MainTranslator]: Completed translation [2023-02-16 02:43:16,964 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 02:43:16 WrapperNode [2023-02-16 02:43:16,964 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-16 02:43:16,965 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-16 02:43:16,965 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-16 02:43:16,965 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-16 02:43:16,969 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 02:43:16" (1/1) ... [2023-02-16 02:43:16,974 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 02:43:16" (1/1) ... [2023-02-16 02:43:16,984 INFO L138 Inliner]: procedures = 14, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 59 [2023-02-16 02:43:16,985 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-16 02:43:16,985 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-16 02:43:16,985 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-16 02:43:16,986 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-16 02:43:16,991 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 02:43:16" (1/1) ... [2023-02-16 02:43:16,992 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 02:43:16" (1/1) ... [2023-02-16 02:43:16,997 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 02:43:16" (1/1) ... [2023-02-16 02:43:16,997 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 02:43:16" (1/1) ... [2023-02-16 02:43:16,999 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 02:43:16" (1/1) ... [2023-02-16 02:43:17,001 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 02:43:16" (1/1) ... [2023-02-16 02:43:17,002 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 02:43:16" (1/1) ... [2023-02-16 02:43:17,005 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 02:43:16" (1/1) ... [2023-02-16 02:43:17,007 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-16 02:43:17,007 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-16 02:43:17,007 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-16 02:43:17,008 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-16 02:43:17,008 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 02:43:16" (1/1) ... [2023-02-16 02:43:17,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 02:43:17,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 02:43:17,030 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-16 02:43:17,032 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-16 02:43:17,053 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-16 02:43:17,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-16 02:43:17,053 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-16 02:43:17,053 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-16 02:43:17,053 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-02-16 02:43:17,053 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-02-16 02:43:17,092 INFO L235 CfgBuilder]: Building ICFG [2023-02-16 02:43:17,094 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-16 02:43:17,302 INFO L276 CfgBuilder]: Performing block encoding [2023-02-16 02:43:17,309 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-16 02:43:17,309 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2023-02-16 02:43:17,311 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 02:43:17 BoogieIcfgContainer [2023-02-16 02:43:17,311 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-16 02:43:17,313 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-16 02:43:17,328 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-16 02:43:17,331 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-16 02:43:17,331 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.02 02:43:16" (1/3) ... [2023-02-16 02:43:17,332 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@443f4995 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 02:43:17, skipping insertion in model container [2023-02-16 02:43:17,332 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 02:43:16" (2/3) ... [2023-02-16 02:43:17,332 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@443f4995 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 02:43:17, skipping insertion in model container [2023-02-16 02:43:17,332 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 02:43:17" (3/3) ... [2023-02-16 02:43:17,333 INFO L112 eAbstractionObserver]: Analyzing ICFG prod4br-ll_unwindbound20.c [2023-02-16 02:43:17,345 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-16 02:43:17,355 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-16 02:43:17,396 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-16 02:43:17,404 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;@159edbe6, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-16 02:43:17,405 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-16 02:43:17,407 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-16 02:43:17,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-16 02:43:17,412 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 02:43:17,413 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 02:43:17,413 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 02:43:17,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 02:43:17,418 INFO L85 PathProgramCache]: Analyzing trace with hash -563977895, now seen corresponding path program 1 times [2023-02-16 02:43:17,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 02:43:17,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815641282] [2023-02-16 02:43:17,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 02:43:17,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 02:43:17,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:43:17,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 02:43:17,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815641282] [2023-02-16 02:43:17,524 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2023-02-16 02:43:17,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1710278675] [2023-02-16 02:43:17,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 02:43:17,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 02:43:17,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 02:43:17,527 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-16 02:43:17,528 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-16 02:43:17,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:43:17,594 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 1 conjunts are in the unsatisfiable core [2023-02-16 02:43:17,597 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 02:43:17,614 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-16 02:43:17,615 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 02:43:17,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1710278675] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 02:43:17,616 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 02:43:17,616 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-16 02:43:17,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606823596] [2023-02-16 02:43:17,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 02:43:17,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-16 02:43:17,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 02:43:17,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-16 02:43:17,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-16 02:43:17,650 INFO L87 Difference]: Start difference. First operand has 23 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) 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-16 02:43:17,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 02:43:17,667 INFO L93 Difference]: Finished difference Result 43 states and 63 transitions. [2023-02-16 02:43:17,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-16 02:43:17,668 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-16 02:43:17,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 02:43:17,676 INFO L225 Difference]: With dead ends: 43 [2023-02-16 02:43:17,676 INFO L226 Difference]: Without dead ends: 19 [2023-02-16 02:43:17,679 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-16 02:43:17,682 INFO L413 NwaCegarLoop]: 29 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, 29 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-16 02:43:17,683 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 02:43:17,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2023-02-16 02:43:17,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2023-02-16 02:43:17,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-16 02:43:17,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2023-02-16 02:43:17,707 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 25 transitions. Word has length 9 [2023-02-16 02:43:17,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 02:43:17,707 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 25 transitions. [2023-02-16 02:43:17,708 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-16 02:43:17,708 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 25 transitions. [2023-02-16 02:43:17,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-02-16 02:43:17,709 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 02:43:17,709 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 02:43:17,716 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-16 02:43:17,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2023-02-16 02:43:17,913 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 02:43:17,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 02:43:17,914 INFO L85 PathProgramCache]: Analyzing trace with hash -1986058659, now seen corresponding path program 1 times [2023-02-16 02:43:17,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 02:43:17,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102584510] [2023-02-16 02:43:17,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 02:43:17,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 02:43:17,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:43:17,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 02:43:17,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102584510] [2023-02-16 02:43:17,942 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2023-02-16 02:43:17,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [768312456] [2023-02-16 02:43:17,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 02:43:17,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 02:43:17,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 02:43:17,944 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-16 02:43:17,946 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-16 02:43:17,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:43:17,989 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-16 02:43:17,990 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 02:43:18,024 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-16 02:43:18,024 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 02:43:18,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [768312456] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 02:43:18,025 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 02:43:18,025 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 02:43:18,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975410375] [2023-02-16 02:43:18,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 02:43:18,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-16 02:43:18,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 02:43:18,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-16 02:43:18,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-16 02:43:18,032 INFO L87 Difference]: Start difference. First operand 19 states and 25 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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-16 02:43:18,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 02:43:18,052 INFO L93 Difference]: Finished difference Result 29 states and 36 transitions. [2023-02-16 02:43:18,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-16 02:43:18,053 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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 10 [2023-02-16 02:43:18,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 02:43:18,058 INFO L225 Difference]: With dead ends: 29 [2023-02-16 02:43:18,058 INFO L226 Difference]: Without dead ends: 21 [2023-02-16 02:43:18,058 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-16 02:43:18,059 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 0 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 02:43:18,059 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 63 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 02:43:18,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2023-02-16 02:43:18,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2023-02-16 02:43:18,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-16 02:43:18,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2023-02-16 02:43:18,063 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 27 transitions. Word has length 10 [2023-02-16 02:43:18,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 02:43:18,063 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 27 transitions. [2023-02-16 02:43:18,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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-16 02:43:18,063 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 27 transitions. [2023-02-16 02:43:18,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-02-16 02:43:18,064 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 02:43:18,064 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 02:43:18,075 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-16 02:43:18,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2023-02-16 02:43:18,276 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 02:43:18,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 02:43:18,276 INFO L85 PathProgramCache]: Analyzing trace with hash -1984271199, now seen corresponding path program 1 times [2023-02-16 02:43:18,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 02:43:18,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435347195] [2023-02-16 02:43:18,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 02:43:18,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 02:43:18,285 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-16 02:43:18,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [282658729] [2023-02-16 02:43:18,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 02:43:18,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 02:43:18,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 02:43:18,287 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-16 02:43:18,288 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-16 02:43:18,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:43:18,332 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 19 conjunts are in the unsatisfiable core [2023-02-16 02:43:18,334 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 02:43:18,419 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-16 02:43:18,420 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 02:43:18,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 02:43:18,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435347195] [2023-02-16 02:43:18,420 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-16 02:43:18,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [282658729] [2023-02-16 02:43:18,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [282658729] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 02:43:18,421 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 02:43:18,421 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-16 02:43:18,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037890520] [2023-02-16 02:43:18,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 02:43:18,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-16 02:43:18,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 02:43:18,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-16 02:43:18,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-02-16 02:43:18,423 INFO L87 Difference]: Start difference. First operand 21 states and 27 transitions. Second operand has 7 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 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-16 02:43:18,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 02:43:18,513 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions. [2023-02-16 02:43:18,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-16 02:43:18,514 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 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 10 [2023-02-16 02:43:18,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 02:43:18,515 INFO L225 Difference]: With dead ends: 34 [2023-02-16 02:43:18,515 INFO L226 Difference]: Without dead ends: 32 [2023-02-16 02:43:18,515 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2023-02-16 02:43:18,516 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 47 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 02:43:18,516 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 51 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 02:43:18,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-02-16 02:43:18,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 26. [2023-02-16 02:43:18,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 21 states have internal predecessors, (25), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-16 02:43:18,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2023-02-16 02:43:18,521 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 10 [2023-02-16 02:43:18,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 02:43:18,522 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2023-02-16 02:43:18,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 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-16 02:43:18,522 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2023-02-16 02:43:18,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-16 02:43:18,522 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 02:43:18,523 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 02:43:18,529 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-02-16 02:43:18,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 02:43:18,727 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 02:43:18,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 02:43:18,728 INFO L85 PathProgramCache]: Analyzing trace with hash -1194524114, now seen corresponding path program 1 times [2023-02-16 02:43:18,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 02:43:18,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904518370] [2023-02-16 02:43:18,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 02:43:18,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 02:43:18,740 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-16 02:43:18,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1994222008] [2023-02-16 02:43:18,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 02:43:18,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 02:43:18,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 02:43:18,744 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-16 02:43:18,746 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-16 02:43:18,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:43:18,775 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 18 conjunts are in the unsatisfiable core [2023-02-16 02:43:18,777 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 02:43:18,961 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 02:43:18,961 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 02:43:19,115 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 02:43:19,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 02:43:19,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904518370] [2023-02-16 02:43:19,115 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-16 02:43:19,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1994222008] [2023-02-16 02:43:19,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1994222008] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 02:43:19,115 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 02:43:19,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7] total 15 [2023-02-16 02:43:19,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130207051] [2023-02-16 02:43:19,116 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 02:43:19,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-02-16 02:43:19,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 02:43:19,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-02-16 02:43:19,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2023-02-16 02:43:19,117 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand has 15 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 states have internal predecessors, (23), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-16 02:43:19,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 02:43:19,401 INFO L93 Difference]: Finished difference Result 47 states and 64 transitions. [2023-02-16 02:43:19,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-16 02:43:19,401 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 states have internal predecessors, (23), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 16 [2023-02-16 02:43:19,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 02:43:19,403 INFO L225 Difference]: With dead ends: 47 [2023-02-16 02:43:19,403 INFO L226 Difference]: Without dead ends: 45 [2023-02-16 02:43:19,403 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=104, Invalid=402, Unknown=0, NotChecked=0, Total=506 [2023-02-16 02:43:19,404 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 81 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 02:43:19,404 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 71 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 02:43:19,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2023-02-16 02:43:19,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 31. [2023-02-16 02:43:19,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 25 states have internal predecessors, (28), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-16 02:43:19,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2023-02-16 02:43:19,410 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 16 [2023-02-16 02:43:19,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 02:43:19,411 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2023-02-16 02:43:19,411 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 states have internal predecessors, (23), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-16 02:43:19,411 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2023-02-16 02:43:19,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-16 02:43:19,411 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 02:43:19,411 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 02:43:19,422 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-16 02:43:19,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 02:43:19,616 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 02:43:19,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 02:43:19,617 INFO L85 PathProgramCache]: Analyzing trace with hash -1756733383, now seen corresponding path program 1 times [2023-02-16 02:43:19,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 02:43:19,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410332540] [2023-02-16 02:43:19,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 02:43:19,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 02:43:19,624 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-16 02:43:19,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1764742333] [2023-02-16 02:43:19,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 02:43:19,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 02:43:19,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 02:43:19,626 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-16 02:43:19,628 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-16 02:43:19,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:43:19,659 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-16 02:43:19,659 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 02:43:19,681 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 02:43:19,681 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 02:43:19,713 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 02:43:19,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 02:43:19,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410332540] [2023-02-16 02:43:19,714 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-16 02:43:19,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1764742333] [2023-02-16 02:43:19,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1764742333] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 02:43:19,714 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 02:43:19,715 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2023-02-16 02:43:19,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100472738] [2023-02-16 02:43:19,715 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 02:43:19,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-16 02:43:19,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 02:43:19,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-16 02:43:19,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-02-16 02:43:19,716 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-16 02:43:19,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 02:43:19,782 INFO L93 Difference]: Finished difference Result 95 states and 115 transitions. [2023-02-16 02:43:19,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-16 02:43:19,783 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2023-02-16 02:43:19,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 02:43:19,784 INFO L225 Difference]: With dead ends: 95 [2023-02-16 02:43:19,784 INFO L226 Difference]: Without dead ends: 85 [2023-02-16 02:43:19,784 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2023-02-16 02:43:19,790 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 68 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 02:43:19,791 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 120 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 02:43:19,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-02-16 02:43:19,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 79. [2023-02-16 02:43:19,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 57 states have (on average 1.3508771929824561) internal successors, (77), 61 states have internal predecessors, (77), 13 states have call successors, (13), 9 states have call predecessors, (13), 8 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2023-02-16 02:43:19,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 99 transitions. [2023-02-16 02:43:19,804 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 99 transitions. Word has length 19 [2023-02-16 02:43:19,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 02:43:19,804 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 99 transitions. [2023-02-16 02:43:19,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-16 02:43:19,804 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 99 transitions. [2023-02-16 02:43:19,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-16 02:43:19,805 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 02:43:19,805 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 02:43:19,810 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-02-16 02:43:20,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 02:43:20,010 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 02:43:20,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 02:43:20,011 INFO L85 PathProgramCache]: Analyzing trace with hash -1754945923, now seen corresponding path program 1 times [2023-02-16 02:43:20,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 02:43:20,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818645207] [2023-02-16 02:43:20,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 02:43:20,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 02:43:20,018 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-16 02:43:20,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1819038809] [2023-02-16 02:43:20,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 02:43:20,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 02:43:20,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 02:43:20,021 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-16 02:43:20,026 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-16 02:43:20,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:43:20,059 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 34 conjunts are in the unsatisfiable core [2023-02-16 02:43:20,062 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 02:43:20,232 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 02:43:20,232 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 02:43:20,501 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 02:43:20,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 02:43:20,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818645207] [2023-02-16 02:43:20,501 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-16 02:43:20,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1819038809] [2023-02-16 02:43:20,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1819038809] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 02:43:20,502 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 02:43:20,502 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 14 [2023-02-16 02:43:20,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703820718] [2023-02-16 02:43:20,502 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 02:43:20,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-16 02:43:20,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 02:43:20,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-16 02:43:20,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2023-02-16 02:43:20,503 INFO L87 Difference]: Start difference. First operand 79 states and 99 transitions. Second operand has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 13 states have internal predecessors, (29), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-16 02:43:21,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 02:43:21,061 INFO L93 Difference]: Finished difference Result 102 states and 127 transitions. [2023-02-16 02:43:21,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-16 02:43:21,064 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 13 states have internal predecessors, (29), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2023-02-16 02:43:21,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 02:43:21,065 INFO L225 Difference]: With dead ends: 102 [2023-02-16 02:43:21,065 INFO L226 Difference]: Without dead ends: 96 [2023-02-16 02:43:21,065 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2023-02-16 02:43:21,066 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 87 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-16 02:43:21,066 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 69 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-16 02:43:21,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2023-02-16 02:43:21,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 71. [2023-02-16 02:43:21,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 54 states have (on average 1.3333333333333333) internal successors, (72), 56 states have internal predecessors, (72), 9 states have call successors, (9), 8 states have call predecessors, (9), 7 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-16 02:43:21,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 88 transitions. [2023-02-16 02:43:21,081 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 88 transitions. Word has length 19 [2023-02-16 02:43:21,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 02:43:21,081 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 88 transitions. [2023-02-16 02:43:21,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 13 states have internal predecessors, (29), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-16 02:43:21,082 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 88 transitions. [2023-02-16 02:43:21,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-16 02:43:21,084 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 02:43:21,084 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 02:43:21,095 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-16 02:43:21,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 02:43:21,289 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 02:43:21,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 02:43:21,290 INFO L85 PathProgramCache]: Analyzing trace with hash -1942139802, now seen corresponding path program 1 times [2023-02-16 02:43:21,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 02:43:21,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753401147] [2023-02-16 02:43:21,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 02:43:21,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 02:43:21,295 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-16 02:43:21,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [25077451] [2023-02-16 02:43:21,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 02:43:21,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 02:43:21,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 02:43:21,297 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-16 02:43:21,299 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-16 02:43:21,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:43:21,325 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 18 conjunts are in the unsatisfiable core [2023-02-16 02:43:21,326 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 02:43:21,407 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-16 02:43:21,408 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 02:43:21,457 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-16 02:43:21,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 02:43:21,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753401147] [2023-02-16 02:43:21,458 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-16 02:43:21,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [25077451] [2023-02-16 02:43:21,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [25077451] provided 1 perfect and 1 imperfect interpolant sequences [2023-02-16 02:43:21,458 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-16 02:43:21,458 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 13 [2023-02-16 02:43:21,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456895444] [2023-02-16 02:43:21,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 02:43:21,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-16 02:43:21,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 02:43:21,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-16 02:43:21,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2023-02-16 02:43:21,459 INFO L87 Difference]: Start difference. First operand 71 states and 88 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-16 02:43:21,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 02:43:21,587 INFO L93 Difference]: Finished difference Result 78 states and 94 transitions. [2023-02-16 02:43:21,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-16 02:43:21,588 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2023-02-16 02:43:21,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 02:43:21,588 INFO L225 Difference]: With dead ends: 78 [2023-02-16 02:43:21,589 INFO L226 Difference]: Without dead ends: 58 [2023-02-16 02:43:21,589 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2023-02-16 02:43:21,589 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 4 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 02:43:21,589 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 84 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 02:43:21,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2023-02-16 02:43:21,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2023-02-16 02:43:21,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 46 states have (on average 1.3043478260869565) internal successors, (60), 47 states have internal predecessors, (60), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-16 02:43:21,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 71 transitions. [2023-02-16 02:43:21,596 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 71 transitions. Word has length 21 [2023-02-16 02:43:21,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 02:43:21,597 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 71 transitions. [2023-02-16 02:43:21,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-16 02:43:21,597 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 71 transitions. [2023-02-16 02:43:21,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-16 02:43:21,597 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 02:43:21,597 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 02:43:21,614 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-16 02:43:21,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 02:43:21,798 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 02:43:21,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 02:43:21,799 INFO L85 PathProgramCache]: Analyzing trace with hash 136508765, now seen corresponding path program 2 times [2023-02-16 02:43:21,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 02:43:21,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602985714] [2023-02-16 02:43:21,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 02:43:21,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 02:43:21,808 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-16 02:43:21,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [890727366] [2023-02-16 02:43:21,808 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-16 02:43:21,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 02:43:21,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 02:43:21,810 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-16 02:43:21,811 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-16 02:43:21,850 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-16 02:43:21,850 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 02:43:21,851 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 11 conjunts are in the unsatisfiable core [2023-02-16 02:43:21,852 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 02:43:21,902 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 8 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 02:43:21,902 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 02:43:21,980 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 8 proven. 38 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-02-16 02:43:21,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 02:43:21,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602985714] [2023-02-16 02:43:21,980 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-16 02:43:21,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [890727366] [2023-02-16 02:43:21,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [890727366] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 02:43:21,980 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 02:43:21,981 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2023-02-16 02:43:21,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769270313] [2023-02-16 02:43:21,981 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 02:43:21,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-16 02:43:21,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 02:43:21,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-16 02:43:21,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2023-02-16 02:43:21,982 INFO L87 Difference]: Start difference. First operand 58 states and 71 transitions. Second operand has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 states have internal predecessors, (62), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-02-16 02:43:22,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 02:43:22,093 INFO L93 Difference]: Finished difference Result 132 states and 169 transitions. [2023-02-16 02:43:22,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-02-16 02:43:22,094 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 states have internal predecessors, (62), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Word has length 46 [2023-02-16 02:43:22,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 02:43:22,095 INFO L225 Difference]: With dead ends: 132 [2023-02-16 02:43:22,095 INFO L226 Difference]: Without dead ends: 124 [2023-02-16 02:43:22,096 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=184, Invalid=322, Unknown=0, NotChecked=0, Total=506 [2023-02-16 02:43:22,097 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 92 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 02:43:22,097 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 196 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 02:43:22,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2023-02-16 02:43:22,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2023-02-16 02:43:22,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 100 states have (on average 1.32) internal successors, (132), 101 states have internal predecessors, (132), 12 states have call successors, (12), 11 states have call predecessors, (12), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-02-16 02:43:22,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 155 transitions. [2023-02-16 02:43:22,112 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 155 transitions. Word has length 46 [2023-02-16 02:43:22,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 02:43:22,113 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 155 transitions. [2023-02-16 02:43:22,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 states have internal predecessors, (62), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-02-16 02:43:22,113 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 155 transitions. [2023-02-16 02:43:22,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2023-02-16 02:43:22,115 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 02:43:22,115 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 02:43:22,137 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-02-16 02:43:22,321 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,SelfDestructingSolverStorable7 [2023-02-16 02:43:22,321 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 02:43:22,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 02:43:22,322 INFO L85 PathProgramCache]: Analyzing trace with hash -1689445411, now seen corresponding path program 3 times [2023-02-16 02:43:22,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 02:43:22,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922282276] [2023-02-16 02:43:22,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 02:43:22,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 02:43:22,334 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-16 02:43:22,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [425128919] [2023-02-16 02:43:22,335 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-16 02:43:22,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 02:43:22,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 02:43:22,348 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-16 02:43:22,350 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-16 02:43:22,520 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2023-02-16 02:43:22,520 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 02:43:22,522 INFO L263 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 23 conjunts are in the unsatisfiable core [2023-02-16 02:43:22,524 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 02:43:22,662 INFO L134 CoverageAnalysis]: Checked inductivity of 445 backedges. 20 proven. 425 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 02:43:22,662 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 02:43:22,867 INFO L134 CoverageAnalysis]: Checked inductivity of 445 backedges. 20 proven. 245 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2023-02-16 02:43:22,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 02:43:22,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922282276] [2023-02-16 02:43:22,868 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-16 02:43:22,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [425128919] [2023-02-16 02:43:22,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [425128919] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 02:43:22,868 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 02:43:22,869 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 24 [2023-02-16 02:43:22,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449507815] [2023-02-16 02:43:22,870 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 02:43:22,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-02-16 02:43:22,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 02:43:22,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-02-16 02:43:22,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2023-02-16 02:43:22,873 INFO L87 Difference]: Start difference. First operand 124 states and 155 transitions. Second operand has 24 states, 24 states have (on average 5.166666666666667) internal successors, (124), 24 states have internal predecessors, (124), 20 states have call successors, (21), 12 states have call predecessors, (21), 11 states have return successors, (20), 19 states have call predecessors, (20), 19 states have call successors, (20) [2023-02-16 02:43:23,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 02:43:23,185 INFO L93 Difference]: Finished difference Result 242 states and 313 transitions. [2023-02-16 02:43:23,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2023-02-16 02:43:23,189 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 5.166666666666667) internal successors, (124), 24 states have internal predecessors, (124), 20 states have call successors, (21), 12 states have call predecessors, (21), 11 states have return successors, (20), 19 states have call predecessors, (20), 19 states have call successors, (20) Word has length 100 [2023-02-16 02:43:23,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 02:43:23,191 INFO L225 Difference]: With dead ends: 242 [2023-02-16 02:43:23,191 INFO L226 Difference]: Without dead ends: 234 [2023-02-16 02:43:23,192 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 174 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=665, Invalid=1141, Unknown=0, NotChecked=0, Total=1806 [2023-02-16 02:43:23,192 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 309 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 02:43:23,192 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 309 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 02:43:23,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2023-02-16 02:43:23,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 234. [2023-02-16 02:43:23,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 190 states have (on average 1.3263157894736841) internal successors, (252), 191 states have internal predecessors, (252), 22 states have call successors, (22), 21 states have call predecessors, (22), 21 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2023-02-16 02:43:23,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 295 transitions. [2023-02-16 02:43:23,211 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 295 transitions. Word has length 100 [2023-02-16 02:43:23,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 02:43:23,211 INFO L495 AbstractCegarLoop]: Abstraction has 234 states and 295 transitions. [2023-02-16 02:43:23,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 5.166666666666667) internal successors, (124), 24 states have internal predecessors, (124), 20 states have call successors, (21), 12 states have call predecessors, (21), 11 states have return successors, (20), 19 states have call predecessors, (20), 19 states have call successors, (20) [2023-02-16 02:43:23,212 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 295 transitions. [2023-02-16 02:43:23,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2023-02-16 02:43:23,213 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 02:43:23,214 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 02:43:23,221 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-16 02:43:23,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 02:43:23,422 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 02:43:23,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 02:43:23,422 INFO L85 PathProgramCache]: Analyzing trace with hash -1595985571, now seen corresponding path program 4 times [2023-02-16 02:43:23,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 02:43:23,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124162001] [2023-02-16 02:43:23,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 02:43:23,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 02:43:23,437 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-16 02:43:23,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [892345806] [2023-02-16 02:43:23,437 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-16 02:43:23,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 02:43:23,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 02:43:23,438 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-16 02:43:23,442 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-16 02:43:23,638 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-16 02:43:23,638 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-02-16 02:43:23,638 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-16 02:43:23,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 02:43:23,831 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-16 02:43:23,831 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-02-16 02:43:23,835 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-02-16 02:43:23,843 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-16 02:43:24,043 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,SelfDestructingSolverStorable9 [2023-02-16 02:43:24,046 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1] [2023-02-16 02:43:24,048 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-16 02:43:24,101 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.02 02:43:24 BoogieIcfgContainer [2023-02-16 02:43:24,101 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-16 02:43:24,101 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-16 02:43:24,102 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-16 02:43:24,102 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-16 02:43:24,102 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 02:43:17" (3/4) ... [2023-02-16 02:43:24,103 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-02-16 02:43:24,161 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-16 02:43:24,161 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-16 02:43:24,161 INFO L158 Benchmark]: Toolchain (without parser) took 7359.10ms. Allocated memory was 123.7MB in the beginning and 176.2MB in the end (delta: 52.4MB). Free memory was 76.5MB in the beginning and 57.8MB in the end (delta: 18.6MB). Peak memory consumption was 74.9MB. Max. memory is 16.1GB. [2023-02-16 02:43:24,161 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 94.4MB. Free memory is still 45.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-16 02:43:24,162 INFO L158 Benchmark]: CACSL2BoogieTranslator took 160.08ms. Allocated memory is still 123.7MB. Free memory was 76.5MB in the beginning and 65.7MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-16 02:43:24,162 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.02ms. Allocated memory is still 123.7MB. Free memory was 65.7MB in the beginning and 64.2MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-16 02:43:24,162 INFO L158 Benchmark]: Boogie Preprocessor took 21.38ms. Allocated memory is still 123.7MB. Free memory was 64.2MB in the beginning and 62.8MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-16 02:43:24,162 INFO L158 Benchmark]: RCFGBuilder took 303.46ms. Allocated memory was 123.7MB in the beginning and 176.2MB in the end (delta: 52.4MB). Free memory was 62.8MB in the beginning and 143.6MB in the end (delta: -80.8MB). Peak memory consumption was 14.3MB. Max. memory is 16.1GB. [2023-02-16 02:43:24,163 INFO L158 Benchmark]: TraceAbstraction took 6787.64ms. Allocated memory is still 176.2MB. Free memory was 142.6MB in the beginning and 66.2MB in the end (delta: 76.3MB). Peak memory consumption was 75.3MB. Max. memory is 16.1GB. [2023-02-16 02:43:24,163 INFO L158 Benchmark]: Witness Printer took 59.53ms. Allocated memory is still 176.2MB. Free memory was 66.2MB in the beginning and 57.8MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-02-16 02:43:24,164 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 94.4MB. Free memory is still 45.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 160.08ms. Allocated memory is still 123.7MB. Free memory was 76.5MB in the beginning and 65.7MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 20.02ms. Allocated memory is still 123.7MB. Free memory was 65.7MB in the beginning and 64.2MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 21.38ms. Allocated memory is still 123.7MB. Free memory was 64.2MB in the beginning and 62.8MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 303.46ms. Allocated memory was 123.7MB in the beginning and 176.2MB in the end (delta: 52.4MB). Free memory was 62.8MB in the beginning and 143.6MB in the end (delta: -80.8MB). Peak memory consumption was 14.3MB. Max. memory is 16.1GB. * TraceAbstraction took 6787.64ms. Allocated memory is still 176.2MB. Free memory was 142.6MB in the beginning and 66.2MB in the end (delta: 76.3MB). Peak memory consumption was 75.3MB. Max. memory is 16.1GB. * Witness Printer took 59.53ms. Allocated memory is still 176.2MB. Free memory was 66.2MB in the beginning and 57.8MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 14]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L19] int counter = 0; VAL [counter=0] [L21] int x, y; [L22] long long a, b, p, q; [L24] x = __VERIFIER_nondet_int() [L25] y = __VERIFIER_nondet_int() [L26] CALL assume_abort_if_not(y >= 1) [L9] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, counter=0] [L26] RET assume_abort_if_not(y >= 1) [L28] a = x [L29] b = y [L30] p = 1 [L31] q = 0 VAL [a=1048576, b=1048576, counter=0, p=1, q=0, x=1048576, y=1048576] [L33] EXPR counter++ VAL [a=1048576, b=1048576, counter=1, counter++=0, p=1, q=0, x=1048576, y=1048576] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [\old(cond)=1, counter=1] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=1] [L34] RET __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [a=1048576, b=1048576, counter=1, p=1, q=0, x=1048576, y=1048576] [L36] COND FALSE !(!(a != 0 && b != 0)) VAL [a=1048576, b=1048576, counter=1, p=1, q=0, x=1048576, y=1048576] [L39] COND TRUE a % 2 == 0 && b % 2 == 0 [L40] a = a / 2 [L41] b = b / 2 [L42] p = 4 * p VAL [a=524288, b=524288, counter=1, p=4, q=0, x=1048576, y=1048576] [L33] EXPR counter++ VAL [a=524288, b=524288, counter=2, counter++=1, p=4, q=0, x=1048576, y=1048576] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [\old(cond)=1, counter=2] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=2] [L34] RET __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [a=524288, b=524288, counter=2, p=4, q=0, x=1048576, y=1048576] [L36] COND FALSE !(!(a != 0 && b != 0)) VAL [a=524288, b=524288, counter=2, p=4, q=0, x=1048576, y=1048576] [L39] COND TRUE a % 2 == 0 && b % 2 == 0 [L40] a = a / 2 [L41] b = b / 2 [L42] p = 4 * p VAL [a=262144, b=262144, counter=2, p=16, q=0, x=1048576, y=1048576] [L33] EXPR counter++ VAL [a=262144, b=262144, counter=3, counter++=2, p=16, q=0, x=1048576, y=1048576] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [\old(cond)=1, counter=3] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=3] [L34] RET __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [a=262144, b=262144, counter=3, p=16, q=0, x=1048576, y=1048576] [L36] COND FALSE !(!(a != 0 && b != 0)) VAL [a=262144, b=262144, counter=3, p=16, q=0, x=1048576, y=1048576] [L39] COND TRUE a % 2 == 0 && b % 2 == 0 [L40] a = a / 2 [L41] b = b / 2 [L42] p = 4 * p VAL [a=131072, b=131072, counter=3, p=64, q=0, x=1048576, y=1048576] [L33] EXPR counter++ VAL [a=131072, b=131072, counter=4, counter++=3, p=64, q=0, x=1048576, y=1048576] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [\old(cond)=1, counter=4] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=4] [L34] RET __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [a=131072, b=131072, counter=4, p=64, q=0, x=1048576, y=1048576] [L36] COND FALSE !(!(a != 0 && b != 0)) VAL [a=131072, b=131072, counter=4, p=64, q=0, x=1048576, y=1048576] [L39] COND TRUE a % 2 == 0 && b % 2 == 0 [L40] a = a / 2 [L41] b = b / 2 [L42] p = 4 * p VAL [a=65536, b=65536, counter=4, p=256, q=0, x=1048576, y=1048576] [L33] EXPR counter++ VAL [a=65536, b=65536, counter=5, counter++=4, p=256, q=0, x=1048576, y=1048576] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [\old(cond)=1, counter=5] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=5] [L34] RET __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [a=65536, b=65536, counter=5, p=256, q=0, x=1048576, y=1048576] [L36] COND FALSE !(!(a != 0 && b != 0)) VAL [a=65536, b=65536, counter=5, p=256, q=0, x=1048576, y=1048576] [L39] COND TRUE a % 2 == 0 && b % 2 == 0 [L40] a = a / 2 [L41] b = b / 2 [L42] p = 4 * p VAL [a=32768, b=32768, counter=5, p=1024, q=0, x=1048576, y=1048576] [L33] EXPR counter++ VAL [a=32768, b=32768, counter=6, counter++=5, p=1024, q=0, x=1048576, y=1048576] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [\old(cond)=1, counter=6] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=6] [L34] RET __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [a=32768, b=32768, counter=6, p=1024, q=0, x=1048576, y=1048576] [L36] COND FALSE !(!(a != 0 && b != 0)) VAL [a=32768, b=32768, counter=6, p=1024, q=0, x=1048576, y=1048576] [L39] COND TRUE a % 2 == 0 && b % 2 == 0 [L40] a = a / 2 [L41] b = b / 2 [L42] p = 4 * p VAL [a=16384, b=16384, counter=6, p=4096, q=0, x=1048576, y=1048576] [L33] EXPR counter++ VAL [a=16384, b=16384, counter=7, counter++=6, p=4096, q=0, x=1048576, y=1048576] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [\old(cond)=1, counter=7] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=7] [L34] RET __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [a=16384, b=16384, counter=7, p=4096, q=0, x=1048576, y=1048576] [L36] COND FALSE !(!(a != 0 && b != 0)) VAL [a=16384, b=16384, counter=7, p=4096, q=0, x=1048576, y=1048576] [L39] COND TRUE a % 2 == 0 && b % 2 == 0 [L40] a = a / 2 [L41] b = b / 2 [L42] p = 4 * p VAL [a=8192, b=8192, counter=7, p=16384, q=0, x=1048576, y=1048576] [L33] EXPR counter++ VAL [a=8192, b=8192, counter=8, counter++=7, p=16384, q=0, x=1048576, y=1048576] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [\old(cond)=1, counter=8] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=8] [L34] RET __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [a=8192, b=8192, counter=8, p=16384, q=0, x=1048576, y=1048576] [L36] COND FALSE !(!(a != 0 && b != 0)) VAL [a=8192, b=8192, counter=8, p=16384, q=0, x=1048576, y=1048576] [L39] COND TRUE a % 2 == 0 && b % 2 == 0 [L40] a = a / 2 [L41] b = b / 2 [L42] p = 4 * p VAL [a=4096, b=4096, counter=8, p=65536, q=0, x=1048576, y=1048576] [L33] EXPR counter++ VAL [a=4096, b=4096, counter=9, counter++=8, p=65536, q=0, x=1048576, y=1048576] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [\old(cond)=1, counter=9] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=9] [L34] RET __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [a=4096, b=4096, counter=9, p=65536, q=0, x=1048576, y=1048576] [L36] COND FALSE !(!(a != 0 && b != 0)) VAL [a=4096, b=4096, counter=9, p=65536, q=0, x=1048576, y=1048576] [L39] COND TRUE a % 2 == 0 && b % 2 == 0 [L40] a = a / 2 [L41] b = b / 2 [L42] p = 4 * p VAL [a=2048, b=2048, counter=9, p=262144, q=0, x=1048576, y=1048576] [L33] EXPR counter++ VAL [a=2048, b=2048, counter=10, counter++=9, p=262144, q=0, x=1048576, y=1048576] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [\old(cond)=1, counter=10] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=10] [L34] RET __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [a=2048, b=2048, counter=10, p=262144, q=0, x=1048576, y=1048576] [L36] COND FALSE !(!(a != 0 && b != 0)) VAL [a=2048, b=2048, counter=10, p=262144, q=0, x=1048576, y=1048576] [L39] COND TRUE a % 2 == 0 && b % 2 == 0 [L40] a = a / 2 [L41] b = b / 2 [L42] p = 4 * p VAL [a=1024, b=1024, counter=10, p=1048576, q=0, x=1048576, y=1048576] [L33] EXPR counter++ VAL [a=1024, b=1024, counter=11, counter++=10, p=1048576, q=0, x=1048576, y=1048576] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [\old(cond)=1, counter=11] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=11] [L34] RET __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [a=1024, b=1024, counter=11, p=1048576, q=0, x=1048576, y=1048576] [L36] COND FALSE !(!(a != 0 && b != 0)) VAL [a=1024, b=1024, counter=11, p=1048576, q=0, x=1048576, y=1048576] [L39] COND TRUE a % 2 == 0 && b % 2 == 0 [L40] a = a / 2 [L41] b = b / 2 [L42] p = 4 * p VAL [a=512, b=512, counter=11, p=4194304, q=0, x=1048576, y=1048576] [L33] EXPR counter++ VAL [a=512, b=512, counter=12, counter++=11, p=4194304, q=0, x=1048576, y=1048576] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [\old(cond)=1, counter=12] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=12] [L34] RET __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [a=512, b=512, counter=12, p=4194304, q=0, x=1048576, y=1048576] [L36] COND FALSE !(!(a != 0 && b != 0)) VAL [a=512, b=512, counter=12, p=4194304, q=0, x=1048576, y=1048576] [L39] COND TRUE a % 2 == 0 && b % 2 == 0 [L40] a = a / 2 [L41] b = b / 2 [L42] p = 4 * p VAL [a=256, b=256, counter=12, p=16777216, q=0, x=1048576, y=1048576] [L33] EXPR counter++ VAL [a=256, b=256, counter=13, counter++=12, p=16777216, q=0, x=1048576, y=1048576] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [\old(cond)=1, counter=13] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=13] [L34] RET __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [a=256, b=256, counter=13, p=16777216, q=0, x=1048576, y=1048576] [L36] COND FALSE !(!(a != 0 && b != 0)) VAL [a=256, b=256, counter=13, p=16777216, q=0, x=1048576, y=1048576] [L39] COND TRUE a % 2 == 0 && b % 2 == 0 [L40] a = a / 2 [L41] b = b / 2 [L42] p = 4 * p VAL [a=128, b=128, counter=13, p=67108864, q=0, x=1048576, y=1048576] [L33] EXPR counter++ VAL [a=128, b=128, counter=14, counter++=13, p=67108864, q=0, x=1048576, y=1048576] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [\old(cond)=1, counter=14] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=14] [L34] RET __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [a=128, b=128, counter=14, p=67108864, q=0, x=1048576, y=1048576] [L36] COND FALSE !(!(a != 0 && b != 0)) VAL [a=128, b=128, counter=14, p=67108864, q=0, x=1048576, y=1048576] [L39] COND TRUE a % 2 == 0 && b % 2 == 0 [L40] a = a / 2 [L41] b = b / 2 [L42] p = 4 * p VAL [a=64, b=64, counter=14, p=268435456, q=0, x=1048576, y=1048576] [L33] EXPR counter++ VAL [a=64, b=64, counter=15, counter++=14, p=268435456, q=0, x=1048576, y=1048576] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [\old(cond)=1, counter=15] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=15] [L34] RET __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [a=64, b=64, counter=15, p=268435456, q=0, x=1048576, y=1048576] [L36] COND FALSE !(!(a != 0 && b != 0)) VAL [a=64, b=64, counter=15, p=268435456, q=0, x=1048576, y=1048576] [L39] COND TRUE a % 2 == 0 && b % 2 == 0 [L40] a = a / 2 [L41] b = b / 2 [L42] p = 4 * p VAL [a=32, b=32, counter=15, p=1073741824, q=0, x=1048576, y=1048576] [L33] EXPR counter++ VAL [a=32, b=32, counter=16, counter++=15, p=1073741824, q=0, x=1048576, y=1048576] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [\old(cond)=1, counter=16] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=16] [L34] RET __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [a=32, b=32, counter=16, p=1073741824, q=0, x=1048576, y=1048576] [L36] COND FALSE !(!(a != 0 && b != 0)) VAL [a=32, b=32, counter=16, p=1073741824, q=0, x=1048576, y=1048576] [L39] COND TRUE a % 2 == 0 && b % 2 == 0 [L40] a = a / 2 [L41] b = b / 2 [L42] p = 4 * p VAL [a=16, b=16, counter=16, p=4294967296, q=0, x=1048576, y=1048576] [L33] EXPR counter++ VAL [a=16, b=16, counter=17, counter++=16, p=4294967296, q=0, x=1048576, y=1048576] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [\old(cond)=1, counter=17] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=17] [L34] RET __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [a=16, b=16, counter=17, p=4294967296, q=0, x=1048576, y=1048576] [L36] COND FALSE !(!(a != 0 && b != 0)) VAL [a=16, b=16, counter=17, p=4294967296, q=0, x=1048576, y=1048576] [L39] COND TRUE a % 2 == 0 && b % 2 == 0 [L40] a = a / 2 [L41] b = b / 2 [L42] p = 4 * p VAL [a=8, b=8, counter=17, p=17179869184, q=0, x=1048576, y=1048576] [L33] EXPR counter++ VAL [a=8, b=8, counter=18, counter++=17, p=17179869184, q=0, x=1048576, y=1048576] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [\old(cond)=1, counter=18] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=18] [L34] RET __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [a=8, b=8, counter=18, p=17179869184, q=0, x=1048576, y=1048576] [L36] COND FALSE !(!(a != 0 && b != 0)) VAL [a=8, b=8, counter=18, p=17179869184, q=0, x=1048576, y=1048576] [L39] COND TRUE a % 2 == 0 && b % 2 == 0 [L40] a = a / 2 [L41] b = b / 2 [L42] p = 4 * p VAL [a=4, b=4, counter=18, p=68719476736, q=0, x=1048576, y=1048576] [L33] EXPR counter++ VAL [a=4, b=4, counter=19, counter++=18, p=68719476736, q=0, x=1048576, y=1048576] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [\old(cond)=1, counter=19] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=19] [L34] RET __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [a=4, b=4, counter=19, p=68719476736, q=0, x=1048576, y=1048576] [L36] COND FALSE !(!(a != 0 && b != 0)) VAL [a=4, b=4, counter=19, p=68719476736, q=0, x=1048576, y=1048576] [L39] COND TRUE a % 2 == 0 && b % 2 == 0 [L40] a = a / 2 [L41] b = b / 2 [L42] p = 4 * p VAL [a=2, b=2, counter=19, p=274877906944, q=0, x=1048576, y=1048576] [L33] EXPR counter++ VAL [a=2, b=2, counter=20, counter++=19, p=274877906944, q=0, x=1048576, y=1048576] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [\old(cond)=1, counter=20] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=20] [L34] RET __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [a=2, b=2, counter=20, p=274877906944, q=0, x=1048576, y=1048576] [L36] COND FALSE !(!(a != 0 && b != 0)) VAL [a=2, b=2, counter=20, p=274877906944, q=0, x=1048576, y=1048576] [L39] COND TRUE a % 2 == 0 && b % 2 == 0 [L40] a = a / 2 [L41] b = b / 2 [L42] p = 4 * p VAL [a=1, b=1, counter=20, p=1099511627776, q=0, x=1048576, y=1048576] [L33] EXPR counter++ VAL [a=1, b=1, counter=21, counter++=20, p=1099511627776, q=0, x=1048576, y=1048576] [L33] COND FALSE !(counter++<20) [L56] CALL __VERIFIER_assert(q == (long long) x * y) VAL [\old(cond)=0, counter=21] [L12] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, counter=21] [L14] reach_error() VAL [\old(cond)=0, cond=0, counter=21] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 23 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.7s, OverallIterations: 10, TraceHistogramMax: 21, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 688 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 688 mSDsluCounter, 992 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 768 mSDsCounter, 102 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 728 IncrementalHoareTripleChecker+Invalid, 830 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 102 mSolverCounterUnsat, 224 mSDtfsCounter, 728 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 512 GetRequests, 376 SyntacticMatches, 4 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 460 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=234occurred in iteration=9, InterpolantAutomatonStates: 117, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 51 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 459 NumberOfCodeBlocks, 459 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 456 ConstructedInterpolants, 1 QuantifiedInterpolants, 1496 SizeOfPredicates, 47 NumberOfNonLiveVariables, 963 ConjunctsInSsa, 132 ConjunctsInUnsatCore, 15 InterpolantComputations, 4 PerfectInterpolantSequences, 286/1068 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-02-16 02:43:24,189 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE