/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/hard2_unwindbound2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 13:45:13,710 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 13:45:13,712 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 13:45:13,783 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 13:45:13,783 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 13:45:13,784 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 13:45:13,787 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 13:45:13,789 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 13:45:13,790 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 13:45:13,798 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 13:45:13,799 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 13:45:13,800 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 13:45:13,800 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 13:45:13,801 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 13:45:13,802 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 13:45:13,804 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 13:45:13,805 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 13:45:13,805 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 13:45:13,807 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 13:45:13,811 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 13:45:13,813 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 13:45:13,813 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 13:45:13,814 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 13:45:13,815 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 13:45:13,816 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 13:45:13,821 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 13:45:13,821 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 13:45:13,821 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 13:45:13,822 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 13:45:13,822 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 13:45:13,827 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 13:45:13,827 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 13:45:13,828 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 13:45:13,829 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 13:45:13,829 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 13:45:13,829 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 13:45:13,830 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 13:45:13,830 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 13:45:13,830 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 13:45:13,830 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 13:45:13,831 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 13:45:13,832 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 13:45:13,833 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-27 13:45:13,855 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 13:45:13,856 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 13:45:13,856 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 13:45:13,856 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 13:45:13,856 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 13:45:13,856 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 13:45:13,857 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 13:45:13,857 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 13:45:13,857 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 13:45:13,858 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 13:45:13,858 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 13:45:13,858 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 13:45:13,858 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 13:45:13,858 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 13:45:13,858 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 13:45:13,859 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 13:45:13,859 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 13:45:13,859 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 13:45:13,859 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 13:45:13,859 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 13:45:13,859 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 13:45:13,860 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 13:45:13,860 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 13:45:13,860 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 13:45:13,860 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 13:45:13,861 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 13:45:13,861 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 13:45:13,861 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 13:45:13,861 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 13:45:13,861 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 13:45:13,861 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 13:45:13,861 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 13:45:13,861 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 13:45:13,862 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 13:45:14,059 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 13:45:14,078 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 13:45:14,080 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 13:45:14,081 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 13:45:14,081 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 13:45:14,082 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/hard2_unwindbound2.c [2022-04-27 13:45:14,126 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1de686c6/a3d38b6c95584bac8bbcd07b804a06ac/FLAGe3660d97b [2022-04-27 13:45:14,523 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 13:45:14,524 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/hard2_unwindbound2.c [2022-04-27 13:45:14,530 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1de686c6/a3d38b6c95584bac8bbcd07b804a06ac/FLAGe3660d97b [2022-04-27 13:45:14,541 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1de686c6/a3d38b6c95584bac8bbcd07b804a06ac [2022-04-27 13:45:14,543 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 13:45:14,544 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 13:45:14,546 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 13:45:14,546 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 13:45:14,549 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 13:45:14,550 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 01:45:14" (1/1) ... [2022-04-27 13:45:14,551 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e2ca90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:45:14, skipping insertion in model container [2022-04-27 13:45:14,551 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 01:45:14" (1/1) ... [2022-04-27 13:45:14,556 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 13:45:14,569 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 13:45:14,707 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/hard2_unwindbound2.c[526,539] [2022-04-27 13:45:14,731 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 13:45:14,742 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 13:45:14,754 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/hard2_unwindbound2.c[526,539] [2022-04-27 13:45:14,769 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 13:45:14,780 INFO L208 MainTranslator]: Completed translation [2022-04-27 13:45:14,781 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:45:14 WrapperNode [2022-04-27 13:45:14,781 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 13:45:14,782 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 13:45:14,782 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 13:45:14,782 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 13:45:14,790 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:45:14" (1/1) ... [2022-04-27 13:45:14,790 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:45:14" (1/1) ... [2022-04-27 13:45:14,795 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:45:14" (1/1) ... [2022-04-27 13:45:14,795 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:45:14" (1/1) ... [2022-04-27 13:45:14,807 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:45:14" (1/1) ... [2022-04-27 13:45:14,812 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:45:14" (1/1) ... [2022-04-27 13:45:14,819 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:45:14" (1/1) ... [2022-04-27 13:45:14,821 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 13:45:14,822 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 13:45:14,822 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 13:45:14,822 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 13:45:14,823 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:45:14" (1/1) ... [2022-04-27 13:45:14,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 13:45:14,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:45:14,844 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-27 13:45:14,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-27 13:45:14,881 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 13:45:14,881 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 13:45:14,881 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 13:45:14,882 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 13:45:14,882 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 13:45:14,883 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 13:45:14,883 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 13:45:14,883 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 13:45:14,883 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 13:45:14,883 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 13:45:14,883 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 13:45:14,883 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 13:45:14,883 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 13:45:14,883 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 13:45:14,883 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 13:45:14,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 13:45:14,883 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 13:45:14,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 13:45:14,883 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 13:45:14,883 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 13:45:14,937 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 13:45:14,939 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 13:45:15,100 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 13:45:15,104 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 13:45:15,105 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-27 13:45:15,106 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 01:45:15 BoogieIcfgContainer [2022-04-27 13:45:15,106 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 13:45:15,107 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 13:45:15,107 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 13:45:15,112 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 13:45:15,112 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 01:45:14" (1/3) ... [2022-04-27 13:45:15,113 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79a6b4e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 01:45:15, skipping insertion in model container [2022-04-27 13:45:15,113 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:45:14" (2/3) ... [2022-04-27 13:45:15,113 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79a6b4e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 01:45:15, skipping insertion in model container [2022-04-27 13:45:15,113 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 01:45:15" (3/3) ... [2022-04-27 13:45:15,114 INFO L111 eAbstractionObserver]: Analyzing ICFG hard2_unwindbound2.c [2022-04-27 13:45:15,125 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 13:45:15,125 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 13:45:15,171 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 13:45:15,178 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5559d478, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3f3ce980 [2022-04-27 13:45:15,178 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 13:45:15,184 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 13:45:15,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 13:45:15,189 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:45:15,189 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:45:15,190 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:45:15,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:45:15,195 INFO L85 PathProgramCache]: Analyzing trace with hash -1682617676, now seen corresponding path program 1 times [2022-04-27 13:45:15,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:45:15,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549727193] [2022-04-27 13:45:15,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:45:15,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:45:15,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:45:15,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 13:45:15,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:45:15,371 INFO L290 TraceCheckUtils]: 0: Hoare triple {39#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {34#true} is VALID [2022-04-27 13:45:15,371 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#true} assume true; {34#true} is VALID [2022-04-27 13:45:15,371 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34#true} {34#true} #92#return; {34#true} is VALID [2022-04-27 13:45:15,373 INFO L272 TraceCheckUtils]: 0: Hoare triple {34#true} call ULTIMATE.init(); {39#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 13:45:15,374 INFO L290 TraceCheckUtils]: 1: Hoare triple {39#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {34#true} is VALID [2022-04-27 13:45:15,374 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#true} assume true; {34#true} is VALID [2022-04-27 13:45:15,374 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34#true} {34#true} #92#return; {34#true} is VALID [2022-04-27 13:45:15,374 INFO L272 TraceCheckUtils]: 4: Hoare triple {34#true} call #t~ret7 := main(); {34#true} is VALID [2022-04-27 13:45:15,374 INFO L290 TraceCheckUtils]: 5: Hoare triple {34#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {34#true} is VALID [2022-04-27 13:45:15,375 INFO L290 TraceCheckUtils]: 6: Hoare triple {34#true} assume !true; {35#false} is VALID [2022-04-27 13:45:15,375 INFO L290 TraceCheckUtils]: 7: Hoare triple {35#false} assume !true; {35#false} is VALID [2022-04-27 13:45:15,375 INFO L272 TraceCheckUtils]: 8: Hoare triple {35#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {35#false} is VALID [2022-04-27 13:45:15,375 INFO L290 TraceCheckUtils]: 9: Hoare triple {35#false} ~cond := #in~cond; {35#false} is VALID [2022-04-27 13:45:15,375 INFO L290 TraceCheckUtils]: 10: Hoare triple {35#false} assume 0 == ~cond; {35#false} is VALID [2022-04-27 13:45:15,375 INFO L290 TraceCheckUtils]: 11: Hoare triple {35#false} assume !false; {35#false} is VALID [2022-04-27 13:45:15,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 13:45:15,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:45:15,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549727193] [2022-04-27 13:45:15,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549727193] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:45:15,377 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:45:15,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 13:45:15,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484775964] [2022-04-27 13:45:15,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:45:15,382 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 13:45:15,383 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:45:15,385 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 13:45:15,397 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:45:15,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 13:45:15,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:45:15,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 13:45:15,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 13:45:15,412 INFO L87 Difference]: Start difference. First operand has 31 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 13:45:15,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:45:15,561 INFO L93 Difference]: Finished difference Result 57 states and 91 transitions. [2022-04-27 13:45:15,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 13:45:15,562 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 13:45:15,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:45:15,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 13:45:15,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 91 transitions. [2022-04-27 13:45:15,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 13:45:15,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 91 transitions. [2022-04-27 13:45:15,583 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 91 transitions. [2022-04-27 13:45:15,714 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:45:15,720 INFO L225 Difference]: With dead ends: 57 [2022-04-27 13:45:15,720 INFO L226 Difference]: Without dead ends: 27 [2022-04-27 13:45:15,723 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 13:45:15,729 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 6 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 13:45:15,730 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 44 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 13:45:15,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-27 13:45:15,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2022-04-27 13:45:15,771 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:45:15,771 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 26 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 13:45:15,772 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 26 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 13:45:15,775 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 26 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 13:45:15,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:45:15,791 INFO L93 Difference]: Finished difference Result 27 states and 37 transitions. [2022-04-27 13:45:15,792 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2022-04-27 13:45:15,792 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:45:15,792 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:45:15,793 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 27 states. [2022-04-27 13:45:15,793 INFO L87 Difference]: Start difference. First operand has 26 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 27 states. [2022-04-27 13:45:15,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:45:15,797 INFO L93 Difference]: Finished difference Result 27 states and 37 transitions. [2022-04-27 13:45:15,797 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2022-04-27 13:45:15,798 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:45:15,798 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:45:15,798 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:45:15,798 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:45:15,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 13:45:15,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 36 transitions. [2022-04-27 13:45:15,803 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 36 transitions. Word has length 12 [2022-04-27 13:45:15,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:45:15,803 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 36 transitions. [2022-04-27 13:45:15,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 13:45:15,808 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 36 transitions. [2022-04-27 13:45:15,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 13:45:15,808 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:45:15,808 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:45:15,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 13:45:15,809 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:45:15,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:45:15,814 INFO L85 PathProgramCache]: Analyzing trace with hash -2144676086, now seen corresponding path program 1 times [2022-04-27 13:45:15,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:45:15,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701756829] [2022-04-27 13:45:15,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:45:15,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:45:15,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:45:15,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 13:45:15,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:45:15,912 INFO L290 TraceCheckUtils]: 0: Hoare triple {223#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {215#true} is VALID [2022-04-27 13:45:15,913 INFO L290 TraceCheckUtils]: 1: Hoare triple {215#true} assume true; {215#true} is VALID [2022-04-27 13:45:15,913 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {215#true} {215#true} #92#return; {215#true} is VALID [2022-04-27 13:45:15,913 INFO L272 TraceCheckUtils]: 0: Hoare triple {215#true} call ULTIMATE.init(); {223#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 13:45:15,914 INFO L290 TraceCheckUtils]: 1: Hoare triple {223#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {215#true} is VALID [2022-04-27 13:45:15,914 INFO L290 TraceCheckUtils]: 2: Hoare triple {215#true} assume true; {215#true} is VALID [2022-04-27 13:45:15,914 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {215#true} {215#true} #92#return; {215#true} is VALID [2022-04-27 13:45:15,914 INFO L272 TraceCheckUtils]: 4: Hoare triple {215#true} call #t~ret7 := main(); {215#true} is VALID [2022-04-27 13:45:15,914 INFO L290 TraceCheckUtils]: 5: Hoare triple {215#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {220#(= main_~q~0 0)} is VALID [2022-04-27 13:45:15,915 INFO L290 TraceCheckUtils]: 6: Hoare triple {220#(= main_~q~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {220#(= main_~q~0 0)} is VALID [2022-04-27 13:45:15,915 INFO L290 TraceCheckUtils]: 7: Hoare triple {220#(= main_~q~0 0)} assume !!(#t~post5 < 2);havoc #t~post5; {220#(= main_~q~0 0)} is VALID [2022-04-27 13:45:15,916 INFO L272 TraceCheckUtils]: 8: Hoare triple {220#(= main_~q~0 0)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {221#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:45:15,916 INFO L290 TraceCheckUtils]: 9: Hoare triple {221#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {222#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 13:45:15,916 INFO L290 TraceCheckUtils]: 10: Hoare triple {222#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {216#false} is VALID [2022-04-27 13:45:15,917 INFO L290 TraceCheckUtils]: 11: Hoare triple {216#false} assume !false; {216#false} is VALID [2022-04-27 13:45:15,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 13:45:15,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:45:15,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701756829] [2022-04-27 13:45:15,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701756829] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:45:15,917 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:45:15,917 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 13:45:15,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820205112] [2022-04-27 13:45:15,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:45:15,919 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 13:45:15,919 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:45:15,919 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 13:45:15,930 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:45:15,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 13:45:15,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:45:15,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 13:45:15,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 13:45:15,933 INFO L87 Difference]: Start difference. First operand 26 states and 36 transitions. Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 13:45:16,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:45:16,270 INFO L93 Difference]: Finished difference Result 41 states and 56 transitions. [2022-04-27 13:45:16,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 13:45:16,271 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 13:45:16,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:45:16,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 13:45:16,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 56 transitions. [2022-04-27 13:45:16,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 13:45:16,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 56 transitions. [2022-04-27 13:45:16,278 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 56 transitions. [2022-04-27 13:45:16,321 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:45:16,323 INFO L225 Difference]: With dead ends: 41 [2022-04-27 13:45:16,323 INFO L226 Difference]: Without dead ends: 39 [2022-04-27 13:45:16,323 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-27 13:45:16,324 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 24 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 13:45:16,324 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 85 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 13:45:16,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-27 13:45:16,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 30. [2022-04-27 13:45:16,329 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:45:16,330 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 30 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 13:45:16,330 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 30 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 13:45:16,330 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 30 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 13:45:16,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:45:16,333 INFO L93 Difference]: Finished difference Result 39 states and 54 transitions. [2022-04-27 13:45:16,333 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 54 transitions. [2022-04-27 13:45:16,333 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:45:16,333 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:45:16,334 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 39 states. [2022-04-27 13:45:16,334 INFO L87 Difference]: Start difference. First operand has 30 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 39 states. [2022-04-27 13:45:16,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:45:16,337 INFO L93 Difference]: Finished difference Result 39 states and 54 transitions. [2022-04-27 13:45:16,337 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 54 transitions. [2022-04-27 13:45:16,337 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:45:16,337 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:45:16,337 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:45:16,337 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:45:16,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 13:45:16,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 39 transitions. [2022-04-27 13:45:16,339 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 39 transitions. Word has length 12 [2022-04-27 13:45:16,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:45:16,340 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 39 transitions. [2022-04-27 13:45:16,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 13:45:16,340 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 39 transitions. [2022-04-27 13:45:16,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-27 13:45:16,340 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:45:16,340 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:45:16,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 13:45:16,341 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:45:16,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:45:16,341 INFO L85 PathProgramCache]: Analyzing trace with hash 1842794081, now seen corresponding path program 1 times [2022-04-27 13:45:16,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:45:16,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363851333] [2022-04-27 13:45:16,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:45:16,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:45:16,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:45:16,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 13:45:16,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:45:16,388 INFO L290 TraceCheckUtils]: 0: Hoare triple {423#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {421#(<= ~counter~0 0)} is VALID [2022-04-27 13:45:16,389 INFO L290 TraceCheckUtils]: 1: Hoare triple {421#(<= ~counter~0 0)} assume true; {421#(<= ~counter~0 0)} is VALID [2022-04-27 13:45:16,389 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {421#(<= ~counter~0 0)} {416#true} #92#return; {421#(<= ~counter~0 0)} is VALID [2022-04-27 13:45:16,390 INFO L272 TraceCheckUtils]: 0: Hoare triple {416#true} call ULTIMATE.init(); {423#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 13:45:16,391 INFO L290 TraceCheckUtils]: 1: Hoare triple {423#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {421#(<= ~counter~0 0)} is VALID [2022-04-27 13:45:16,391 INFO L290 TraceCheckUtils]: 2: Hoare triple {421#(<= ~counter~0 0)} assume true; {421#(<= ~counter~0 0)} is VALID [2022-04-27 13:45:16,391 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {421#(<= ~counter~0 0)} {416#true} #92#return; {421#(<= ~counter~0 0)} is VALID [2022-04-27 13:45:16,392 INFO L272 TraceCheckUtils]: 4: Hoare triple {421#(<= ~counter~0 0)} call #t~ret7 := main(); {421#(<= ~counter~0 0)} is VALID [2022-04-27 13:45:16,392 INFO L290 TraceCheckUtils]: 5: Hoare triple {421#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {421#(<= ~counter~0 0)} is VALID [2022-04-27 13:45:16,393 INFO L290 TraceCheckUtils]: 6: Hoare triple {421#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {422#(<= |main_#t~post5| 0)} is VALID [2022-04-27 13:45:16,393 INFO L290 TraceCheckUtils]: 7: Hoare triple {422#(<= |main_#t~post5| 0)} assume !(#t~post5 < 2);havoc #t~post5; {417#false} is VALID [2022-04-27 13:45:16,393 INFO L290 TraceCheckUtils]: 8: Hoare triple {417#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {417#false} is VALID [2022-04-27 13:45:16,393 INFO L290 TraceCheckUtils]: 9: Hoare triple {417#false} assume !(#t~post6 < 2);havoc #t~post6; {417#false} is VALID [2022-04-27 13:45:16,393 INFO L272 TraceCheckUtils]: 10: Hoare triple {417#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {417#false} is VALID [2022-04-27 13:45:16,394 INFO L290 TraceCheckUtils]: 11: Hoare triple {417#false} ~cond := #in~cond; {417#false} is VALID [2022-04-27 13:45:16,394 INFO L290 TraceCheckUtils]: 12: Hoare triple {417#false} assume 0 == ~cond; {417#false} is VALID [2022-04-27 13:45:16,394 INFO L290 TraceCheckUtils]: 13: Hoare triple {417#false} assume !false; {417#false} is VALID [2022-04-27 13:45:16,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 13:45:16,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:45:16,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363851333] [2022-04-27 13:45:16,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363851333] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:45:16,395 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:45:16,395 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 13:45:16,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208043931] [2022-04-27 13:45:16,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:45:16,395 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-27 13:45:16,396 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:45:16,396 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 13:45:16,405 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:45:16,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 13:45:16,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:45:16,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 13:45:16,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 13:45:16,406 INFO L87 Difference]: Start difference. First operand 30 states and 39 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 13:45:16,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:45:16,556 INFO L93 Difference]: Finished difference Result 46 states and 61 transitions. [2022-04-27 13:45:16,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 13:45:16,556 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-27 13:45:16,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:45:16,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 13:45:16,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 58 transitions. [2022-04-27 13:45:16,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 13:45:16,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 58 transitions. [2022-04-27 13:45:16,560 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 58 transitions. [2022-04-27 13:45:16,602 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:45:16,603 INFO L225 Difference]: With dead ends: 46 [2022-04-27 13:45:16,604 INFO L226 Difference]: Without dead ends: 32 [2022-04-27 13:45:16,604 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 13:45:16,605 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 6 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 13:45:16,605 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 73 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 13:45:16,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-27 13:45:16,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-27 13:45:16,610 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:45:16,611 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 13:45:16,611 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 13:45:16,611 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 13:45:16,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:45:16,613 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2022-04-27 13:45:16,613 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-27 13:45:16,614 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:45:16,614 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:45:16,614 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 32 states. [2022-04-27 13:45:16,614 INFO L87 Difference]: Start difference. First operand has 32 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 32 states. [2022-04-27 13:45:16,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:45:16,616 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2022-04-27 13:45:16,616 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-27 13:45:16,616 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:45:16,617 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:45:16,617 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:45:16,617 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:45:16,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 13:45:16,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2022-04-27 13:45:16,618 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 41 transitions. Word has length 14 [2022-04-27 13:45:16,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:45:16,618 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 41 transitions. [2022-04-27 13:45:16,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 13:45:16,619 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-27 13:45:16,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 13:45:16,619 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:45:16,619 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:45:16,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-27 13:45:16,620 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:45:16,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:45:16,620 INFO L85 PathProgramCache]: Analyzing trace with hash 311129497, now seen corresponding path program 1 times [2022-04-27 13:45:16,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:45:16,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806180173] [2022-04-27 13:45:16,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:45:16,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:45:16,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:45:16,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 13:45:16,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:45:16,672 INFO L290 TraceCheckUtils]: 0: Hoare triple {617#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {605#true} is VALID [2022-04-27 13:45:16,672 INFO L290 TraceCheckUtils]: 1: Hoare triple {605#true} assume true; {605#true} is VALID [2022-04-27 13:45:16,672 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {605#true} {605#true} #92#return; {605#true} is VALID [2022-04-27 13:45:16,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-04-27 13:45:16,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:45:16,678 INFO L290 TraceCheckUtils]: 0: Hoare triple {605#true} ~cond := #in~cond; {605#true} is VALID [2022-04-27 13:45:16,678 INFO L290 TraceCheckUtils]: 1: Hoare triple {605#true} assume !(0 == ~cond); {605#true} is VALID [2022-04-27 13:45:16,678 INFO L290 TraceCheckUtils]: 2: Hoare triple {605#true} assume true; {605#true} is VALID [2022-04-27 13:45:16,679 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {605#true} {610#(= main_~A~0 main_~r~0)} #78#return; {610#(= main_~A~0 main_~r~0)} is VALID [2022-04-27 13:45:16,679 INFO L272 TraceCheckUtils]: 0: Hoare triple {605#true} call ULTIMATE.init(); {617#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 13:45:16,680 INFO L290 TraceCheckUtils]: 1: Hoare triple {617#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {605#true} is VALID [2022-04-27 13:45:16,680 INFO L290 TraceCheckUtils]: 2: Hoare triple {605#true} assume true; {605#true} is VALID [2022-04-27 13:45:16,680 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {605#true} {605#true} #92#return; {605#true} is VALID [2022-04-27 13:45:16,680 INFO L272 TraceCheckUtils]: 4: Hoare triple {605#true} call #t~ret7 := main(); {605#true} is VALID [2022-04-27 13:45:16,680 INFO L290 TraceCheckUtils]: 5: Hoare triple {605#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {610#(= main_~A~0 main_~r~0)} is VALID [2022-04-27 13:45:16,681 INFO L290 TraceCheckUtils]: 6: Hoare triple {610#(= main_~A~0 main_~r~0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {610#(= main_~A~0 main_~r~0)} is VALID [2022-04-27 13:45:16,681 INFO L290 TraceCheckUtils]: 7: Hoare triple {610#(= main_~A~0 main_~r~0)} assume !!(#t~post5 < 2);havoc #t~post5; {610#(= main_~A~0 main_~r~0)} is VALID [2022-04-27 13:45:16,681 INFO L272 TraceCheckUtils]: 8: Hoare triple {610#(= main_~A~0 main_~r~0)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {605#true} is VALID [2022-04-27 13:45:16,681 INFO L290 TraceCheckUtils]: 9: Hoare triple {605#true} ~cond := #in~cond; {605#true} is VALID [2022-04-27 13:45:16,681 INFO L290 TraceCheckUtils]: 10: Hoare triple {605#true} assume !(0 == ~cond); {605#true} is VALID [2022-04-27 13:45:16,681 INFO L290 TraceCheckUtils]: 11: Hoare triple {605#true} assume true; {605#true} is VALID [2022-04-27 13:45:16,682 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {605#true} {610#(= main_~A~0 main_~r~0)} #78#return; {610#(= main_~A~0 main_~r~0)} is VALID [2022-04-27 13:45:16,682 INFO L272 TraceCheckUtils]: 13: Hoare triple {610#(= main_~A~0 main_~r~0)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {615#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:45:16,683 INFO L290 TraceCheckUtils]: 14: Hoare triple {615#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {616#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 13:45:16,683 INFO L290 TraceCheckUtils]: 15: Hoare triple {616#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {606#false} is VALID [2022-04-27 13:45:16,683 INFO L290 TraceCheckUtils]: 16: Hoare triple {606#false} assume !false; {606#false} is VALID [2022-04-27 13:45:16,684 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 13:45:16,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:45:16,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806180173] [2022-04-27 13:45:16,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806180173] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:45:16,684 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:45:16,684 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 13:45:16,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241389541] [2022-04-27 13:45:16,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:45:16,685 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 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 17 [2022-04-27 13:45:16,685 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:45:16,685 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 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) [2022-04-27 13:45:16,696 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:45:16,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 13:45:16,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:45:16,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 13:45:16,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 13:45:16,697 INFO L87 Difference]: Start difference. First operand 32 states and 41 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 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) [2022-04-27 13:45:16,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:45:16,951 INFO L93 Difference]: Finished difference Result 46 states and 60 transitions. [2022-04-27 13:45:16,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 13:45:16,952 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 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 17 [2022-04-27 13:45:16,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:45:16,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 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) [2022-04-27 13:45:16,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 56 transitions. [2022-04-27 13:45:16,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 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) [2022-04-27 13:45:16,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 56 transitions. [2022-04-27 13:45:16,955 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 56 transitions. [2022-04-27 13:45:16,993 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:45:16,994 INFO L225 Difference]: With dead ends: 46 [2022-04-27 13:45:16,994 INFO L226 Difference]: Without dead ends: 44 [2022-04-27 13:45:16,995 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-27 13:45:16,996 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 19 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 13:45:16,996 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 78 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 13:45:16,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-27 13:45:17,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 36. [2022-04-27 13:45:17,002 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:45:17,002 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 36 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 13:45:17,002 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 36 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 13:45:17,003 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 36 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 13:45:17,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:45:17,004 INFO L93 Difference]: Finished difference Result 44 states and 58 transitions. [2022-04-27 13:45:17,005 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 58 transitions. [2022-04-27 13:45:17,005 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:45:17,005 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:45:17,005 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 44 states. [2022-04-27 13:45:17,005 INFO L87 Difference]: Start difference. First operand has 36 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 44 states. [2022-04-27 13:45:17,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:45:17,007 INFO L93 Difference]: Finished difference Result 44 states and 58 transitions. [2022-04-27 13:45:17,007 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 58 transitions. [2022-04-27 13:45:17,007 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:45:17,007 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:45:17,007 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:45:17,008 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:45:17,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 13:45:17,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2022-04-27 13:45:17,009 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 44 transitions. Word has length 17 [2022-04-27 13:45:17,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:45:17,009 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 44 transitions. [2022-04-27 13:45:17,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 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) [2022-04-27 13:45:17,010 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2022-04-27 13:45:17,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-27 13:45:17,010 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:45:17,010 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:45:17,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-27 13:45:17,010 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:45:17,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:45:17,011 INFO L85 PathProgramCache]: Analyzing trace with hash -1912623062, now seen corresponding path program 1 times [2022-04-27 13:45:17,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:45:17,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783890914] [2022-04-27 13:45:17,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:45:17,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:45:17,020 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:45:17,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [99632202] [2022-04-27 13:45:17,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:45:17,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:45:17,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:45:17,022 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 13:45:17,059 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-27 13:45:17,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:45:17,085 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-27 13:45:17,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:45:17,105 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:45:17,318 INFO L272 TraceCheckUtils]: 0: Hoare triple {834#true} call ULTIMATE.init(); {834#true} is VALID [2022-04-27 13:45:17,318 INFO L290 TraceCheckUtils]: 1: Hoare triple {834#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {834#true} is VALID [2022-04-27 13:45:17,318 INFO L290 TraceCheckUtils]: 2: Hoare triple {834#true} assume true; {834#true} is VALID [2022-04-27 13:45:17,318 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {834#true} {834#true} #92#return; {834#true} is VALID [2022-04-27 13:45:17,318 INFO L272 TraceCheckUtils]: 4: Hoare triple {834#true} call #t~ret7 := main(); {834#true} is VALID [2022-04-27 13:45:17,319 INFO L290 TraceCheckUtils]: 5: Hoare triple {834#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {854#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:45:17,319 INFO L290 TraceCheckUtils]: 6: Hoare triple {854#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {854#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:45:17,320 INFO L290 TraceCheckUtils]: 7: Hoare triple {854#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} assume !!(#t~post5 < 2);havoc #t~post5; {854#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:45:17,320 INFO L272 TraceCheckUtils]: 8: Hoare triple {854#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {834#true} is VALID [2022-04-27 13:45:17,342 INFO L290 TraceCheckUtils]: 9: Hoare triple {834#true} ~cond := #in~cond; {834#true} is VALID [2022-04-27 13:45:17,342 INFO L290 TraceCheckUtils]: 10: Hoare triple {834#true} assume !(0 == ~cond); {834#true} is VALID [2022-04-27 13:45:17,342 INFO L290 TraceCheckUtils]: 11: Hoare triple {834#true} assume true; {834#true} is VALID [2022-04-27 13:45:17,343 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {834#true} {854#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #78#return; {854#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:45:17,343 INFO L272 TraceCheckUtils]: 13: Hoare triple {854#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {834#true} is VALID [2022-04-27 13:45:17,343 INFO L290 TraceCheckUtils]: 14: Hoare triple {834#true} ~cond := #in~cond; {834#true} is VALID [2022-04-27 13:45:17,344 INFO L290 TraceCheckUtils]: 15: Hoare triple {834#true} assume !(0 == ~cond); {834#true} is VALID [2022-04-27 13:45:17,344 INFO L290 TraceCheckUtils]: 16: Hoare triple {834#true} assume true; {834#true} is VALID [2022-04-27 13:45:17,344 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {834#true} {854#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #80#return; {854#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:45:17,345 INFO L272 TraceCheckUtils]: 18: Hoare triple {854#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {894#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:45:17,345 INFO L290 TraceCheckUtils]: 19: Hoare triple {894#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {898#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:45:17,346 INFO L290 TraceCheckUtils]: 20: Hoare triple {898#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {835#false} is VALID [2022-04-27 13:45:17,346 INFO L290 TraceCheckUtils]: 21: Hoare triple {835#false} assume !false; {835#false} is VALID [2022-04-27 13:45:17,346 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 13:45:17,346 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 13:45:17,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:45:17,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783890914] [2022-04-27 13:45:17,346 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:45:17,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [99632202] [2022-04-27 13:45:17,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [99632202] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:45:17,347 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:45:17,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 13:45:17,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430526583] [2022-04-27 13:45:17,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:45:17,347 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-27 13:45:17,348 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:45:17,348 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 13:45:17,360 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:45:17,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 13:45:17,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:45:17,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 13:45:17,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 13:45:17,362 INFO L87 Difference]: Start difference. First operand 36 states and 44 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 13:45:17,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:45:17,500 INFO L93 Difference]: Finished difference Result 65 states and 87 transitions. [2022-04-27 13:45:17,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 13:45:17,500 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-27 13:45:17,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:45:17,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 13:45:17,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 81 transitions. [2022-04-27 13:45:17,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 13:45:17,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 81 transitions. [2022-04-27 13:45:17,504 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 81 transitions. [2022-04-27 13:45:17,552 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:45:17,554 INFO L225 Difference]: With dead ends: 65 [2022-04-27 13:45:17,555 INFO L226 Difference]: Without dead ends: 50 [2022-04-27 13:45:17,555 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 13:45:17,557 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 10 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 13:45:17,557 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 121 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 13:45:17,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-27 13:45:17,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-04-27 13:45:17,569 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:45:17,570 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 50 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 31 states have internal predecessors, (37), 15 states have call successors, (15), 6 states have call predecessors, (15), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 13:45:17,571 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 50 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 31 states have internal predecessors, (37), 15 states have call successors, (15), 6 states have call predecessors, (15), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 13:45:17,572 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 50 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 31 states have internal predecessors, (37), 15 states have call successors, (15), 6 states have call predecessors, (15), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 13:45:17,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:45:17,575 INFO L93 Difference]: Finished difference Result 50 states and 64 transitions. [2022-04-27 13:45:17,575 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2022-04-27 13:45:17,575 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:45:17,576 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:45:17,576 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 31 states have internal predecessors, (37), 15 states have call successors, (15), 6 states have call predecessors, (15), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 50 states. [2022-04-27 13:45:17,577 INFO L87 Difference]: Start difference. First operand has 50 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 31 states have internal predecessors, (37), 15 states have call successors, (15), 6 states have call predecessors, (15), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 50 states. [2022-04-27 13:45:17,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:45:17,579 INFO L93 Difference]: Finished difference Result 50 states and 64 transitions. [2022-04-27 13:45:17,580 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2022-04-27 13:45:17,580 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:45:17,580 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:45:17,580 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:45:17,580 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:45:17,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 31 states have internal predecessors, (37), 15 states have call successors, (15), 6 states have call predecessors, (15), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 13:45:17,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 64 transitions. [2022-04-27 13:45:17,585 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 64 transitions. Word has length 22 [2022-04-27 13:45:17,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:45:17,586 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 64 transitions. [2022-04-27 13:45:17,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 13:45:17,590 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2022-04-27 13:45:17,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-27 13:45:17,591 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:45:17,591 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:45:17,626 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-27 13:45:17,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:45:17,811 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:45:17,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:45:17,812 INFO L85 PathProgramCache]: Analyzing trace with hash 214651490, now seen corresponding path program 1 times [2022-04-27 13:45:17,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:45:17,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544969018] [2022-04-27 13:45:17,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:45:17,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:45:17,826 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:45:17,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [527739307] [2022-04-27 13:45:17,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:45:17,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:45:17,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:45:17,828 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 13:45:17,829 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-27 13:45:17,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:45:17,868 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 13:45:17,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:45:17,878 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:45:18,044 INFO L272 TraceCheckUtils]: 0: Hoare triple {1173#true} call ULTIMATE.init(); {1173#true} is VALID [2022-04-27 13:45:18,044 INFO L290 TraceCheckUtils]: 1: Hoare triple {1173#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1181#(<= ~counter~0 0)} is VALID [2022-04-27 13:45:18,045 INFO L290 TraceCheckUtils]: 2: Hoare triple {1181#(<= ~counter~0 0)} assume true; {1181#(<= ~counter~0 0)} is VALID [2022-04-27 13:45:18,045 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1181#(<= ~counter~0 0)} {1173#true} #92#return; {1181#(<= ~counter~0 0)} is VALID [2022-04-27 13:45:18,046 INFO L272 TraceCheckUtils]: 4: Hoare triple {1181#(<= ~counter~0 0)} call #t~ret7 := main(); {1181#(<= ~counter~0 0)} is VALID [2022-04-27 13:45:18,046 INFO L290 TraceCheckUtils]: 5: Hoare triple {1181#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {1181#(<= ~counter~0 0)} is VALID [2022-04-27 13:45:18,046 INFO L290 TraceCheckUtils]: 6: Hoare triple {1181#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1197#(<= ~counter~0 1)} is VALID [2022-04-27 13:45:18,047 INFO L290 TraceCheckUtils]: 7: Hoare triple {1197#(<= ~counter~0 1)} assume !!(#t~post5 < 2);havoc #t~post5; {1197#(<= ~counter~0 1)} is VALID [2022-04-27 13:45:18,047 INFO L272 TraceCheckUtils]: 8: Hoare triple {1197#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {1197#(<= ~counter~0 1)} is VALID [2022-04-27 13:45:18,050 INFO L290 TraceCheckUtils]: 9: Hoare triple {1197#(<= ~counter~0 1)} ~cond := #in~cond; {1197#(<= ~counter~0 1)} is VALID [2022-04-27 13:45:18,051 INFO L290 TraceCheckUtils]: 10: Hoare triple {1197#(<= ~counter~0 1)} assume !(0 == ~cond); {1197#(<= ~counter~0 1)} is VALID [2022-04-27 13:45:18,051 INFO L290 TraceCheckUtils]: 11: Hoare triple {1197#(<= ~counter~0 1)} assume true; {1197#(<= ~counter~0 1)} is VALID [2022-04-27 13:45:18,051 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1197#(<= ~counter~0 1)} {1197#(<= ~counter~0 1)} #78#return; {1197#(<= ~counter~0 1)} is VALID [2022-04-27 13:45:18,052 INFO L272 TraceCheckUtils]: 13: Hoare triple {1197#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {1197#(<= ~counter~0 1)} is VALID [2022-04-27 13:45:18,052 INFO L290 TraceCheckUtils]: 14: Hoare triple {1197#(<= ~counter~0 1)} ~cond := #in~cond; {1197#(<= ~counter~0 1)} is VALID [2022-04-27 13:45:18,054 INFO L290 TraceCheckUtils]: 15: Hoare triple {1197#(<= ~counter~0 1)} assume !(0 == ~cond); {1197#(<= ~counter~0 1)} is VALID [2022-04-27 13:45:18,054 INFO L290 TraceCheckUtils]: 16: Hoare triple {1197#(<= ~counter~0 1)} assume true; {1197#(<= ~counter~0 1)} is VALID [2022-04-27 13:45:18,055 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1197#(<= ~counter~0 1)} {1197#(<= ~counter~0 1)} #80#return; {1197#(<= ~counter~0 1)} is VALID [2022-04-27 13:45:18,055 INFO L272 TraceCheckUtils]: 18: Hoare triple {1197#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {1197#(<= ~counter~0 1)} is VALID [2022-04-27 13:45:18,055 INFO L290 TraceCheckUtils]: 19: Hoare triple {1197#(<= ~counter~0 1)} ~cond := #in~cond; {1197#(<= ~counter~0 1)} is VALID [2022-04-27 13:45:18,056 INFO L290 TraceCheckUtils]: 20: Hoare triple {1197#(<= ~counter~0 1)} assume !(0 == ~cond); {1197#(<= ~counter~0 1)} is VALID [2022-04-27 13:45:18,057 INFO L290 TraceCheckUtils]: 21: Hoare triple {1197#(<= ~counter~0 1)} assume true; {1197#(<= ~counter~0 1)} is VALID [2022-04-27 13:45:18,058 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1197#(<= ~counter~0 1)} {1197#(<= ~counter~0 1)} #82#return; {1197#(<= ~counter~0 1)} is VALID [2022-04-27 13:45:18,058 INFO L290 TraceCheckUtils]: 23: Hoare triple {1197#(<= ~counter~0 1)} assume !(~r~0 >= ~d~0); {1197#(<= ~counter~0 1)} is VALID [2022-04-27 13:45:18,060 INFO L290 TraceCheckUtils]: 24: Hoare triple {1197#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1252#(<= |main_#t~post6| 1)} is VALID [2022-04-27 13:45:18,061 INFO L290 TraceCheckUtils]: 25: Hoare triple {1252#(<= |main_#t~post6| 1)} assume !(#t~post6 < 2);havoc #t~post6; {1174#false} is VALID [2022-04-27 13:45:18,070 INFO L272 TraceCheckUtils]: 26: Hoare triple {1174#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {1174#false} is VALID [2022-04-27 13:45:18,071 INFO L290 TraceCheckUtils]: 27: Hoare triple {1174#false} ~cond := #in~cond; {1174#false} is VALID [2022-04-27 13:45:18,071 INFO L290 TraceCheckUtils]: 28: Hoare triple {1174#false} assume 0 == ~cond; {1174#false} is VALID [2022-04-27 13:45:18,071 INFO L290 TraceCheckUtils]: 29: Hoare triple {1174#false} assume !false; {1174#false} is VALID [2022-04-27 13:45:18,071 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-27 13:45:18,072 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 13:45:18,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:45:18,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544969018] [2022-04-27 13:45:18,072 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:45:18,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [527739307] [2022-04-27 13:45:18,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [527739307] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:45:18,072 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:45:18,072 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 13:45:18,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298547919] [2022-04-27 13:45:18,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:45:18,073 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 30 [2022-04-27 13:45:18,073 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:45:18,073 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 13:45:18,088 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:45:18,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 13:45:18,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:45:18,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 13:45:18,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-27 13:45:18,089 INFO L87 Difference]: Start difference. First operand 50 states and 64 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 13:45:18,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:45:18,169 INFO L93 Difference]: Finished difference Result 70 states and 80 transitions. [2022-04-27 13:45:18,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 13:45:18,169 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 30 [2022-04-27 13:45:18,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:45:18,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 13:45:18,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2022-04-27 13:45:18,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 13:45:18,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2022-04-27 13:45:18,175 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 59 transitions. [2022-04-27 13:45:18,207 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:45:18,209 INFO L225 Difference]: With dead ends: 70 [2022-04-27 13:45:18,210 INFO L226 Difference]: Without dead ends: 63 [2022-04-27 13:45:18,210 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-27 13:45:18,213 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 3 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 13:45:18,213 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 105 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 13:45:18,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-04-27 13:45:18,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2022-04-27 13:45:18,232 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:45:18,232 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand has 62 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 40 states have internal predecessors, (45), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 13:45:18,232 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand has 62 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 40 states have internal predecessors, (45), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 13:45:18,233 INFO L87 Difference]: Start difference. First operand 63 states. Second operand has 62 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 40 states have internal predecessors, (45), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 13:45:18,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:45:18,235 INFO L93 Difference]: Finished difference Result 63 states and 73 transitions. [2022-04-27 13:45:18,235 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 73 transitions. [2022-04-27 13:45:18,236 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:45:18,236 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:45:18,237 INFO L74 IsIncluded]: Start isIncluded. First operand has 62 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 40 states have internal predecessors, (45), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 63 states. [2022-04-27 13:45:18,237 INFO L87 Difference]: Start difference. First operand has 62 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 40 states have internal predecessors, (45), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 63 states. [2022-04-27 13:45:18,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:45:18,239 INFO L93 Difference]: Finished difference Result 63 states and 73 transitions. [2022-04-27 13:45:18,239 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 73 transitions. [2022-04-27 13:45:18,240 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:45:18,240 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:45:18,240 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:45:18,240 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:45:18,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 40 states have internal predecessors, (45), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 13:45:18,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 72 transitions. [2022-04-27 13:45:18,243 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 72 transitions. Word has length 30 [2022-04-27 13:45:18,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:45:18,243 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 72 transitions. [2022-04-27 13:45:18,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 13:45:18,243 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 72 transitions. [2022-04-27 13:45:18,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-27 13:45:18,244 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:45:18,244 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:45:18,264 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-27 13:45:18,459 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,SelfDestructingSolverStorable5 [2022-04-27 13:45:18,460 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:45:18,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:45:18,460 INFO L85 PathProgramCache]: Analyzing trace with hash 216379368, now seen corresponding path program 1 times [2022-04-27 13:45:18,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:45:18,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147103933] [2022-04-27 13:45:18,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:45:18,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:45:18,471 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:45:18,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1905433869] [2022-04-27 13:45:18,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:45:18,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:45:18,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:45:18,473 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 13:45:18,500 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-27 13:45:18,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:45:18,534 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 13:45:18,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:45:18,540 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:45:21,247 INFO L272 TraceCheckUtils]: 0: Hoare triple {1580#true} call ULTIMATE.init(); {1580#true} is VALID [2022-04-27 13:45:21,247 INFO L290 TraceCheckUtils]: 1: Hoare triple {1580#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1580#true} is VALID [2022-04-27 13:45:21,247 INFO L290 TraceCheckUtils]: 2: Hoare triple {1580#true} assume true; {1580#true} is VALID [2022-04-27 13:45:21,247 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1580#true} {1580#true} #92#return; {1580#true} is VALID [2022-04-27 13:45:21,247 INFO L272 TraceCheckUtils]: 4: Hoare triple {1580#true} call #t~ret7 := main(); {1580#true} is VALID [2022-04-27 13:45:21,248 INFO L290 TraceCheckUtils]: 5: Hoare triple {1580#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {1600#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 13:45:21,248 INFO L290 TraceCheckUtils]: 6: Hoare triple {1600#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1600#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 13:45:21,248 INFO L290 TraceCheckUtils]: 7: Hoare triple {1600#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post5 < 2);havoc #t~post5; {1600#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 13:45:21,248 INFO L272 TraceCheckUtils]: 8: Hoare triple {1600#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {1580#true} is VALID [2022-04-27 13:45:21,248 INFO L290 TraceCheckUtils]: 9: Hoare triple {1580#true} ~cond := #in~cond; {1580#true} is VALID [2022-04-27 13:45:21,249 INFO L290 TraceCheckUtils]: 10: Hoare triple {1580#true} assume !(0 == ~cond); {1580#true} is VALID [2022-04-27 13:45:21,249 INFO L290 TraceCheckUtils]: 11: Hoare triple {1580#true} assume true; {1580#true} is VALID [2022-04-27 13:45:21,249 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1580#true} {1600#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} #78#return; {1600#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 13:45:21,249 INFO L272 TraceCheckUtils]: 13: Hoare triple {1600#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {1580#true} is VALID [2022-04-27 13:45:21,249 INFO L290 TraceCheckUtils]: 14: Hoare triple {1580#true} ~cond := #in~cond; {1580#true} is VALID [2022-04-27 13:45:21,249 INFO L290 TraceCheckUtils]: 15: Hoare triple {1580#true} assume !(0 == ~cond); {1580#true} is VALID [2022-04-27 13:45:21,250 INFO L290 TraceCheckUtils]: 16: Hoare triple {1580#true} assume true; {1580#true} is VALID [2022-04-27 13:45:21,250 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1580#true} {1600#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} #80#return; {1600#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 13:45:21,250 INFO L272 TraceCheckUtils]: 18: Hoare triple {1600#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {1580#true} is VALID [2022-04-27 13:45:21,250 INFO L290 TraceCheckUtils]: 19: Hoare triple {1580#true} ~cond := #in~cond; {1580#true} is VALID [2022-04-27 13:45:21,250 INFO L290 TraceCheckUtils]: 20: Hoare triple {1580#true} assume !(0 == ~cond); {1580#true} is VALID [2022-04-27 13:45:21,250 INFO L290 TraceCheckUtils]: 21: Hoare triple {1580#true} assume true; {1580#true} is VALID [2022-04-27 13:45:21,251 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1580#true} {1600#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} #82#return; {1600#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 13:45:21,251 INFO L290 TraceCheckUtils]: 23: Hoare triple {1600#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !(~r~0 >= ~d~0); {1600#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 13:45:21,252 INFO L290 TraceCheckUtils]: 24: Hoare triple {1600#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1600#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 13:45:21,252 INFO L290 TraceCheckUtils]: 25: Hoare triple {1600#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post6 < 2);havoc #t~post6; {1600#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 13:45:21,253 INFO L272 TraceCheckUtils]: 26: Hoare triple {1600#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {1664#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:45:21,253 INFO L290 TraceCheckUtils]: 27: Hoare triple {1664#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1668#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:45:21,254 INFO L290 TraceCheckUtils]: 28: Hoare triple {1668#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1581#false} is VALID [2022-04-27 13:45:21,254 INFO L290 TraceCheckUtils]: 29: Hoare triple {1581#false} assume !false; {1581#false} is VALID [2022-04-27 13:45:21,254 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-27 13:45:21,254 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 13:45:21,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:45:21,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147103933] [2022-04-27 13:45:21,254 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:45:21,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1905433869] [2022-04-27 13:45:21,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1905433869] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:45:21,254 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:45:21,255 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 13:45:21,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811249540] [2022-04-27 13:45:21,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:45:21,255 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 30 [2022-04-27 13:45:21,255 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:45:21,255 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 13:45:21,273 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:45:21,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 13:45:21,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:45:21,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 13:45:21,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 13:45:21,274 INFO L87 Difference]: Start difference. First operand 62 states and 72 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 13:45:21,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:45:21,411 INFO L93 Difference]: Finished difference Result 76 states and 91 transitions. [2022-04-27 13:45:21,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 13:45:21,412 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 30 [2022-04-27 13:45:21,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:45:21,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 13:45:21,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2022-04-27 13:45:21,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 13:45:21,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2022-04-27 13:45:21,414 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 55 transitions. [2022-04-27 13:45:21,448 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:45:21,450 INFO L225 Difference]: With dead ends: 76 [2022-04-27 13:45:21,450 INFO L226 Difference]: Without dead ends: 64 [2022-04-27 13:45:21,450 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 13:45:21,450 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 11 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 13:45:21,451 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 95 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 13:45:21,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-04-27 13:45:21,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2022-04-27 13:45:21,463 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:45:21,464 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand has 63 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 41 states have internal predecessors, (48), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 13:45:21,464 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand has 63 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 41 states have internal predecessors, (48), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 13:45:21,464 INFO L87 Difference]: Start difference. First operand 64 states. Second operand has 63 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 41 states have internal predecessors, (48), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 13:45:21,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:45:21,466 INFO L93 Difference]: Finished difference Result 64 states and 77 transitions. [2022-04-27 13:45:21,466 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 77 transitions. [2022-04-27 13:45:21,466 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:45:21,466 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:45:21,466 INFO L74 IsIncluded]: Start isIncluded. First operand has 63 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 41 states have internal predecessors, (48), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 64 states. [2022-04-27 13:45:21,466 INFO L87 Difference]: Start difference. First operand has 63 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 41 states have internal predecessors, (48), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 64 states. [2022-04-27 13:45:21,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:45:21,468 INFO L93 Difference]: Finished difference Result 64 states and 77 transitions. [2022-04-27 13:45:21,468 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 77 transitions. [2022-04-27 13:45:21,468 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:45:21,468 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:45:21,468 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:45:21,469 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:45:21,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 41 states have internal predecessors, (48), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 13:45:21,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 76 transitions. [2022-04-27 13:45:21,470 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 76 transitions. Word has length 30 [2022-04-27 13:45:21,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:45:21,470 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 76 transitions. [2022-04-27 13:45:21,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 13:45:21,471 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 76 transitions. [2022-04-27 13:45:21,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-27 13:45:21,471 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:45:21,471 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:45:21,491 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-04-27 13:45:21,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:45:21,688 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:45:21,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:45:21,688 INFO L85 PathProgramCache]: Analyzing trace with hash -1255015940, now seen corresponding path program 1 times [2022-04-27 13:45:21,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:45:21,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114277879] [2022-04-27 13:45:21,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:45:21,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:45:21,700 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:45:21,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2137407600] [2022-04-27 13:45:21,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:45:21,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:45:21,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:45:21,701 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 13:45:21,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-27 13:45:21,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:45:21,736 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 13:45:21,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:45:21,752 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:45:21,887 INFO L272 TraceCheckUtils]: 0: Hoare triple {2000#true} call ULTIMATE.init(); {2000#true} is VALID [2022-04-27 13:45:21,888 INFO L290 TraceCheckUtils]: 1: Hoare triple {2000#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2008#(<= ~counter~0 0)} is VALID [2022-04-27 13:45:21,888 INFO L290 TraceCheckUtils]: 2: Hoare triple {2008#(<= ~counter~0 0)} assume true; {2008#(<= ~counter~0 0)} is VALID [2022-04-27 13:45:21,889 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2008#(<= ~counter~0 0)} {2000#true} #92#return; {2008#(<= ~counter~0 0)} is VALID [2022-04-27 13:45:21,889 INFO L272 TraceCheckUtils]: 4: Hoare triple {2008#(<= ~counter~0 0)} call #t~ret7 := main(); {2008#(<= ~counter~0 0)} is VALID [2022-04-27 13:45:21,889 INFO L290 TraceCheckUtils]: 5: Hoare triple {2008#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {2008#(<= ~counter~0 0)} is VALID [2022-04-27 13:45:21,890 INFO L290 TraceCheckUtils]: 6: Hoare triple {2008#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2024#(<= ~counter~0 1)} is VALID [2022-04-27 13:45:21,890 INFO L290 TraceCheckUtils]: 7: Hoare triple {2024#(<= ~counter~0 1)} assume !!(#t~post5 < 2);havoc #t~post5; {2024#(<= ~counter~0 1)} is VALID [2022-04-27 13:45:21,890 INFO L272 TraceCheckUtils]: 8: Hoare triple {2024#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {2024#(<= ~counter~0 1)} is VALID [2022-04-27 13:45:21,891 INFO L290 TraceCheckUtils]: 9: Hoare triple {2024#(<= ~counter~0 1)} ~cond := #in~cond; {2024#(<= ~counter~0 1)} is VALID [2022-04-27 13:45:21,891 INFO L290 TraceCheckUtils]: 10: Hoare triple {2024#(<= ~counter~0 1)} assume !(0 == ~cond); {2024#(<= ~counter~0 1)} is VALID [2022-04-27 13:45:21,891 INFO L290 TraceCheckUtils]: 11: Hoare triple {2024#(<= ~counter~0 1)} assume true; {2024#(<= ~counter~0 1)} is VALID [2022-04-27 13:45:21,892 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2024#(<= ~counter~0 1)} {2024#(<= ~counter~0 1)} #78#return; {2024#(<= ~counter~0 1)} is VALID [2022-04-27 13:45:21,892 INFO L272 TraceCheckUtils]: 13: Hoare triple {2024#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {2024#(<= ~counter~0 1)} is VALID [2022-04-27 13:45:21,893 INFO L290 TraceCheckUtils]: 14: Hoare triple {2024#(<= ~counter~0 1)} ~cond := #in~cond; {2024#(<= ~counter~0 1)} is VALID [2022-04-27 13:45:21,894 INFO L290 TraceCheckUtils]: 15: Hoare triple {2024#(<= ~counter~0 1)} assume !(0 == ~cond); {2024#(<= ~counter~0 1)} is VALID [2022-04-27 13:45:21,894 INFO L290 TraceCheckUtils]: 16: Hoare triple {2024#(<= ~counter~0 1)} assume true; {2024#(<= ~counter~0 1)} is VALID [2022-04-27 13:45:21,895 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2024#(<= ~counter~0 1)} {2024#(<= ~counter~0 1)} #80#return; {2024#(<= ~counter~0 1)} is VALID [2022-04-27 13:45:21,895 INFO L272 TraceCheckUtils]: 18: Hoare triple {2024#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {2024#(<= ~counter~0 1)} is VALID [2022-04-27 13:45:21,895 INFO L290 TraceCheckUtils]: 19: Hoare triple {2024#(<= ~counter~0 1)} ~cond := #in~cond; {2024#(<= ~counter~0 1)} is VALID [2022-04-27 13:45:21,896 INFO L290 TraceCheckUtils]: 20: Hoare triple {2024#(<= ~counter~0 1)} assume !(0 == ~cond); {2024#(<= ~counter~0 1)} is VALID [2022-04-27 13:45:21,896 INFO L290 TraceCheckUtils]: 21: Hoare triple {2024#(<= ~counter~0 1)} assume true; {2024#(<= ~counter~0 1)} is VALID [2022-04-27 13:45:21,896 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2024#(<= ~counter~0 1)} {2024#(<= ~counter~0 1)} #82#return; {2024#(<= ~counter~0 1)} is VALID [2022-04-27 13:45:21,897 INFO L290 TraceCheckUtils]: 23: Hoare triple {2024#(<= ~counter~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {2024#(<= ~counter~0 1)} is VALID [2022-04-27 13:45:21,897 INFO L290 TraceCheckUtils]: 24: Hoare triple {2024#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2079#(<= |main_#t~post5| 1)} is VALID [2022-04-27 13:45:21,898 INFO L290 TraceCheckUtils]: 25: Hoare triple {2079#(<= |main_#t~post5| 1)} assume !(#t~post5 < 2);havoc #t~post5; {2001#false} is VALID [2022-04-27 13:45:21,898 INFO L290 TraceCheckUtils]: 26: Hoare triple {2001#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2001#false} is VALID [2022-04-27 13:45:21,898 INFO L290 TraceCheckUtils]: 27: Hoare triple {2001#false} assume !(#t~post6 < 2);havoc #t~post6; {2001#false} is VALID [2022-04-27 13:45:21,898 INFO L272 TraceCheckUtils]: 28: Hoare triple {2001#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {2001#false} is VALID [2022-04-27 13:45:21,898 INFO L290 TraceCheckUtils]: 29: Hoare triple {2001#false} ~cond := #in~cond; {2001#false} is VALID [2022-04-27 13:45:21,899 INFO L290 TraceCheckUtils]: 30: Hoare triple {2001#false} assume !(0 == ~cond); {2001#false} is VALID [2022-04-27 13:45:21,899 INFO L290 TraceCheckUtils]: 31: Hoare triple {2001#false} assume true; {2001#false} is VALID [2022-04-27 13:45:21,899 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2001#false} {2001#false} #88#return; {2001#false} is VALID [2022-04-27 13:45:21,899 INFO L272 TraceCheckUtils]: 33: Hoare triple {2001#false} call __VERIFIER_assert((if ~B~0 == ~d~0 then 1 else 0)); {2001#false} is VALID [2022-04-27 13:45:21,899 INFO L290 TraceCheckUtils]: 34: Hoare triple {2001#false} ~cond := #in~cond; {2001#false} is VALID [2022-04-27 13:45:21,899 INFO L290 TraceCheckUtils]: 35: Hoare triple {2001#false} assume 0 == ~cond; {2001#false} is VALID [2022-04-27 13:45:21,899 INFO L290 TraceCheckUtils]: 36: Hoare triple {2001#false} assume !false; {2001#false} is VALID [2022-04-27 13:45:21,924 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-04-27 13:45:21,924 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:45:22,118 INFO L290 TraceCheckUtils]: 36: Hoare triple {2001#false} assume !false; {2001#false} is VALID [2022-04-27 13:45:22,119 INFO L290 TraceCheckUtils]: 35: Hoare triple {2001#false} assume 0 == ~cond; {2001#false} is VALID [2022-04-27 13:45:22,119 INFO L290 TraceCheckUtils]: 34: Hoare triple {2001#false} ~cond := #in~cond; {2001#false} is VALID [2022-04-27 13:45:22,119 INFO L272 TraceCheckUtils]: 33: Hoare triple {2001#false} call __VERIFIER_assert((if ~B~0 == ~d~0 then 1 else 0)); {2001#false} is VALID [2022-04-27 13:45:22,119 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2000#true} {2001#false} #88#return; {2001#false} is VALID [2022-04-27 13:45:22,119 INFO L290 TraceCheckUtils]: 31: Hoare triple {2000#true} assume true; {2000#true} is VALID [2022-04-27 13:45:22,119 INFO L290 TraceCheckUtils]: 30: Hoare triple {2000#true} assume !(0 == ~cond); {2000#true} is VALID [2022-04-27 13:45:22,119 INFO L290 TraceCheckUtils]: 29: Hoare triple {2000#true} ~cond := #in~cond; {2000#true} is VALID [2022-04-27 13:45:22,119 INFO L272 TraceCheckUtils]: 28: Hoare triple {2001#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {2000#true} is VALID [2022-04-27 13:45:22,119 INFO L290 TraceCheckUtils]: 27: Hoare triple {2001#false} assume !(#t~post6 < 2);havoc #t~post6; {2001#false} is VALID [2022-04-27 13:45:22,119 INFO L290 TraceCheckUtils]: 26: Hoare triple {2001#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2001#false} is VALID [2022-04-27 13:45:22,123 INFO L290 TraceCheckUtils]: 25: Hoare triple {2079#(<= |main_#t~post5| 1)} assume !(#t~post5 < 2);havoc #t~post5; {2001#false} is VALID [2022-04-27 13:45:22,124 INFO L290 TraceCheckUtils]: 24: Hoare triple {2024#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2079#(<= |main_#t~post5| 1)} is VALID [2022-04-27 13:45:22,124 INFO L290 TraceCheckUtils]: 23: Hoare triple {2024#(<= ~counter~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {2024#(<= ~counter~0 1)} is VALID [2022-04-27 13:45:22,125 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2000#true} {2024#(<= ~counter~0 1)} #82#return; {2024#(<= ~counter~0 1)} is VALID [2022-04-27 13:45:22,125 INFO L290 TraceCheckUtils]: 21: Hoare triple {2000#true} assume true; {2000#true} is VALID [2022-04-27 13:45:22,125 INFO L290 TraceCheckUtils]: 20: Hoare triple {2000#true} assume !(0 == ~cond); {2000#true} is VALID [2022-04-27 13:45:22,125 INFO L290 TraceCheckUtils]: 19: Hoare triple {2000#true} ~cond := #in~cond; {2000#true} is VALID [2022-04-27 13:45:22,125 INFO L272 TraceCheckUtils]: 18: Hoare triple {2024#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {2000#true} is VALID [2022-04-27 13:45:22,126 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2000#true} {2024#(<= ~counter~0 1)} #80#return; {2024#(<= ~counter~0 1)} is VALID [2022-04-27 13:45:22,126 INFO L290 TraceCheckUtils]: 16: Hoare triple {2000#true} assume true; {2000#true} is VALID [2022-04-27 13:45:22,126 INFO L290 TraceCheckUtils]: 15: Hoare triple {2000#true} assume !(0 == ~cond); {2000#true} is VALID [2022-04-27 13:45:22,126 INFO L290 TraceCheckUtils]: 14: Hoare triple {2000#true} ~cond := #in~cond; {2000#true} is VALID [2022-04-27 13:45:22,126 INFO L272 TraceCheckUtils]: 13: Hoare triple {2024#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {2000#true} is VALID [2022-04-27 13:45:22,126 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2000#true} {2024#(<= ~counter~0 1)} #78#return; {2024#(<= ~counter~0 1)} is VALID [2022-04-27 13:45:22,126 INFO L290 TraceCheckUtils]: 11: Hoare triple {2000#true} assume true; {2000#true} is VALID [2022-04-27 13:45:22,126 INFO L290 TraceCheckUtils]: 10: Hoare triple {2000#true} assume !(0 == ~cond); {2000#true} is VALID [2022-04-27 13:45:22,127 INFO L290 TraceCheckUtils]: 9: Hoare triple {2000#true} ~cond := #in~cond; {2000#true} is VALID [2022-04-27 13:45:22,127 INFO L272 TraceCheckUtils]: 8: Hoare triple {2024#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {2000#true} is VALID [2022-04-27 13:45:22,127 INFO L290 TraceCheckUtils]: 7: Hoare triple {2024#(<= ~counter~0 1)} assume !!(#t~post5 < 2);havoc #t~post5; {2024#(<= ~counter~0 1)} is VALID [2022-04-27 13:45:22,127 INFO L290 TraceCheckUtils]: 6: Hoare triple {2008#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2024#(<= ~counter~0 1)} is VALID [2022-04-27 13:45:22,128 INFO L290 TraceCheckUtils]: 5: Hoare triple {2008#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {2008#(<= ~counter~0 0)} is VALID [2022-04-27 13:45:22,129 INFO L272 TraceCheckUtils]: 4: Hoare triple {2008#(<= ~counter~0 0)} call #t~ret7 := main(); {2008#(<= ~counter~0 0)} is VALID [2022-04-27 13:45:22,129 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2008#(<= ~counter~0 0)} {2000#true} #92#return; {2008#(<= ~counter~0 0)} is VALID [2022-04-27 13:45:22,129 INFO L290 TraceCheckUtils]: 2: Hoare triple {2008#(<= ~counter~0 0)} assume true; {2008#(<= ~counter~0 0)} is VALID [2022-04-27 13:45:22,130 INFO L290 TraceCheckUtils]: 1: Hoare triple {2000#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2008#(<= ~counter~0 0)} is VALID [2022-04-27 13:45:22,130 INFO L272 TraceCheckUtils]: 0: Hoare triple {2000#true} call ULTIMATE.init(); {2000#true} is VALID [2022-04-27 13:45:22,130 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-27 13:45:22,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:45:22,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114277879] [2022-04-27 13:45:22,130 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:45:22,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2137407600] [2022-04-27 13:45:22,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2137407600] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:45:22,130 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:45:22,130 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2022-04-27 13:45:22,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249812645] [2022-04-27 13:45:22,131 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:45:22,131 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 4 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 37 [2022-04-27 13:45:22,132 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:45:22,132 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 4 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-27 13:45:22,168 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:45:22,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 13:45:22,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:45:22,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 13:45:22,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-27 13:45:22,169 INFO L87 Difference]: Start difference. First operand 63 states and 76 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 4 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-27 13:45:22,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:45:22,257 INFO L93 Difference]: Finished difference Result 90 states and 114 transitions. [2022-04-27 13:45:22,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 13:45:22,257 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 4 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 37 [2022-04-27 13:45:22,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:45:22,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 4 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-27 13:45:22,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 70 transitions. [2022-04-27 13:45:22,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 4 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-27 13:45:22,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 70 transitions. [2022-04-27 13:45:22,260 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 70 transitions. [2022-04-27 13:45:22,305 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:45:22,307 INFO L225 Difference]: With dead ends: 90 [2022-04-27 13:45:22,307 INFO L226 Difference]: Without dead ends: 65 [2022-04-27 13:45:22,307 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-27 13:45:22,308 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 2 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 13:45:22,308 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 105 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 13:45:22,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-04-27 13:45:22,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-04-27 13:45:22,322 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:45:22,323 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand has 65 states, 41 states have (on average 1.2195121951219512) internal successors, (50), 43 states have internal predecessors, (50), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 13:45:22,323 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand has 65 states, 41 states have (on average 1.2195121951219512) internal successors, (50), 43 states have internal predecessors, (50), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 13:45:22,323 INFO L87 Difference]: Start difference. First operand 65 states. Second operand has 65 states, 41 states have (on average 1.2195121951219512) internal successors, (50), 43 states have internal predecessors, (50), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 13:45:22,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:45:22,325 INFO L93 Difference]: Finished difference Result 65 states and 78 transitions. [2022-04-27 13:45:22,325 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 78 transitions. [2022-04-27 13:45:22,325 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:45:22,325 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:45:22,325 INFO L74 IsIncluded]: Start isIncluded. First operand has 65 states, 41 states have (on average 1.2195121951219512) internal successors, (50), 43 states have internal predecessors, (50), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 65 states. [2022-04-27 13:45:22,326 INFO L87 Difference]: Start difference. First operand has 65 states, 41 states have (on average 1.2195121951219512) internal successors, (50), 43 states have internal predecessors, (50), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 65 states. [2022-04-27 13:45:22,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:45:22,327 INFO L93 Difference]: Finished difference Result 65 states and 78 transitions. [2022-04-27 13:45:22,327 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 78 transitions. [2022-04-27 13:45:22,327 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:45:22,327 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:45:22,328 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:45:22,328 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:45:22,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 41 states have (on average 1.2195121951219512) internal successors, (50), 43 states have internal predecessors, (50), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 13:45:22,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 78 transitions. [2022-04-27 13:45:22,329 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 78 transitions. Word has length 37 [2022-04-27 13:45:22,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:45:22,329 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 78 transitions. [2022-04-27 13:45:22,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 4 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-27 13:45:22,330 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 78 transitions. [2022-04-27 13:45:22,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-27 13:45:22,330 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:45:22,330 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:45:22,351 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-27 13:45:22,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:45:22,549 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:45:22,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:45:22,550 INFO L85 PathProgramCache]: Analyzing trace with hash -1057559728, now seen corresponding path program 1 times [2022-04-27 13:45:22,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:45:22,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779533305] [2022-04-27 13:45:22,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:45:22,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:45:22,559 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:45:22,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [564431423] [2022-04-27 13:45:22,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:45:22,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:45:22,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:45:22,560 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 13:45:22,561 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-27 13:45:22,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:45:22,595 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-27 13:45:22,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:45:22,606 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:45:22,779 INFO L272 TraceCheckUtils]: 0: Hoare triple {2576#true} call ULTIMATE.init(); {2576#true} is VALID [2022-04-27 13:45:22,779 INFO L290 TraceCheckUtils]: 1: Hoare triple {2576#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2576#true} is VALID [2022-04-27 13:45:22,779 INFO L290 TraceCheckUtils]: 2: Hoare triple {2576#true} assume true; {2576#true} is VALID [2022-04-27 13:45:22,779 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2576#true} {2576#true} #92#return; {2576#true} is VALID [2022-04-27 13:45:22,779 INFO L272 TraceCheckUtils]: 4: Hoare triple {2576#true} call #t~ret7 := main(); {2576#true} is VALID [2022-04-27 13:45:22,780 INFO L290 TraceCheckUtils]: 5: Hoare triple {2576#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {2596#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:45:22,780 INFO L290 TraceCheckUtils]: 6: Hoare triple {2596#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2596#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:45:22,781 INFO L290 TraceCheckUtils]: 7: Hoare triple {2596#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} assume !!(#t~post5 < 2);havoc #t~post5; {2596#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:45:22,781 INFO L272 TraceCheckUtils]: 8: Hoare triple {2596#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {2576#true} is VALID [2022-04-27 13:45:22,781 INFO L290 TraceCheckUtils]: 9: Hoare triple {2576#true} ~cond := #in~cond; {2576#true} is VALID [2022-04-27 13:45:22,781 INFO L290 TraceCheckUtils]: 10: Hoare triple {2576#true} assume !(0 == ~cond); {2576#true} is VALID [2022-04-27 13:45:22,781 INFO L290 TraceCheckUtils]: 11: Hoare triple {2576#true} assume true; {2576#true} is VALID [2022-04-27 13:45:22,782 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2576#true} {2596#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #78#return; {2596#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:45:22,782 INFO L272 TraceCheckUtils]: 13: Hoare triple {2596#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {2576#true} is VALID [2022-04-27 13:45:22,782 INFO L290 TraceCheckUtils]: 14: Hoare triple {2576#true} ~cond := #in~cond; {2576#true} is VALID [2022-04-27 13:45:22,786 INFO L290 TraceCheckUtils]: 15: Hoare triple {2576#true} assume !(0 == ~cond); {2576#true} is VALID [2022-04-27 13:45:22,787 INFO L290 TraceCheckUtils]: 16: Hoare triple {2576#true} assume true; {2576#true} is VALID [2022-04-27 13:45:22,788 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2576#true} {2596#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #80#return; {2596#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:45:22,789 INFO L272 TraceCheckUtils]: 18: Hoare triple {2596#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {2576#true} is VALID [2022-04-27 13:45:22,792 INFO L290 TraceCheckUtils]: 19: Hoare triple {2576#true} ~cond := #in~cond; {2576#true} is VALID [2022-04-27 13:45:22,793 INFO L290 TraceCheckUtils]: 20: Hoare triple {2576#true} assume !(0 == ~cond); {2576#true} is VALID [2022-04-27 13:45:22,794 INFO L290 TraceCheckUtils]: 21: Hoare triple {2576#true} assume true; {2576#true} is VALID [2022-04-27 13:45:22,794 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2576#true} {2596#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #82#return; {2596#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:45:22,795 INFO L290 TraceCheckUtils]: 23: Hoare triple {2596#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {2651#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} is VALID [2022-04-27 13:45:22,795 INFO L290 TraceCheckUtils]: 24: Hoare triple {2651#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2651#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} is VALID [2022-04-27 13:45:22,797 INFO L290 TraceCheckUtils]: 25: Hoare triple {2651#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} assume !!(#t~post5 < 2);havoc #t~post5; {2651#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} is VALID [2022-04-27 13:45:22,797 INFO L272 TraceCheckUtils]: 26: Hoare triple {2651#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {2576#true} is VALID [2022-04-27 13:45:22,797 INFO L290 TraceCheckUtils]: 27: Hoare triple {2576#true} ~cond := #in~cond; {2576#true} is VALID [2022-04-27 13:45:22,799 INFO L290 TraceCheckUtils]: 28: Hoare triple {2576#true} assume !(0 == ~cond); {2576#true} is VALID [2022-04-27 13:45:22,799 INFO L290 TraceCheckUtils]: 29: Hoare triple {2576#true} assume true; {2576#true} is VALID [2022-04-27 13:45:22,800 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {2576#true} {2651#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} #78#return; {2651#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} is VALID [2022-04-27 13:45:22,800 INFO L272 TraceCheckUtils]: 31: Hoare triple {2651#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {2576#true} is VALID [2022-04-27 13:45:22,800 INFO L290 TraceCheckUtils]: 32: Hoare triple {2576#true} ~cond := #in~cond; {2576#true} is VALID [2022-04-27 13:45:22,800 INFO L290 TraceCheckUtils]: 33: Hoare triple {2576#true} assume !(0 == ~cond); {2576#true} is VALID [2022-04-27 13:45:22,800 INFO L290 TraceCheckUtils]: 34: Hoare triple {2576#true} assume true; {2576#true} is VALID [2022-04-27 13:45:22,801 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {2576#true} {2651#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} #80#return; {2651#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} is VALID [2022-04-27 13:45:22,801 INFO L272 TraceCheckUtils]: 36: Hoare triple {2651#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {2691#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:45:22,802 INFO L290 TraceCheckUtils]: 37: Hoare triple {2691#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2695#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:45:22,802 INFO L290 TraceCheckUtils]: 38: Hoare triple {2695#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2577#false} is VALID [2022-04-27 13:45:22,802 INFO L290 TraceCheckUtils]: 39: Hoare triple {2577#false} assume !false; {2577#false} is VALID [2022-04-27 13:45:22,802 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-27 13:45:22,802 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:45:22,950 INFO L290 TraceCheckUtils]: 39: Hoare triple {2577#false} assume !false; {2577#false} is VALID [2022-04-27 13:45:22,951 INFO L290 TraceCheckUtils]: 38: Hoare triple {2695#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2577#false} is VALID [2022-04-27 13:45:22,951 INFO L290 TraceCheckUtils]: 37: Hoare triple {2691#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2695#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:45:22,952 INFO L272 TraceCheckUtils]: 36: Hoare triple {2711#(= (* main_~B~0 main_~p~0) main_~d~0)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {2691#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:45:22,952 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {2576#true} {2711#(= (* main_~B~0 main_~p~0) main_~d~0)} #80#return; {2711#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-27 13:45:22,952 INFO L290 TraceCheckUtils]: 34: Hoare triple {2576#true} assume true; {2576#true} is VALID [2022-04-27 13:45:22,952 INFO L290 TraceCheckUtils]: 33: Hoare triple {2576#true} assume !(0 == ~cond); {2576#true} is VALID [2022-04-27 13:45:22,952 INFO L290 TraceCheckUtils]: 32: Hoare triple {2576#true} ~cond := #in~cond; {2576#true} is VALID [2022-04-27 13:45:22,953 INFO L272 TraceCheckUtils]: 31: Hoare triple {2711#(= (* main_~B~0 main_~p~0) main_~d~0)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {2576#true} is VALID [2022-04-27 13:45:22,953 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {2576#true} {2711#(= (* main_~B~0 main_~p~0) main_~d~0)} #78#return; {2711#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-27 13:45:22,953 INFO L290 TraceCheckUtils]: 29: Hoare triple {2576#true} assume true; {2576#true} is VALID [2022-04-27 13:45:22,953 INFO L290 TraceCheckUtils]: 28: Hoare triple {2576#true} assume !(0 == ~cond); {2576#true} is VALID [2022-04-27 13:45:22,953 INFO L290 TraceCheckUtils]: 27: Hoare triple {2576#true} ~cond := #in~cond; {2576#true} is VALID [2022-04-27 13:45:22,953 INFO L272 TraceCheckUtils]: 26: Hoare triple {2711#(= (* main_~B~0 main_~p~0) main_~d~0)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {2576#true} is VALID [2022-04-27 13:45:22,954 INFO L290 TraceCheckUtils]: 25: Hoare triple {2711#(= (* main_~B~0 main_~p~0) main_~d~0)} assume !!(#t~post5 < 2);havoc #t~post5; {2711#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-27 13:45:22,954 INFO L290 TraceCheckUtils]: 24: Hoare triple {2711#(= (* main_~B~0 main_~p~0) main_~d~0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2711#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-27 13:45:22,961 INFO L290 TraceCheckUtils]: 23: Hoare triple {2711#(= (* main_~B~0 main_~p~0) main_~d~0)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {2711#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-27 13:45:22,961 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2576#true} {2711#(= (* main_~B~0 main_~p~0) main_~d~0)} #82#return; {2711#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-27 13:45:22,961 INFO L290 TraceCheckUtils]: 21: Hoare triple {2576#true} assume true; {2576#true} is VALID [2022-04-27 13:45:22,962 INFO L290 TraceCheckUtils]: 20: Hoare triple {2576#true} assume !(0 == ~cond); {2576#true} is VALID [2022-04-27 13:45:22,962 INFO L290 TraceCheckUtils]: 19: Hoare triple {2576#true} ~cond := #in~cond; {2576#true} is VALID [2022-04-27 13:45:22,962 INFO L272 TraceCheckUtils]: 18: Hoare triple {2711#(= (* main_~B~0 main_~p~0) main_~d~0)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {2576#true} is VALID [2022-04-27 13:45:22,962 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2576#true} {2711#(= (* main_~B~0 main_~p~0) main_~d~0)} #80#return; {2711#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-27 13:45:22,962 INFO L290 TraceCheckUtils]: 16: Hoare triple {2576#true} assume true; {2576#true} is VALID [2022-04-27 13:45:22,962 INFO L290 TraceCheckUtils]: 15: Hoare triple {2576#true} assume !(0 == ~cond); {2576#true} is VALID [2022-04-27 13:45:22,962 INFO L290 TraceCheckUtils]: 14: Hoare triple {2576#true} ~cond := #in~cond; {2576#true} is VALID [2022-04-27 13:45:22,962 INFO L272 TraceCheckUtils]: 13: Hoare triple {2711#(= (* main_~B~0 main_~p~0) main_~d~0)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {2576#true} is VALID [2022-04-27 13:45:22,963 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2576#true} {2711#(= (* main_~B~0 main_~p~0) main_~d~0)} #78#return; {2711#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-27 13:45:22,963 INFO L290 TraceCheckUtils]: 11: Hoare triple {2576#true} assume true; {2576#true} is VALID [2022-04-27 13:45:22,963 INFO L290 TraceCheckUtils]: 10: Hoare triple {2576#true} assume !(0 == ~cond); {2576#true} is VALID [2022-04-27 13:45:22,963 INFO L290 TraceCheckUtils]: 9: Hoare triple {2576#true} ~cond := #in~cond; {2576#true} is VALID [2022-04-27 13:45:22,963 INFO L272 TraceCheckUtils]: 8: Hoare triple {2711#(= (* main_~B~0 main_~p~0) main_~d~0)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {2576#true} is VALID [2022-04-27 13:45:22,963 INFO L290 TraceCheckUtils]: 7: Hoare triple {2711#(= (* main_~B~0 main_~p~0) main_~d~0)} assume !!(#t~post5 < 2);havoc #t~post5; {2711#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-27 13:45:22,964 INFO L290 TraceCheckUtils]: 6: Hoare triple {2711#(= (* main_~B~0 main_~p~0) main_~d~0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2711#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-27 13:45:22,964 INFO L290 TraceCheckUtils]: 5: Hoare triple {2576#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {2711#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-27 13:45:22,964 INFO L272 TraceCheckUtils]: 4: Hoare triple {2576#true} call #t~ret7 := main(); {2576#true} is VALID [2022-04-27 13:45:22,964 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2576#true} {2576#true} #92#return; {2576#true} is VALID [2022-04-27 13:45:22,964 INFO L290 TraceCheckUtils]: 2: Hoare triple {2576#true} assume true; {2576#true} is VALID [2022-04-27 13:45:22,965 INFO L290 TraceCheckUtils]: 1: Hoare triple {2576#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2576#true} is VALID [2022-04-27 13:45:22,965 INFO L272 TraceCheckUtils]: 0: Hoare triple {2576#true} call ULTIMATE.init(); {2576#true} is VALID [2022-04-27 13:45:22,967 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-04-27 13:45:22,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:45:22,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779533305] [2022-04-27 13:45:22,967 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:45:22,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [564431423] [2022-04-27 13:45:22,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [564431423] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 13:45:22,967 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 13:45:22,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-27 13:45:22,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960603241] [2022-04-27 13:45:22,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:45:22,968 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 40 [2022-04-27 13:45:22,968 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:45:22,968 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 13:45:22,983 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:45:22,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 13:45:22,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:45:22,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 13:45:22,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-27 13:45:22,984 INFO L87 Difference]: Start difference. First operand 65 states and 78 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 13:45:25,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:45:25,146 INFO L93 Difference]: Finished difference Result 78 states and 95 transitions. [2022-04-27 13:45:25,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 13:45:25,146 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 40 [2022-04-27 13:45:25,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:45:25,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 13:45:25,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2022-04-27 13:45:25,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 13:45:25,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2022-04-27 13:45:25,148 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 53 transitions. [2022-04-27 13:45:25,186 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:45:25,188 INFO L225 Difference]: With dead ends: 78 [2022-04-27 13:45:25,188 INFO L226 Difference]: Without dead ends: 76 [2022-04-27 13:45:25,188 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 72 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-27 13:45:25,188 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 11 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 13:45:25,189 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 103 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 13:45:25,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-04-27 13:45:25,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 73. [2022-04-27 13:45:25,206 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:45:25,207 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand has 73 states, 46 states have (on average 1.2173913043478262) internal successors, (56), 49 states have internal predecessors, (56), 17 states have call successors, (17), 10 states have call predecessors, (17), 9 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-27 13:45:25,207 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand has 73 states, 46 states have (on average 1.2173913043478262) internal successors, (56), 49 states have internal predecessors, (56), 17 states have call successors, (17), 10 states have call predecessors, (17), 9 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-27 13:45:25,207 INFO L87 Difference]: Start difference. First operand 76 states. Second operand has 73 states, 46 states have (on average 1.2173913043478262) internal successors, (56), 49 states have internal predecessors, (56), 17 states have call successors, (17), 10 states have call predecessors, (17), 9 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-27 13:45:25,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:45:25,210 INFO L93 Difference]: Finished difference Result 76 states and 93 transitions. [2022-04-27 13:45:25,210 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 93 transitions. [2022-04-27 13:45:25,210 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:45:25,210 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:45:25,210 INFO L74 IsIncluded]: Start isIncluded. First operand has 73 states, 46 states have (on average 1.2173913043478262) internal successors, (56), 49 states have internal predecessors, (56), 17 states have call successors, (17), 10 states have call predecessors, (17), 9 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) Second operand 76 states. [2022-04-27 13:45:25,210 INFO L87 Difference]: Start difference. First operand has 73 states, 46 states have (on average 1.2173913043478262) internal successors, (56), 49 states have internal predecessors, (56), 17 states have call successors, (17), 10 states have call predecessors, (17), 9 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) Second operand 76 states. [2022-04-27 13:45:25,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:45:25,212 INFO L93 Difference]: Finished difference Result 76 states and 93 transitions. [2022-04-27 13:45:25,212 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 93 transitions. [2022-04-27 13:45:25,212 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:45:25,212 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:45:25,212 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:45:25,212 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:45:25,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 46 states have (on average 1.2173913043478262) internal successors, (56), 49 states have internal predecessors, (56), 17 states have call successors, (17), 10 states have call predecessors, (17), 9 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-27 13:45:25,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 88 transitions. [2022-04-27 13:45:25,213 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 88 transitions. Word has length 40 [2022-04-27 13:45:25,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:45:25,214 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 88 transitions. [2022-04-27 13:45:25,214 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 13:45:25,214 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 88 transitions. [2022-04-27 13:45:25,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-04-27 13:45:25,214 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:45:25,214 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:45:25,233 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-04-27 13:45:25,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:45:25,428 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:45:25,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:45:25,428 INFO L85 PathProgramCache]: Analyzing trace with hash 529029787, now seen corresponding path program 1 times [2022-04-27 13:45:25,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:45:25,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345230996] [2022-04-27 13:45:25,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:45:25,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:45:25,437 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:45:25,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [347584411] [2022-04-27 13:45:25,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:45:25,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:45:25,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:45:25,438 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 13:45:25,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-27 13:45:25,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-27 13:45:25,477 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-27 13:45:25,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-27 13:45:25,514 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-27 13:45:25,514 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-04-27 13:45:25,515 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 13:45:25,535 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-27 13:45:25,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:45:25,730 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:45:25,732 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 13:45:25,754 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 13:45:25,754 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-27 13:45:25,754 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-27 13:45:25,754 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-27 13:45:25,754 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-27 13:45:25,754 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-27 13:45:25,754 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2022-04-27 13:45:25,754 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-27 13:45:25,754 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 13:45:25,754 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-27 13:45:25,754 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-27 13:45:25,754 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-27 13:45:25,754 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-27 13:45:25,754 WARN L170 areAnnotationChecker]: L34-3 has no Hoare annotation [2022-04-27 13:45:25,754 WARN L170 areAnnotationChecker]: L34-3 has no Hoare annotation [2022-04-27 13:45:25,754 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-27 13:45:25,755 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-27 13:45:25,755 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 13:45:25,755 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 13:45:25,755 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2022-04-27 13:45:25,755 WARN L170 areAnnotationChecker]: L52-2 has no Hoare annotation [2022-04-27 13:45:25,755 WARN L170 areAnnotationChecker]: L52-2 has no Hoare annotation [2022-04-27 13:45:25,755 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-04-27 13:45:25,755 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-04-27 13:45:25,755 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-27 13:45:25,755 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-27 13:45:25,755 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2022-04-27 13:45:25,755 WARN L170 areAnnotationChecker]: L44-2 has no Hoare annotation [2022-04-27 13:45:25,755 WARN L170 areAnnotationChecker]: L44-2 has no Hoare annotation [2022-04-27 13:45:25,755 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2022-04-27 13:45:25,755 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2022-04-27 13:45:25,755 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-27 13:45:25,755 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-27 13:45:25,755 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 13:45:25,755 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 13:45:25,755 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 13:45:25,755 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 13:45:25,755 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 13:45:25,755 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 13:45:25,755 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 13:45:25,755 WARN L170 areAnnotationChecker]: L58 has no Hoare annotation [2022-04-27 13:45:25,755 WARN L170 areAnnotationChecker]: L58 has no Hoare annotation [2022-04-27 13:45:25,755 WARN L170 areAnnotationChecker]: L45 has no Hoare annotation [2022-04-27 13:45:25,755 WARN L170 areAnnotationChecker]: L45 has no Hoare annotation [2022-04-27 13:45:25,755 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2022-04-27 13:45:25,755 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2022-04-27 13:45:25,756 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-04-27 13:45:25,756 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-04-27 13:45:25,756 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-27 13:45:25,756 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-27 13:45:25,756 WARN L170 areAnnotationChecker]: L45-1 has no Hoare annotation [2022-04-27 13:45:25,756 WARN L170 areAnnotationChecker]: L45-1 has no Hoare annotation [2022-04-27 13:45:25,756 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2022-04-27 13:45:25,756 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2022-04-27 13:45:25,756 WARN L170 areAnnotationChecker]: L59 has no Hoare annotation [2022-04-27 13:45:25,756 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2022-04-27 13:45:25,756 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2022-04-27 13:45:25,756 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 13:45:25,756 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 13:45:25,756 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 13:45:25,756 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 01:45:25 BoogieIcfgContainer [2022-04-27 13:45:25,757 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 13:45:25,757 INFO L158 Benchmark]: Toolchain (without parser) took 11213.68ms. Allocated memory was 197.1MB in the beginning and 266.3MB in the end (delta: 69.2MB). Free memory was 148.8MB in the beginning and 122.1MB in the end (delta: 26.7MB). Peak memory consumption was 96.1MB. Max. memory is 8.0GB. [2022-04-27 13:45:25,758 INFO L158 Benchmark]: CDTParser took 0.42ms. Allocated memory is still 197.1MB. Free memory is still 165.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 13:45:25,758 INFO L158 Benchmark]: CACSL2BoogieTranslator took 235.49ms. Allocated memory is still 197.1MB. Free memory was 148.6MB in the beginning and 174.2MB in the end (delta: -25.6MB). Peak memory consumption was 10.8MB. Max. memory is 8.0GB. [2022-04-27 13:45:25,758 INFO L158 Benchmark]: Boogie Preprocessor took 39.03ms. Allocated memory is still 197.1MB. Free memory was 174.2MB in the beginning and 172.8MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 13:45:25,758 INFO L158 Benchmark]: RCFGBuilder took 284.55ms. Allocated memory is still 197.1MB. Free memory was 172.8MB in the beginning and 161.2MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-27 13:45:25,758 INFO L158 Benchmark]: TraceAbstraction took 10649.30ms. Allocated memory was 197.1MB in the beginning and 266.3MB in the end (delta: 69.2MB). Free memory was 160.7MB in the beginning and 122.1MB in the end (delta: 38.6MB). Peak memory consumption was 108.3MB. Max. memory is 8.0GB. [2022-04-27 13:45:25,759 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.42ms. Allocated memory is still 197.1MB. Free memory is still 165.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 235.49ms. Allocated memory is still 197.1MB. Free memory was 148.6MB in the beginning and 174.2MB in the end (delta: -25.6MB). Peak memory consumption was 10.8MB. Max. memory is 8.0GB. * Boogie Preprocessor took 39.03ms. Allocated memory is still 197.1MB. Free memory was 174.2MB in the beginning and 172.8MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 284.55ms. Allocated memory is still 197.1MB. Free memory was 172.8MB in the beginning and 161.2MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 10649.30ms. Allocated memory was 197.1MB in the beginning and 266.3MB in the end (delta: 69.2MB). Free memory was 160.7MB in the beginning and 122.1MB in the end (delta: 38.6MB). Peak memory consumption was 108.3MB. Max. memory is 8.0GB. * 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: 17]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L22] int counter = 0; VAL [\old(counter)=4, counter=0] [L24] int A, B; [L25] int r, d, p, q; [L26] A = __VERIFIER_nondet_int() [L27] B = 1 [L29] r = A [L30] d = B [L31] p = 1 [L32] q = 0 VAL [\old(counter)=0, A=1, B=1, counter=0, d=1, p=1, q=0, r=1] [L34] EXPR counter++ VAL [\old(counter)=0, A=1, B=1, counter=1, counter++=0, d=1, p=1, q=0, r=1] [L34] COND TRUE counter++<2 [L35] CALL __VERIFIER_assert(q == 0) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L35] RET __VERIFIER_assert(q == 0) VAL [\old(counter)=0, A=1, B=1, counter=1, d=1, p=1, q=0, r=1] [L36] CALL __VERIFIER_assert(r == A) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L36] RET __VERIFIER_assert(r == A) VAL [\old(counter)=0, A=1, B=1, counter=1, d=1, p=1, q=0, r=1] [L37] CALL __VERIFIER_assert(d == B * p) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L37] RET __VERIFIER_assert(d == B * p) VAL [\old(counter)=0, A=1, B=1, counter=1, d=1, p=1, q=0, r=1] [L38] COND FALSE !(!(r >= d)) [L40] d = 2 * d [L41] p = 2 * p VAL [\old(counter)=0, A=1, B=1, counter=1, d=2, p=2, q=0, r=1] [L34] EXPR counter++ VAL [\old(counter)=0, A=1, B=1, counter=2, counter++=1, d=2, p=2, q=0, r=1] [L34] COND TRUE counter++<2 [L35] CALL __VERIFIER_assert(q == 0) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L35] RET __VERIFIER_assert(q == 0) VAL [\old(counter)=0, A=1, B=1, counter=2, d=2, p=2, q=0, r=1] [L36] CALL __VERIFIER_assert(r == A) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L36] RET __VERIFIER_assert(r == A) VAL [\old(counter)=0, A=1, B=1, counter=2, d=2, p=2, q=0, r=1] [L37] CALL __VERIFIER_assert(d == B * p) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L37] RET __VERIFIER_assert(d == B * p) VAL [\old(counter)=0, A=1, B=1, counter=2, d=2, p=2, q=0, r=1] [L38] COND TRUE !(r >= d) VAL [\old(counter)=0, A=1, B=1, counter=2, d=2, p=2, q=0, r=1] [L44] EXPR counter++ VAL [\old(counter)=0, A=1, B=1, counter=3, counter++=2, d=2, p=2, q=0, r=1] [L44] COND FALSE !(counter++<2) [L58] CALL __VERIFIER_assert(A == d*q + r) VAL [\old(cond)=1, \old(counter)=0, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=3] [L58] RET __VERIFIER_assert(A == d*q + r) VAL [\old(counter)=0, A=1, B=1, counter=3, d=2, p=2, q=0, r=1] [L59] CALL __VERIFIER_assert(B == d) VAL [\old(cond)=0, \old(counter)=0, counter=3] [L15] COND TRUE !(cond) VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=3] [L17] reach_error() VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=3] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 38 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.6s, OverallIterations: 10, TraceHistogramMax: 8, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 113 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 92 mSDsluCounter, 809 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 493 mSDsCounter, 55 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 419 IncrementalHoareTripleChecker+Invalid, 474 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 55 mSolverCounterUnsat, 316 mSDtfsCounter, 419 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 270 GetRequests, 225 SyntacticMatches, 3 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=73occurred in iteration=9, InterpolantAutomatonStates: 51, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 23 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 267 NumberOfCodeBlocks, 267 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 280 ConstructedInterpolants, 0 QuantifiedInterpolants, 742 SizeOfPredicates, 7 NumberOfNonLiveVariables, 565 ConjunctsInSsa, 43 ConjunctsInUnsatCore, 11 InterpolantComputations, 8 PerfectInterpolantSequences, 215/224 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! [2022-04-27 13:45:25,770 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...