/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/sqrt1-ll_unwindbound20.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 14:55:24,709 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 14:55:24,710 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 14:55:24,734 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 14:55:24,734 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 14:55:24,735 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 14:55:24,744 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 14:55:24,745 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 14:55:24,746 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 14:55:24,746 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 14:55:24,747 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 14:55:24,747 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 14:55:24,748 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 14:55:24,748 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 14:55:24,749 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 14:55:24,750 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 14:55:24,750 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 14:55:24,751 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 14:55:24,752 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 14:55:24,753 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 14:55:24,754 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 14:55:24,759 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 14:55:24,761 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 14:55:24,763 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 14:55:24,764 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 14:55:24,770 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 14:55:24,770 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 14:55:24,771 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 14:55:24,772 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 14:55:24,772 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 14:55:24,772 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 14:55:24,773 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 14:55:24,774 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 14:55:24,774 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 14:55:24,774 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 14:55:24,776 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 14:55:24,776 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 14:55:24,777 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 14:55:24,777 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 14:55:24,777 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 14:55:24,777 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 14:55:24,781 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 14:55:24,781 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 14:55:24,806 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 14:55:24,807 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 14:55:24,807 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 14:55:24,807 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 14:55:24,807 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 14:55:24,807 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 14:55:24,808 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 14:55:24,808 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 14:55:24,808 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 14:55:24,809 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 14:55:24,809 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 14:55:24,809 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 14:55:24,809 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 14:55:24,809 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 14:55:24,809 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 14:55:24,809 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 14:55:24,809 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 14:55:24,810 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 14:55:24,810 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 14:55:24,810 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 14:55:24,810 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 14:55:24,810 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 14:55:24,810 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 14:55:24,810 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 14:55:24,811 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 14:55:24,811 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 14:55:24,811 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 14:55:24,811 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 14:55:24,811 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 14:55:24,811 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 14:55:24,811 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 14:55:24,811 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 14:55:24,811 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 14:55:24,811 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 14:55:24,988 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 14:55:25,004 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 14:55:25,006 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 14:55:25,007 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 14:55:25,007 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 14:55:25,008 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/sqrt1-ll_unwindbound20.c [2022-04-27 14:55:25,051 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/117f96a60/568c476284d7443bb673bff640c467c0/FLAG594c4f2fb [2022-04-27 14:55:25,359 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 14:55:25,359 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/sqrt1-ll_unwindbound20.c [2022-04-27 14:55:25,364 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/117f96a60/568c476284d7443bb673bff640c467c0/FLAG594c4f2fb [2022-04-27 14:55:25,805 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/117f96a60/568c476284d7443bb673bff640c467c0 [2022-04-27 14:55:25,806 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 14:55:25,807 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 14:55:25,809 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 14:55:25,809 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 14:55:25,811 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 14:55:25,811 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 02:55:25" (1/1) ... [2022-04-27 14:55:25,812 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4270091b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:55:25, skipping insertion in model container [2022-04-27 14:55:25,812 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 02:55:25" (1/1) ... [2022-04-27 14:55:25,816 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 14:55:25,823 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 14:55:25,940 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/sqrt1-ll_unwindbound20.c[520,533] [2022-04-27 14:55:25,949 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 14:55:25,955 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 14:55:25,962 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/sqrt1-ll_unwindbound20.c[520,533] [2022-04-27 14:55:25,966 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 14:55:25,974 INFO L208 MainTranslator]: Completed translation [2022-04-27 14:55:25,974 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:55:25 WrapperNode [2022-04-27 14:55:25,974 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 14:55:25,975 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 14:55:25,975 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 14:55:25,975 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 14:55:25,981 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:55:25" (1/1) ... [2022-04-27 14:55:25,981 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:55:25" (1/1) ... [2022-04-27 14:55:25,985 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:55:25" (1/1) ... [2022-04-27 14:55:25,985 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:55:25" (1/1) ... [2022-04-27 14:55:25,988 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:55:25" (1/1) ... [2022-04-27 14:55:25,990 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:55:25" (1/1) ... [2022-04-27 14:55:25,991 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:55:25" (1/1) ... [2022-04-27 14:55:25,992 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 14:55:25,993 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 14:55:25,993 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 14:55:25,993 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 14:55:25,993 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:55:25" (1/1) ... [2022-04-27 14:55:25,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 14:55:26,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:55:26,016 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 14:55:26,018 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 14:55:26,046 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 14:55:26,046 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 14:55:26,046 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 14:55:26,046 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 14:55:26,046 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 14:55:26,046 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 14:55:26,046 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 14:55:26,046 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 14:55:26,047 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 14:55:26,047 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 14:55:26,047 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 14:55:26,047 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 14:55:26,047 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 14:55:26,047 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 14:55:26,047 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 14:55:26,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 14:55:26,047 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 14:55:26,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 14:55:26,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 14:55:26,047 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 14:55:26,093 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 14:55:26,094 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 14:55:26,214 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 14:55:26,228 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 14:55:26,228 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 14:55:26,244 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 02:55:26 BoogieIcfgContainer [2022-04-27 14:55:26,244 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 14:55:26,245 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 14:55:26,245 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 14:55:26,248 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 14:55:26,248 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 02:55:25" (1/3) ... [2022-04-27 14:55:26,248 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a6b899 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 02:55:26, skipping insertion in model container [2022-04-27 14:55:26,248 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:55:25" (2/3) ... [2022-04-27 14:55:26,249 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a6b899 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 02:55:26, skipping insertion in model container [2022-04-27 14:55:26,249 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 02:55:26" (3/3) ... [2022-04-27 14:55:26,250 INFO L111 eAbstractionObserver]: Analyzing ICFG sqrt1-ll_unwindbound20.c [2022-04-27 14:55:26,258 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 14:55:26,258 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 14:55:26,315 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 14:55:26,326 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@28e1591d, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@423edfa3 [2022-04-27 14:55:26,326 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 14:55:26,337 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 14:55:26,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-27 14:55:26,342 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:55:26,342 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:55:26,342 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:55:26,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:55:26,346 INFO L85 PathProgramCache]: Analyzing trace with hash -643130361, now seen corresponding path program 1 times [2022-04-27 14:55:26,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:55:26,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862066125] [2022-04-27 14:55:26,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:55:26,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:55:26,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:55:26,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 14:55:26,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:55:26,512 INFO L290 TraceCheckUtils]: 0: Hoare triple {34#(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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {29#true} is VALID [2022-04-27 14:55:26,512 INFO L290 TraceCheckUtils]: 1: Hoare triple {29#true} assume true; {29#true} is VALID [2022-04-27 14:55:26,512 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29#true} {29#true} #66#return; {29#true} is VALID [2022-04-27 14:55:26,513 INFO L272 TraceCheckUtils]: 0: Hoare triple {29#true} call ULTIMATE.init(); {34#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 14:55:26,514 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#(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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {29#true} is VALID [2022-04-27 14:55:26,514 INFO L290 TraceCheckUtils]: 2: Hoare triple {29#true} assume true; {29#true} is VALID [2022-04-27 14:55:26,514 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29#true} {29#true} #66#return; {29#true} is VALID [2022-04-27 14:55:26,514 INFO L272 TraceCheckUtils]: 4: Hoare triple {29#true} call #t~ret6 := main(); {29#true} is VALID [2022-04-27 14:55:26,515 INFO L290 TraceCheckUtils]: 5: Hoare triple {29#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~s~0 := 1;~t~0 := 1; {29#true} is VALID [2022-04-27 14:55:26,515 INFO L290 TraceCheckUtils]: 6: Hoare triple {29#true} assume !true; {30#false} is VALID [2022-04-27 14:55:26,515 INFO L272 TraceCheckUtils]: 7: Hoare triple {30#false} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {30#false} is VALID [2022-04-27 14:55:26,516 INFO L290 TraceCheckUtils]: 8: Hoare triple {30#false} ~cond := #in~cond; {30#false} is VALID [2022-04-27 14:55:26,516 INFO L290 TraceCheckUtils]: 9: Hoare triple {30#false} assume 0 == ~cond; {30#false} is VALID [2022-04-27 14:55:26,516 INFO L290 TraceCheckUtils]: 10: Hoare triple {30#false} assume !false; {30#false} is VALID [2022-04-27 14:55:26,516 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 14:55:26,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:55:26,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862066125] [2022-04-27 14:55:26,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862066125] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 14:55:26,519 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 14:55:26,519 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 14:55:26,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362848777] [2022-04-27 14:55:26,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:55:26,525 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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 11 [2022-04-27 14:55:26,526 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:55:26,528 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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 14:55:26,541 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:55:26,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 14:55:26,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:55:26,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 14:55:26,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 14:55:26,564 INFO L87 Difference]: Start difference. First operand has 26 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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 14:55:26,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:55:26,667 INFO L93 Difference]: Finished difference Result 47 states and 70 transitions. [2022-04-27 14:55:26,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 14:55:26,669 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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 11 [2022-04-27 14:55:26,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:55:26,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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 14:55:26,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2022-04-27 14:55:26,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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 14:55:26,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2022-04-27 14:55:26,685 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 70 transitions. [2022-04-27 14:55:26,757 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 14:55:26,763 INFO L225 Difference]: With dead ends: 47 [2022-04-27 14:55:26,763 INFO L226 Difference]: Without dead ends: 22 [2022-04-27 14:55:26,764 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 14:55:26,767 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 6 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 14:55:26,767 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 35 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 14:55:26,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-27 14:55:26,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2022-04-27 14:55:26,792 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:55:26,792 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 21 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:55:26,793 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 21 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:55:26,793 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 21 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:55:26,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:55:26,803 INFO L93 Difference]: Finished difference Result 22 states and 28 transitions. [2022-04-27 14:55:26,803 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2022-04-27 14:55:26,803 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:55:26,803 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:55:26,804 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 22 states. [2022-04-27 14:55:26,804 INFO L87 Difference]: Start difference. First operand has 21 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 22 states. [2022-04-27 14:55:26,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:55:26,810 INFO L93 Difference]: Finished difference Result 22 states and 28 transitions. [2022-04-27 14:55:26,810 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2022-04-27 14:55:26,811 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:55:26,811 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:55:26,811 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:55:26,811 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:55:26,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:55:26,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2022-04-27 14:55:26,813 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 27 transitions. Word has length 11 [2022-04-27 14:55:26,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:55:26,814 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 27 transitions. [2022-04-27 14:55:26,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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 14:55:26,814 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 27 transitions. [2022-04-27 14:55:26,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 14:55:26,818 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:55:26,818 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:55:26,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 14:55:26,819 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:55:26,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:55:26,819 INFO L85 PathProgramCache]: Analyzing trace with hash 1070997212, now seen corresponding path program 1 times [2022-04-27 14:55:26,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:55:26,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764332844] [2022-04-27 14:55:26,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:55:26,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:55:26,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:55:26,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 14:55:26,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:55:26,931 INFO L290 TraceCheckUtils]: 0: Hoare triple {189#(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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {187#(= ~counter~0 0)} is VALID [2022-04-27 14:55:26,932 INFO L290 TraceCheckUtils]: 1: Hoare triple {187#(= ~counter~0 0)} assume true; {187#(= ~counter~0 0)} is VALID [2022-04-27 14:55:26,932 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {187#(= ~counter~0 0)} {182#true} #66#return; {187#(= ~counter~0 0)} is VALID [2022-04-27 14:55:26,933 INFO L272 TraceCheckUtils]: 0: Hoare triple {182#true} call ULTIMATE.init(); {189#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 14:55:26,933 INFO L290 TraceCheckUtils]: 1: Hoare triple {189#(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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {187#(= ~counter~0 0)} is VALID [2022-04-27 14:55:26,934 INFO L290 TraceCheckUtils]: 2: Hoare triple {187#(= ~counter~0 0)} assume true; {187#(= ~counter~0 0)} is VALID [2022-04-27 14:55:26,934 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {187#(= ~counter~0 0)} {182#true} #66#return; {187#(= ~counter~0 0)} is VALID [2022-04-27 14:55:26,934 INFO L272 TraceCheckUtils]: 4: Hoare triple {187#(= ~counter~0 0)} call #t~ret6 := main(); {187#(= ~counter~0 0)} is VALID [2022-04-27 14:55:26,935 INFO L290 TraceCheckUtils]: 5: Hoare triple {187#(= ~counter~0 0)} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~s~0 := 1;~t~0 := 1; {187#(= ~counter~0 0)} is VALID [2022-04-27 14:55:26,935 INFO L290 TraceCheckUtils]: 6: Hoare triple {187#(= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {188#(= |main_#t~post5| 0)} is VALID [2022-04-27 14:55:26,936 INFO L290 TraceCheckUtils]: 7: Hoare triple {188#(= |main_#t~post5| 0)} assume !(#t~post5 < 20);havoc #t~post5; {183#false} is VALID [2022-04-27 14:55:26,936 INFO L272 TraceCheckUtils]: 8: Hoare triple {183#false} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {183#false} is VALID [2022-04-27 14:55:26,936 INFO L290 TraceCheckUtils]: 9: Hoare triple {183#false} ~cond := #in~cond; {183#false} is VALID [2022-04-27 14:55:26,936 INFO L290 TraceCheckUtils]: 10: Hoare triple {183#false} assume 0 == ~cond; {183#false} is VALID [2022-04-27 14:55:26,936 INFO L290 TraceCheckUtils]: 11: Hoare triple {183#false} assume !false; {183#false} is VALID [2022-04-27 14:55:26,936 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 14:55:26,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:55:26,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764332844] [2022-04-27 14:55:26,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764332844] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 14:55:26,937 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 14:55:26,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 14:55:26,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116531132] [2022-04-27 14:55:26,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:55:26,938 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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 12 [2022-04-27 14:55:26,938 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:55:26,939 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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 14:55:26,947 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 14:55:26,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 14:55:26,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:55:26,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 14:55:26,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 14:55:26,948 INFO L87 Difference]: Start difference. First operand 21 states and 27 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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 14:55:27,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:55:27,090 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2022-04-27 14:55:27,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 14:55:27,090 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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 12 [2022-04-27 14:55:27,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:55:27,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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 14:55:27,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2022-04-27 14:55:27,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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 14:55:27,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2022-04-27 14:55:27,096 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 40 transitions. [2022-04-27 14:55:27,132 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:55:27,134 INFO L225 Difference]: With dead ends: 32 [2022-04-27 14:55:27,134 INFO L226 Difference]: Without dead ends: 23 [2022-04-27 14:55:27,138 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 14:55:27,140 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 6 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 14:55:27,141 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 49 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 14:55:27,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-27 14:55:27,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-04-27 14:55:27,146 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:55:27,147 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:55:27,147 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:55:27,148 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:55:27,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:55:27,152 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2022-04-27 14:55:27,152 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2022-04-27 14:55:27,153 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:55:27,153 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:55:27,153 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 23 states. [2022-04-27 14:55:27,154 INFO L87 Difference]: Start difference. First operand has 23 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 23 states. [2022-04-27 14:55:27,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:55:27,156 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2022-04-27 14:55:27,156 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2022-04-27 14:55:27,157 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:55:27,157 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:55:27,157 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:55:27,158 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:55:27,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:55:27,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2022-04-27 14:55:27,160 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 29 transitions. Word has length 12 [2022-04-27 14:55:27,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:55:27,161 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 29 transitions. [2022-04-27 14:55:27,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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 14:55:27,161 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2022-04-27 14:55:27,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 14:55:27,164 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:55:27,165 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:55:27,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 14:55:27,165 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:55:27,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:55:27,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1072665508, now seen corresponding path program 1 times [2022-04-27 14:55:27,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:55:27,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292325108] [2022-04-27 14:55:27,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:55:27,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:55:27,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:55:27,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 14:55:27,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:55:27,256 INFO L290 TraceCheckUtils]: 0: Hoare triple {333#(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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {325#true} is VALID [2022-04-27 14:55:27,256 INFO L290 TraceCheckUtils]: 1: Hoare triple {325#true} assume true; {325#true} is VALID [2022-04-27 14:55:27,257 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {325#true} {325#true} #66#return; {325#true} is VALID [2022-04-27 14:55:27,257 INFO L272 TraceCheckUtils]: 0: Hoare triple {325#true} call ULTIMATE.init(); {333#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 14:55:27,257 INFO L290 TraceCheckUtils]: 1: Hoare triple {333#(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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {325#true} is VALID [2022-04-27 14:55:27,257 INFO L290 TraceCheckUtils]: 2: Hoare triple {325#true} assume true; {325#true} is VALID [2022-04-27 14:55:27,258 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {325#true} {325#true} #66#return; {325#true} is VALID [2022-04-27 14:55:27,258 INFO L272 TraceCheckUtils]: 4: Hoare triple {325#true} call #t~ret6 := main(); {325#true} is VALID [2022-04-27 14:55:27,258 INFO L290 TraceCheckUtils]: 5: Hoare triple {325#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~s~0 := 1;~t~0 := 1; {330#(and (= (* main_~a~0 2) 0) (= main_~t~0 (+ (* main_~a~0 2) 1)))} is VALID [2022-04-27 14:55:27,259 INFO L290 TraceCheckUtils]: 6: Hoare triple {330#(and (= (* main_~a~0 2) 0) (= main_~t~0 (+ (* main_~a~0 2) 1)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {330#(and (= (* main_~a~0 2) 0) (= main_~t~0 (+ (* main_~a~0 2) 1)))} is VALID [2022-04-27 14:55:27,260 INFO L290 TraceCheckUtils]: 7: Hoare triple {330#(and (= (* main_~a~0 2) 0) (= main_~t~0 (+ (* main_~a~0 2) 1)))} assume !!(#t~post5 < 20);havoc #t~post5; {330#(and (= (* main_~a~0 2) 0) (= main_~t~0 (+ (* main_~a~0 2) 1)))} is VALID [2022-04-27 14:55:27,260 INFO L272 TraceCheckUtils]: 8: Hoare triple {330#(and (= (* main_~a~0 2) 0) (= main_~t~0 (+ (* main_~a~0 2) 1)))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {331#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:55:27,261 INFO L290 TraceCheckUtils]: 9: Hoare triple {331#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {332#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 14:55:27,261 INFO L290 TraceCheckUtils]: 10: Hoare triple {332#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {326#false} is VALID [2022-04-27 14:55:27,261 INFO L290 TraceCheckUtils]: 11: Hoare triple {326#false} assume !false; {326#false} is VALID [2022-04-27 14:55:27,262 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 14:55:27,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:55:27,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292325108] [2022-04-27 14:55:27,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292325108] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 14:55:27,263 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 14:55:27,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 14:55:27,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305983110] [2022-04-27 14:55:27,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:55:27,264 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 14:55:27,265 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:55:27,266 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 14:55:27,275 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 14:55:27,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 14:55:27,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:55:27,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 14:55:27,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 14:55:27,281 INFO L87 Difference]: Start difference. First operand 23 states and 29 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 14:55:27,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:55:27,559 INFO L93 Difference]: Finished difference Result 36 states and 47 transitions. [2022-04-27 14:55:27,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 14:55:27,560 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 14:55:27,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:55:27,560 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 14:55:27,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 47 transitions. [2022-04-27 14:55:27,563 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 14:55:27,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 47 transitions. [2022-04-27 14:55:27,565 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 47 transitions. [2022-04-27 14:55:27,601 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:55:27,603 INFO L225 Difference]: With dead ends: 36 [2022-04-27 14:55:27,603 INFO L226 Difference]: Without dead ends: 34 [2022-04-27 14:55:27,605 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 14:55:27,609 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 16 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 14:55:27,610 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 53 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 14:55:27,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-27 14:55:27,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2022-04-27 14:55:27,615 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:55:27,615 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 32 states, 16 states have (on average 1.25) internal successors, (20), 18 states have internal predecessors, (20), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 14:55:27,616 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 32 states, 16 states have (on average 1.25) internal successors, (20), 18 states have internal predecessors, (20), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 14:55:27,616 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 32 states, 16 states have (on average 1.25) internal successors, (20), 18 states have internal predecessors, (20), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 14:55:27,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:55:27,618 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions. [2022-04-27 14:55:27,618 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2022-04-27 14:55:27,618 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:55:27,618 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:55:27,618 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 16 states have (on average 1.25) internal successors, (20), 18 states have internal predecessors, (20), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand 34 states. [2022-04-27 14:55:27,619 INFO L87 Difference]: Start difference. First operand has 32 states, 16 states have (on average 1.25) internal successors, (20), 18 states have internal predecessors, (20), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand 34 states. [2022-04-27 14:55:27,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:55:27,620 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions. [2022-04-27 14:55:27,620 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2022-04-27 14:55:27,621 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:55:27,621 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:55:27,621 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:55:27,621 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:55:27,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 16 states have (on average 1.25) internal successors, (20), 18 states have internal predecessors, (20), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 14:55:27,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2022-04-27 14:55:27,623 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 12 [2022-04-27 14:55:27,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:55:27,623 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2022-04-27 14:55:27,623 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 14:55:27,623 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-27 14:55:27,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 14:55:27,623 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:55:27,623 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:55:27,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-27 14:55:27,624 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:55:27,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:55:27,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1640566567, now seen corresponding path program 1 times [2022-04-27 14:55:27,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:55:27,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625026746] [2022-04-27 14:55:27,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:55:27,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:55:27,633 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:55:27,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1685216144] [2022-04-27 14:55:27,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:55:27,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:55:27,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:55:27,635 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 14:55:27,648 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 14:55:27,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:55:27,667 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 14:55:27,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:55:27,693 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:55:27,807 INFO L272 TraceCheckUtils]: 0: Hoare triple {518#true} call ULTIMATE.init(); {518#true} is VALID [2022-04-27 14:55:27,807 INFO L290 TraceCheckUtils]: 1: Hoare triple {518#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {518#true} is VALID [2022-04-27 14:55:27,807 INFO L290 TraceCheckUtils]: 2: Hoare triple {518#true} assume true; {518#true} is VALID [2022-04-27 14:55:27,807 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {518#true} {518#true} #66#return; {518#true} is VALID [2022-04-27 14:55:27,807 INFO L272 TraceCheckUtils]: 4: Hoare triple {518#true} call #t~ret6 := main(); {518#true} is VALID [2022-04-27 14:55:27,808 INFO L290 TraceCheckUtils]: 5: Hoare triple {518#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~s~0 := 1;~t~0 := 1; {538#(and (= main_~a~0 0) (= main_~s~0 1))} is VALID [2022-04-27 14:55:27,808 INFO L290 TraceCheckUtils]: 6: Hoare triple {538#(and (= main_~a~0 0) (= main_~s~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {538#(and (= main_~a~0 0) (= main_~s~0 1))} is VALID [2022-04-27 14:55:27,809 INFO L290 TraceCheckUtils]: 7: Hoare triple {538#(and (= main_~a~0 0) (= main_~s~0 1))} assume !!(#t~post5 < 20);havoc #t~post5; {538#(and (= main_~a~0 0) (= main_~s~0 1))} is VALID [2022-04-27 14:55:27,809 INFO L272 TraceCheckUtils]: 8: Hoare triple {538#(and (= main_~a~0 0) (= main_~s~0 1))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {518#true} is VALID [2022-04-27 14:55:27,809 INFO L290 TraceCheckUtils]: 9: Hoare triple {518#true} ~cond := #in~cond; {518#true} is VALID [2022-04-27 14:55:27,809 INFO L290 TraceCheckUtils]: 10: Hoare triple {518#true} assume !(0 == ~cond); {518#true} is VALID [2022-04-27 14:55:27,809 INFO L290 TraceCheckUtils]: 11: Hoare triple {518#true} assume true; {518#true} is VALID [2022-04-27 14:55:27,810 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {518#true} {538#(and (= main_~a~0 0) (= main_~s~0 1))} #54#return; {538#(and (= main_~a~0 0) (= main_~s~0 1))} is VALID [2022-04-27 14:55:27,811 INFO L272 TraceCheckUtils]: 13: Hoare triple {538#(and (= main_~a~0 0) (= main_~s~0 1))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {563#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:55:27,811 INFO L290 TraceCheckUtils]: 14: Hoare triple {563#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {567#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:55:27,812 INFO L290 TraceCheckUtils]: 15: Hoare triple {567#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {519#false} is VALID [2022-04-27 14:55:27,812 INFO L290 TraceCheckUtils]: 16: Hoare triple {519#false} assume !false; {519#false} is VALID [2022-04-27 14:55:27,812 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 14:55:27,812 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 14:55:27,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:55:27,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625026746] [2022-04-27 14:55:27,812 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:55:27,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1685216144] [2022-04-27 14:55:27,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1685216144] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 14:55:27,813 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 14:55:27,813 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 14:55:27,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658275890] [2022-04-27 14:55:27,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:55:27,813 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, (4), 2 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 14:55:27,813 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:55:27,814 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, (4), 2 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 14:55:27,826 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 14:55:27,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 14:55:27,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:55:27,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 14:55:27,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 14:55:27,827 INFO L87 Difference]: Start difference. First operand 32 states and 42 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, (4), 2 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 14:55:27,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:55:27,961 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2022-04-27 14:55:27,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 14:55:27,961 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, (4), 2 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 14:55:27,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:55:27,961 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, (4), 2 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 14:55:27,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-04-27 14:55:27,963 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, (4), 2 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 14:55:27,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-04-27 14:55:27,964 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 47 transitions. [2022-04-27 14:55:28,004 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:55:28,005 INFO L225 Difference]: With dead ends: 40 [2022-04-27 14:55:28,005 INFO L226 Difference]: Without dead ends: 38 [2022-04-27 14:55:28,006 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 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 14:55:28,006 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 6 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 14:55:28,006 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 88 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 14:55:28,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-27 14:55:28,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2022-04-27 14:55:28,011 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:55:28,011 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 37 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:55:28,012 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 37 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:55:28,012 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 37 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:55:28,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:55:28,014 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2022-04-27 14:55:28,014 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 48 transitions. [2022-04-27 14:55:28,014 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:55:28,014 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:55:28,014 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) Second operand 38 states. [2022-04-27 14:55:28,014 INFO L87 Difference]: Start difference. First operand has 37 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) Second operand 38 states. [2022-04-27 14:55:28,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:55:28,016 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2022-04-27 14:55:28,016 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 48 transitions. [2022-04-27 14:55:28,016 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:55:28,016 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:55:28,016 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:55:28,016 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:55:28,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:55:28,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 47 transitions. [2022-04-27 14:55:28,018 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 47 transitions. Word has length 17 [2022-04-27 14:55:28,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:55:28,018 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 47 transitions. [2022-04-27 14:55:28,018 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, (4), 2 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 14:55:28,018 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 47 transitions. [2022-04-27 14:55:28,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-27 14:55:28,018 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:55:28,018 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 14:55:28,035 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-27 14:55:28,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:55:28,235 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:55:28,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:55:28,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1129080132, now seen corresponding path program 1 times [2022-04-27 14:55:28,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:55:28,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86407880] [2022-04-27 14:55:28,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:55:28,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:55:28,248 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:55:28,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [740361085] [2022-04-27 14:55:28,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:55:28,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:55:28,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:55:28,249 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 14:55:28,250 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 14:55:28,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:55:28,279 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 14:55:28,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:55:28,287 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:55:28,373 INFO L272 TraceCheckUtils]: 0: Hoare triple {769#true} call ULTIMATE.init(); {769#true} is VALID [2022-04-27 14:55:28,373 INFO L290 TraceCheckUtils]: 1: Hoare triple {769#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {769#true} is VALID [2022-04-27 14:55:28,373 INFO L290 TraceCheckUtils]: 2: Hoare triple {769#true} assume true; {769#true} is VALID [2022-04-27 14:55:28,373 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {769#true} {769#true} #66#return; {769#true} is VALID [2022-04-27 14:55:28,373 INFO L272 TraceCheckUtils]: 4: Hoare triple {769#true} call #t~ret6 := main(); {769#true} is VALID [2022-04-27 14:55:28,374 INFO L290 TraceCheckUtils]: 5: Hoare triple {769#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~s~0 := 1;~t~0 := 1; {789#(and (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-27 14:55:28,374 INFO L290 TraceCheckUtils]: 6: Hoare triple {789#(and (= main_~t~0 1) (= main_~s~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {789#(and (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-27 14:55:28,374 INFO L290 TraceCheckUtils]: 7: Hoare triple {789#(and (= main_~t~0 1) (= main_~s~0 1))} assume !!(#t~post5 < 20);havoc #t~post5; {789#(and (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-27 14:55:28,374 INFO L272 TraceCheckUtils]: 8: Hoare triple {789#(and (= main_~t~0 1) (= main_~s~0 1))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {769#true} is VALID [2022-04-27 14:55:28,374 INFO L290 TraceCheckUtils]: 9: Hoare triple {769#true} ~cond := #in~cond; {769#true} is VALID [2022-04-27 14:55:28,375 INFO L290 TraceCheckUtils]: 10: Hoare triple {769#true} assume !(0 == ~cond); {769#true} is VALID [2022-04-27 14:55:28,375 INFO L290 TraceCheckUtils]: 11: Hoare triple {769#true} assume true; {769#true} is VALID [2022-04-27 14:55:28,375 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {769#true} {789#(and (= main_~t~0 1) (= main_~s~0 1))} #54#return; {789#(and (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-27 14:55:28,375 INFO L272 TraceCheckUtils]: 13: Hoare triple {789#(and (= main_~t~0 1) (= main_~s~0 1))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {769#true} is VALID [2022-04-27 14:55:28,375 INFO L290 TraceCheckUtils]: 14: Hoare triple {769#true} ~cond := #in~cond; {769#true} is VALID [2022-04-27 14:55:28,376 INFO L290 TraceCheckUtils]: 15: Hoare triple {769#true} assume !(0 == ~cond); {769#true} is VALID [2022-04-27 14:55:28,376 INFO L290 TraceCheckUtils]: 16: Hoare triple {769#true} assume true; {769#true} is VALID [2022-04-27 14:55:28,376 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {769#true} {789#(and (= main_~t~0 1) (= main_~s~0 1))} #56#return; {789#(and (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-27 14:55:28,377 INFO L272 TraceCheckUtils]: 18: Hoare triple {789#(and (= main_~t~0 1) (= main_~s~0 1))} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {829#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:55:28,377 INFO L290 TraceCheckUtils]: 19: Hoare triple {829#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {833#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:55:28,377 INFO L290 TraceCheckUtils]: 20: Hoare triple {833#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {770#false} is VALID [2022-04-27 14:55:28,377 INFO L290 TraceCheckUtils]: 21: Hoare triple {770#false} assume !false; {770#false} is VALID [2022-04-27 14:55:28,378 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 14:55:28,378 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 14:55:28,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:55:28,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86407880] [2022-04-27 14:55:28,378 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:55:28,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [740361085] [2022-04-27 14:55:28,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [740361085] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 14:55:28,378 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 14:55:28,378 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 14:55:28,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955935594] [2022-04-27 14:55:28,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:55:28,379 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 14:55:28,379 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:55:28,379 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 14:55:28,391 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 14:55:28,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 14:55:28,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:55:28,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 14:55:28,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 14:55:28,392 INFO L87 Difference]: Start difference. First operand 37 states and 47 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 14:55:28,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:55:28,512 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2022-04-27 14:55:28,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 14:55:28,512 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 14:55:28,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:55:28,513 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 14:55:28,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-04-27 14:55:28,514 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 14:55:28,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-04-27 14:55:28,515 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 47 transitions. [2022-04-27 14:55:28,548 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:55:28,549 INFO L225 Difference]: With dead ends: 44 [2022-04-27 14:55:28,549 INFO L226 Difference]: Without dead ends: 39 [2022-04-27 14:55:28,550 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 14:55:28,550 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 6 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 14:55:28,550 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 95 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 14:55:28,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-27 14:55:28,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-04-27 14:55:28,555 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:55:28,555 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 39 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 14:55:28,555 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 39 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 14:55:28,555 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 39 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 14:55:28,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:55:28,557 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2022-04-27 14:55:28,557 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2022-04-27 14:55:28,557 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:55:28,557 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:55:28,557 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 39 states. [2022-04-27 14:55:28,557 INFO L87 Difference]: Start difference. First operand has 39 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 39 states. [2022-04-27 14:55:28,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:55:28,558 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2022-04-27 14:55:28,558 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2022-04-27 14:55:28,559 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:55:28,559 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:55:28,559 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:55:28,559 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:55:28,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 14:55:28,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2022-04-27 14:55:28,560 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 22 [2022-04-27 14:55:28,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:55:28,560 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2022-04-27 14:55:28,560 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 14:55:28,560 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2022-04-27 14:55:28,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-27 14:55:28,561 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:55:28,561 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:55:28,579 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 14:55:28,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:55:28,776 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:55:28,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:55:28,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1326533350, now seen corresponding path program 1 times [2022-04-27 14:55:28,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:55:28,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700949444] [2022-04-27 14:55:28,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:55:28,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:55:28,786 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:55:28,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [569076585] [2022-04-27 14:55:28,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:55:28,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:55:28,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:55:28,787 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 14:55:28,788 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 14:55:28,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:55:28,822 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 14:55:28,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:55:28,829 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:55:28,947 INFO L272 TraceCheckUtils]: 0: Hoare triple {1043#true} call ULTIMATE.init(); {1043#true} is VALID [2022-04-27 14:55:28,948 INFO L290 TraceCheckUtils]: 1: Hoare triple {1043#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1051#(<= ~counter~0 0)} is VALID [2022-04-27 14:55:28,948 INFO L290 TraceCheckUtils]: 2: Hoare triple {1051#(<= ~counter~0 0)} assume true; {1051#(<= ~counter~0 0)} is VALID [2022-04-27 14:55:28,948 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1051#(<= ~counter~0 0)} {1043#true} #66#return; {1051#(<= ~counter~0 0)} is VALID [2022-04-27 14:55:28,949 INFO L272 TraceCheckUtils]: 4: Hoare triple {1051#(<= ~counter~0 0)} call #t~ret6 := main(); {1051#(<= ~counter~0 0)} is VALID [2022-04-27 14:55:28,950 INFO L290 TraceCheckUtils]: 5: Hoare triple {1051#(<= ~counter~0 0)} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~s~0 := 1;~t~0 := 1; {1051#(<= ~counter~0 0)} is VALID [2022-04-27 14:55:28,950 INFO L290 TraceCheckUtils]: 6: Hoare triple {1051#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1067#(<= ~counter~0 1)} is VALID [2022-04-27 14:55:28,951 INFO L290 TraceCheckUtils]: 7: Hoare triple {1067#(<= ~counter~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {1067#(<= ~counter~0 1)} is VALID [2022-04-27 14:55:28,951 INFO L272 TraceCheckUtils]: 8: Hoare triple {1067#(<= ~counter~0 1)} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {1067#(<= ~counter~0 1)} is VALID [2022-04-27 14:55:28,951 INFO L290 TraceCheckUtils]: 9: Hoare triple {1067#(<= ~counter~0 1)} ~cond := #in~cond; {1067#(<= ~counter~0 1)} is VALID [2022-04-27 14:55:28,952 INFO L290 TraceCheckUtils]: 10: Hoare triple {1067#(<= ~counter~0 1)} assume !(0 == ~cond); {1067#(<= ~counter~0 1)} is VALID [2022-04-27 14:55:28,952 INFO L290 TraceCheckUtils]: 11: Hoare triple {1067#(<= ~counter~0 1)} assume true; {1067#(<= ~counter~0 1)} is VALID [2022-04-27 14:55:28,952 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1067#(<= ~counter~0 1)} {1067#(<= ~counter~0 1)} #54#return; {1067#(<= ~counter~0 1)} is VALID [2022-04-27 14:55:28,953 INFO L272 TraceCheckUtils]: 13: Hoare triple {1067#(<= ~counter~0 1)} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {1067#(<= ~counter~0 1)} is VALID [2022-04-27 14:55:28,953 INFO L290 TraceCheckUtils]: 14: Hoare triple {1067#(<= ~counter~0 1)} ~cond := #in~cond; {1067#(<= ~counter~0 1)} is VALID [2022-04-27 14:55:28,953 INFO L290 TraceCheckUtils]: 15: Hoare triple {1067#(<= ~counter~0 1)} assume !(0 == ~cond); {1067#(<= ~counter~0 1)} is VALID [2022-04-27 14:55:28,954 INFO L290 TraceCheckUtils]: 16: Hoare triple {1067#(<= ~counter~0 1)} assume true; {1067#(<= ~counter~0 1)} is VALID [2022-04-27 14:55:28,954 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1067#(<= ~counter~0 1)} {1067#(<= ~counter~0 1)} #56#return; {1067#(<= ~counter~0 1)} is VALID [2022-04-27 14:55:28,954 INFO L272 TraceCheckUtils]: 18: Hoare triple {1067#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {1067#(<= ~counter~0 1)} is VALID [2022-04-27 14:55:28,956 INFO L290 TraceCheckUtils]: 19: Hoare triple {1067#(<= ~counter~0 1)} ~cond := #in~cond; {1067#(<= ~counter~0 1)} is VALID [2022-04-27 14:55:28,956 INFO L290 TraceCheckUtils]: 20: Hoare triple {1067#(<= ~counter~0 1)} assume !(0 == ~cond); {1067#(<= ~counter~0 1)} is VALID [2022-04-27 14:55:28,956 INFO L290 TraceCheckUtils]: 21: Hoare triple {1067#(<= ~counter~0 1)} assume true; {1067#(<= ~counter~0 1)} is VALID [2022-04-27 14:55:28,957 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1067#(<= ~counter~0 1)} {1067#(<= ~counter~0 1)} #58#return; {1067#(<= ~counter~0 1)} is VALID [2022-04-27 14:55:28,957 INFO L290 TraceCheckUtils]: 23: Hoare triple {1067#(<= ~counter~0 1)} assume !!(~s~0 <= ~n~0);~a~0 := 1 + ~a~0;~t~0 := 2 + ~t~0;~s~0 := ~s~0 + ~t~0; {1067#(<= ~counter~0 1)} is VALID [2022-04-27 14:55:28,957 INFO L290 TraceCheckUtils]: 24: Hoare triple {1067#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1122#(<= |main_#t~post5| 1)} is VALID [2022-04-27 14:55:28,958 INFO L290 TraceCheckUtils]: 25: Hoare triple {1122#(<= |main_#t~post5| 1)} assume !(#t~post5 < 20);havoc #t~post5; {1044#false} is VALID [2022-04-27 14:55:28,958 INFO L272 TraceCheckUtils]: 26: Hoare triple {1044#false} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {1044#false} is VALID [2022-04-27 14:55:28,958 INFO L290 TraceCheckUtils]: 27: Hoare triple {1044#false} ~cond := #in~cond; {1044#false} is VALID [2022-04-27 14:55:28,958 INFO L290 TraceCheckUtils]: 28: Hoare triple {1044#false} assume 0 == ~cond; {1044#false} is VALID [2022-04-27 14:55:28,958 INFO L290 TraceCheckUtils]: 29: Hoare triple {1044#false} assume !false; {1044#false} is VALID [2022-04-27 14:55:28,958 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-27 14:55:28,958 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:55:29,082 INFO L290 TraceCheckUtils]: 29: Hoare triple {1044#false} assume !false; {1044#false} is VALID [2022-04-27 14:55:29,083 INFO L290 TraceCheckUtils]: 28: Hoare triple {1044#false} assume 0 == ~cond; {1044#false} is VALID [2022-04-27 14:55:29,083 INFO L290 TraceCheckUtils]: 27: Hoare triple {1044#false} ~cond := #in~cond; {1044#false} is VALID [2022-04-27 14:55:29,083 INFO L272 TraceCheckUtils]: 26: Hoare triple {1044#false} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {1044#false} is VALID [2022-04-27 14:55:29,084 INFO L290 TraceCheckUtils]: 25: Hoare triple {1150#(< |main_#t~post5| 20)} assume !(#t~post5 < 20);havoc #t~post5; {1044#false} is VALID [2022-04-27 14:55:29,084 INFO L290 TraceCheckUtils]: 24: Hoare triple {1154#(< ~counter~0 20)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1150#(< |main_#t~post5| 20)} is VALID [2022-04-27 14:55:29,091 INFO L290 TraceCheckUtils]: 23: Hoare triple {1154#(< ~counter~0 20)} assume !!(~s~0 <= ~n~0);~a~0 := 1 + ~a~0;~t~0 := 2 + ~t~0;~s~0 := ~s~0 + ~t~0; {1154#(< ~counter~0 20)} is VALID [2022-04-27 14:55:29,094 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1043#true} {1154#(< ~counter~0 20)} #58#return; {1154#(< ~counter~0 20)} is VALID [2022-04-27 14:55:29,094 INFO L290 TraceCheckUtils]: 21: Hoare triple {1043#true} assume true; {1043#true} is VALID [2022-04-27 14:55:29,094 INFO L290 TraceCheckUtils]: 20: Hoare triple {1043#true} assume !(0 == ~cond); {1043#true} is VALID [2022-04-27 14:55:29,094 INFO L290 TraceCheckUtils]: 19: Hoare triple {1043#true} ~cond := #in~cond; {1043#true} is VALID [2022-04-27 14:55:29,094 INFO L272 TraceCheckUtils]: 18: Hoare triple {1154#(< ~counter~0 20)} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {1043#true} is VALID [2022-04-27 14:55:29,095 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1043#true} {1154#(< ~counter~0 20)} #56#return; {1154#(< ~counter~0 20)} is VALID [2022-04-27 14:55:29,095 INFO L290 TraceCheckUtils]: 16: Hoare triple {1043#true} assume true; {1043#true} is VALID [2022-04-27 14:55:29,095 INFO L290 TraceCheckUtils]: 15: Hoare triple {1043#true} assume !(0 == ~cond); {1043#true} is VALID [2022-04-27 14:55:29,095 INFO L290 TraceCheckUtils]: 14: Hoare triple {1043#true} ~cond := #in~cond; {1043#true} is VALID [2022-04-27 14:55:29,095 INFO L272 TraceCheckUtils]: 13: Hoare triple {1154#(< ~counter~0 20)} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {1043#true} is VALID [2022-04-27 14:55:29,096 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1043#true} {1154#(< ~counter~0 20)} #54#return; {1154#(< ~counter~0 20)} is VALID [2022-04-27 14:55:29,096 INFO L290 TraceCheckUtils]: 11: Hoare triple {1043#true} assume true; {1043#true} is VALID [2022-04-27 14:55:29,096 INFO L290 TraceCheckUtils]: 10: Hoare triple {1043#true} assume !(0 == ~cond); {1043#true} is VALID [2022-04-27 14:55:29,096 INFO L290 TraceCheckUtils]: 9: Hoare triple {1043#true} ~cond := #in~cond; {1043#true} is VALID [2022-04-27 14:55:29,096 INFO L272 TraceCheckUtils]: 8: Hoare triple {1154#(< ~counter~0 20)} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {1043#true} is VALID [2022-04-27 14:55:29,096 INFO L290 TraceCheckUtils]: 7: Hoare triple {1154#(< ~counter~0 20)} assume !!(#t~post5 < 20);havoc #t~post5; {1154#(< ~counter~0 20)} is VALID [2022-04-27 14:55:29,097 INFO L290 TraceCheckUtils]: 6: Hoare triple {1209#(< ~counter~0 19)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1154#(< ~counter~0 20)} is VALID [2022-04-27 14:55:29,097 INFO L290 TraceCheckUtils]: 5: Hoare triple {1209#(< ~counter~0 19)} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~s~0 := 1;~t~0 := 1; {1209#(< ~counter~0 19)} is VALID [2022-04-27 14:55:29,097 INFO L272 TraceCheckUtils]: 4: Hoare triple {1209#(< ~counter~0 19)} call #t~ret6 := main(); {1209#(< ~counter~0 19)} is VALID [2022-04-27 14:55:29,098 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1209#(< ~counter~0 19)} {1043#true} #66#return; {1209#(< ~counter~0 19)} is VALID [2022-04-27 14:55:29,098 INFO L290 TraceCheckUtils]: 2: Hoare triple {1209#(< ~counter~0 19)} assume true; {1209#(< ~counter~0 19)} is VALID [2022-04-27 14:55:29,098 INFO L290 TraceCheckUtils]: 1: Hoare triple {1043#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1209#(< ~counter~0 19)} is VALID [2022-04-27 14:55:29,099 INFO L272 TraceCheckUtils]: 0: Hoare triple {1043#true} call ULTIMATE.init(); {1043#true} is VALID [2022-04-27 14:55:29,099 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-27 14:55:29,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:55:29,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700949444] [2022-04-27 14:55:29,099 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:55:29,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [569076585] [2022-04-27 14:55:29,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [569076585] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 14:55:29,101 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 14:55:29,101 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-27 14:55:29,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141723922] [2022-04-27 14:55:29,101 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 14:55:29,101 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) Word has length 30 [2022-04-27 14:55:29,102 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:55:29,102 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-27 14:55:29,126 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:55:29,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 14:55:29,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:55:29,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 14:55:29,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-27 14:55:29,127 INFO L87 Difference]: Start difference. First operand 39 states and 45 transitions. Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-27 14:55:29,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:55:29,377 INFO L93 Difference]: Finished difference Result 80 states and 100 transitions. [2022-04-27 14:55:29,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 14:55:29,377 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) Word has length 30 [2022-04-27 14:55:29,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:55:29,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-27 14:55:29,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 94 transitions. [2022-04-27 14:55:29,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-27 14:55:29,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 94 transitions. [2022-04-27 14:55:29,381 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 94 transitions. [2022-04-27 14:55:29,447 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:55:29,448 INFO L225 Difference]: With dead ends: 80 [2022-04-27 14:55:29,448 INFO L226 Difference]: Without dead ends: 71 [2022-04-27 14:55:29,448 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-04-27 14:55:29,449 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 40 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 14:55:29,449 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 167 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 14:55:29,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-04-27 14:55:29,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 67. [2022-04-27 14:55:29,471 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:55:29,472 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand has 67 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 39 states have internal predecessors, (43), 23 states have call successors, (23), 8 states have call predecessors, (23), 7 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-27 14:55:29,474 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand has 67 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 39 states have internal predecessors, (43), 23 states have call successors, (23), 8 states have call predecessors, (23), 7 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-27 14:55:29,474 INFO L87 Difference]: Start difference. First operand 71 states. Second operand has 67 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 39 states have internal predecessors, (43), 23 states have call successors, (23), 8 states have call predecessors, (23), 7 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-27 14:55:29,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:55:29,477 INFO L93 Difference]: Finished difference Result 71 states and 87 transitions. [2022-04-27 14:55:29,477 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 87 transitions. [2022-04-27 14:55:29,478 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:55:29,478 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:55:29,478 INFO L74 IsIncluded]: Start isIncluded. First operand has 67 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 39 states have internal predecessors, (43), 23 states have call successors, (23), 8 states have call predecessors, (23), 7 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand 71 states. [2022-04-27 14:55:29,478 INFO L87 Difference]: Start difference. First operand has 67 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 39 states have internal predecessors, (43), 23 states have call successors, (23), 8 states have call predecessors, (23), 7 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand 71 states. [2022-04-27 14:55:29,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:55:29,482 INFO L93 Difference]: Finished difference Result 71 states and 87 transitions. [2022-04-27 14:55:29,482 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 87 transitions. [2022-04-27 14:55:29,483 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:55:29,483 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:55:29,483 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:55:29,483 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:55:29,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 39 states have internal predecessors, (43), 23 states have call successors, (23), 8 states have call predecessors, (23), 7 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-27 14:55:29,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 85 transitions. [2022-04-27 14:55:29,485 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 85 transitions. Word has length 30 [2022-04-27 14:55:29,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:55:29,485 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 85 transitions. [2022-04-27 14:55:29,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 6 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-27 14:55:29,486 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 85 transitions. [2022-04-27 14:55:29,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-27 14:55:29,486 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:55:29,486 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:55:29,502 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-27 14:55:29,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:55:29,695 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:55:29,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:55:29,696 INFO L85 PathProgramCache]: Analyzing trace with hash -1324865054, now seen corresponding path program 1 times [2022-04-27 14:55:29,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:55:29,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737846111] [2022-04-27 14:55:29,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:55:29,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:55:29,708 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:55:29,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1440384529] [2022-04-27 14:55:29,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:55:29,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:55:29,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:55:29,717 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 14:55:29,718 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 14:55:29,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:55:29,753 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-27 14:55:29,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:55:29,759 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:55:29,861 INFO L272 TraceCheckUtils]: 0: Hoare triple {1601#true} call ULTIMATE.init(); {1601#true} is VALID [2022-04-27 14:55:29,861 INFO L290 TraceCheckUtils]: 1: Hoare triple {1601#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1601#true} is VALID [2022-04-27 14:55:29,862 INFO L290 TraceCheckUtils]: 2: Hoare triple {1601#true} assume true; {1601#true} is VALID [2022-04-27 14:55:29,862 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1601#true} {1601#true} #66#return; {1601#true} is VALID [2022-04-27 14:55:29,862 INFO L272 TraceCheckUtils]: 4: Hoare triple {1601#true} call #t~ret6 := main(); {1601#true} is VALID [2022-04-27 14:55:29,862 INFO L290 TraceCheckUtils]: 5: Hoare triple {1601#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~s~0 := 1;~t~0 := 1; {1621#(and (= main_~a~0 0) (= main_~t~0 1))} is VALID [2022-04-27 14:55:29,862 INFO L290 TraceCheckUtils]: 6: Hoare triple {1621#(and (= main_~a~0 0) (= main_~t~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1621#(and (= main_~a~0 0) (= main_~t~0 1))} is VALID [2022-04-27 14:55:29,863 INFO L290 TraceCheckUtils]: 7: Hoare triple {1621#(and (= main_~a~0 0) (= main_~t~0 1))} assume !!(#t~post5 < 20);havoc #t~post5; {1621#(and (= main_~a~0 0) (= main_~t~0 1))} is VALID [2022-04-27 14:55:29,863 INFO L272 TraceCheckUtils]: 8: Hoare triple {1621#(and (= main_~a~0 0) (= main_~t~0 1))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {1601#true} is VALID [2022-04-27 14:55:29,863 INFO L290 TraceCheckUtils]: 9: Hoare triple {1601#true} ~cond := #in~cond; {1601#true} is VALID [2022-04-27 14:55:29,863 INFO L290 TraceCheckUtils]: 10: Hoare triple {1601#true} assume !(0 == ~cond); {1601#true} is VALID [2022-04-27 14:55:29,863 INFO L290 TraceCheckUtils]: 11: Hoare triple {1601#true} assume true; {1601#true} is VALID [2022-04-27 14:55:29,864 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1601#true} {1621#(and (= main_~a~0 0) (= main_~t~0 1))} #54#return; {1621#(and (= main_~a~0 0) (= main_~t~0 1))} is VALID [2022-04-27 14:55:29,864 INFO L272 TraceCheckUtils]: 13: Hoare triple {1621#(and (= main_~a~0 0) (= main_~t~0 1))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {1601#true} is VALID [2022-04-27 14:55:29,864 INFO L290 TraceCheckUtils]: 14: Hoare triple {1601#true} ~cond := #in~cond; {1601#true} is VALID [2022-04-27 14:55:29,864 INFO L290 TraceCheckUtils]: 15: Hoare triple {1601#true} assume !(0 == ~cond); {1601#true} is VALID [2022-04-27 14:55:29,864 INFO L290 TraceCheckUtils]: 16: Hoare triple {1601#true} assume true; {1601#true} is VALID [2022-04-27 14:55:29,864 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1601#true} {1621#(and (= main_~a~0 0) (= main_~t~0 1))} #56#return; {1621#(and (= main_~a~0 0) (= main_~t~0 1))} is VALID [2022-04-27 14:55:29,864 INFO L272 TraceCheckUtils]: 18: Hoare triple {1621#(and (= main_~a~0 0) (= main_~t~0 1))} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {1601#true} is VALID [2022-04-27 14:55:29,864 INFO L290 TraceCheckUtils]: 19: Hoare triple {1601#true} ~cond := #in~cond; {1601#true} is VALID [2022-04-27 14:55:29,864 INFO L290 TraceCheckUtils]: 20: Hoare triple {1601#true} assume !(0 == ~cond); {1601#true} is VALID [2022-04-27 14:55:29,864 INFO L290 TraceCheckUtils]: 21: Hoare triple {1601#true} assume true; {1601#true} is VALID [2022-04-27 14:55:29,865 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1601#true} {1621#(and (= main_~a~0 0) (= main_~t~0 1))} #58#return; {1621#(and (= main_~a~0 0) (= main_~t~0 1))} is VALID [2022-04-27 14:55:29,865 INFO L290 TraceCheckUtils]: 23: Hoare triple {1621#(and (= main_~a~0 0) (= main_~t~0 1))} assume !!(~s~0 <= ~n~0);~a~0 := 1 + ~a~0;~t~0 := 2 + ~t~0;~s~0 := ~s~0 + ~t~0; {1676#(and (= (+ (- 2) main_~t~0) 1) (= (+ (- 1) main_~a~0) 0))} is VALID [2022-04-27 14:55:29,866 INFO L290 TraceCheckUtils]: 24: Hoare triple {1676#(and (= (+ (- 2) main_~t~0) 1) (= (+ (- 1) main_~a~0) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1676#(and (= (+ (- 2) main_~t~0) 1) (= (+ (- 1) main_~a~0) 0))} is VALID [2022-04-27 14:55:29,866 INFO L290 TraceCheckUtils]: 25: Hoare triple {1676#(and (= (+ (- 2) main_~t~0) 1) (= (+ (- 1) main_~a~0) 0))} assume !!(#t~post5 < 20);havoc #t~post5; {1676#(and (= (+ (- 2) main_~t~0) 1) (= (+ (- 1) main_~a~0) 0))} is VALID [2022-04-27 14:55:29,866 INFO L272 TraceCheckUtils]: 26: Hoare triple {1676#(and (= (+ (- 2) main_~t~0) 1) (= (+ (- 1) main_~a~0) 0))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {1686#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:55:29,867 INFO L290 TraceCheckUtils]: 27: Hoare triple {1686#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1690#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:55:29,867 INFO L290 TraceCheckUtils]: 28: Hoare triple {1690#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1602#false} is VALID [2022-04-27 14:55:29,867 INFO L290 TraceCheckUtils]: 29: Hoare triple {1602#false} assume !false; {1602#false} is VALID [2022-04-27 14:55:29,867 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-27 14:55:29,867 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:55:29,966 INFO L290 TraceCheckUtils]: 29: Hoare triple {1602#false} assume !false; {1602#false} is VALID [2022-04-27 14:55:29,966 INFO L290 TraceCheckUtils]: 28: Hoare triple {1690#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1602#false} is VALID [2022-04-27 14:55:29,967 INFO L290 TraceCheckUtils]: 27: Hoare triple {1686#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1690#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:55:29,967 INFO L272 TraceCheckUtils]: 26: Hoare triple {1706#(= main_~t~0 (+ (* main_~a~0 2) 1))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {1686#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:55:29,967 INFO L290 TraceCheckUtils]: 25: Hoare triple {1706#(= main_~t~0 (+ (* main_~a~0 2) 1))} assume !!(#t~post5 < 20);havoc #t~post5; {1706#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-27 14:55:29,968 INFO L290 TraceCheckUtils]: 24: Hoare triple {1706#(= main_~t~0 (+ (* main_~a~0 2) 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1706#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-27 14:55:29,969 INFO L290 TraceCheckUtils]: 23: Hoare triple {1706#(= main_~t~0 (+ (* main_~a~0 2) 1))} assume !!(~s~0 <= ~n~0);~a~0 := 1 + ~a~0;~t~0 := 2 + ~t~0;~s~0 := ~s~0 + ~t~0; {1706#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-27 14:55:29,969 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1601#true} {1706#(= main_~t~0 (+ (* main_~a~0 2) 1))} #58#return; {1706#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-27 14:55:29,969 INFO L290 TraceCheckUtils]: 21: Hoare triple {1601#true} assume true; {1601#true} is VALID [2022-04-27 14:55:29,969 INFO L290 TraceCheckUtils]: 20: Hoare triple {1601#true} assume !(0 == ~cond); {1601#true} is VALID [2022-04-27 14:55:29,969 INFO L290 TraceCheckUtils]: 19: Hoare triple {1601#true} ~cond := #in~cond; {1601#true} is VALID [2022-04-27 14:55:29,969 INFO L272 TraceCheckUtils]: 18: Hoare triple {1706#(= main_~t~0 (+ (* main_~a~0 2) 1))} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {1601#true} is VALID [2022-04-27 14:55:29,970 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1601#true} {1706#(= main_~t~0 (+ (* main_~a~0 2) 1))} #56#return; {1706#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-27 14:55:29,970 INFO L290 TraceCheckUtils]: 16: Hoare triple {1601#true} assume true; {1601#true} is VALID [2022-04-27 14:55:29,970 INFO L290 TraceCheckUtils]: 15: Hoare triple {1601#true} assume !(0 == ~cond); {1601#true} is VALID [2022-04-27 14:55:29,970 INFO L290 TraceCheckUtils]: 14: Hoare triple {1601#true} ~cond := #in~cond; {1601#true} is VALID [2022-04-27 14:55:29,970 INFO L272 TraceCheckUtils]: 13: Hoare triple {1706#(= main_~t~0 (+ (* main_~a~0 2) 1))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {1601#true} is VALID [2022-04-27 14:55:29,970 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1601#true} {1706#(= main_~t~0 (+ (* main_~a~0 2) 1))} #54#return; {1706#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-27 14:55:29,970 INFO L290 TraceCheckUtils]: 11: Hoare triple {1601#true} assume true; {1601#true} is VALID [2022-04-27 14:55:29,971 INFO L290 TraceCheckUtils]: 10: Hoare triple {1601#true} assume !(0 == ~cond); {1601#true} is VALID [2022-04-27 14:55:29,971 INFO L290 TraceCheckUtils]: 9: Hoare triple {1601#true} ~cond := #in~cond; {1601#true} is VALID [2022-04-27 14:55:29,971 INFO L272 TraceCheckUtils]: 8: Hoare triple {1706#(= main_~t~0 (+ (* main_~a~0 2) 1))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {1601#true} is VALID [2022-04-27 14:55:29,971 INFO L290 TraceCheckUtils]: 7: Hoare triple {1706#(= main_~t~0 (+ (* main_~a~0 2) 1))} assume !!(#t~post5 < 20);havoc #t~post5; {1706#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-27 14:55:29,971 INFO L290 TraceCheckUtils]: 6: Hoare triple {1706#(= main_~t~0 (+ (* main_~a~0 2) 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1706#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-27 14:55:29,972 INFO L290 TraceCheckUtils]: 5: Hoare triple {1601#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~s~0 := 1;~t~0 := 1; {1706#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-27 14:55:29,972 INFO L272 TraceCheckUtils]: 4: Hoare triple {1601#true} call #t~ret6 := main(); {1601#true} is VALID [2022-04-27 14:55:29,972 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1601#true} {1601#true} #66#return; {1601#true} is VALID [2022-04-27 14:55:29,972 INFO L290 TraceCheckUtils]: 2: Hoare triple {1601#true} assume true; {1601#true} is VALID [2022-04-27 14:55:29,972 INFO L290 TraceCheckUtils]: 1: Hoare triple {1601#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1601#true} is VALID [2022-04-27 14:55:29,972 INFO L272 TraceCheckUtils]: 0: Hoare triple {1601#true} call ULTIMATE.init(); {1601#true} is VALID [2022-04-27 14:55:29,972 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-27 14:55:29,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:55:29,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737846111] [2022-04-27 14:55:29,972 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:55:29,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1440384529] [2022-04-27 14:55:29,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1440384529] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 14:55:29,972 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:55:29,972 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-27 14:55:29,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820180824] [2022-04-27 14:55:29,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:55:29,973 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 30 [2022-04-27 14:55:29,973 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:55:29,973 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 14:55:29,986 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 14:55:29,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 14:55:29,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:55:29,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 14:55:29,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-27 14:55:29,987 INFO L87 Difference]: Start difference. First operand 67 states and 85 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 14:55:30,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:55:30,088 INFO L93 Difference]: Finished difference Result 81 states and 98 transitions. [2022-04-27 14:55:30,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 14:55:30,088 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 30 [2022-04-27 14:55:30,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:55:30,088 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 14:55:30,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-27 14:55:30,089 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 14:55:30,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-27 14:55:30,089 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 32 transitions. [2022-04-27 14:55:30,112 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:55:30,113 INFO L225 Difference]: With dead ends: 81 [2022-04-27 14:55:30,113 INFO L226 Difference]: Without dead ends: 79 [2022-04-27 14:55:30,114 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 52 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 14:55:30,114 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 7 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 14:55:30,114 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 62 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 14:55:30,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-04-27 14:55:30,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2022-04-27 14:55:30,136 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:55:30,137 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 states. Second operand has 79 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 48 states have internal predecessors, (52), 23 states have call successors, (23), 11 states have call predecessors, (23), 10 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-27 14:55:30,137 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand has 79 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 48 states have internal predecessors, (52), 23 states have call successors, (23), 11 states have call predecessors, (23), 10 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-27 14:55:30,137 INFO L87 Difference]: Start difference. First operand 79 states. Second operand has 79 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 48 states have internal predecessors, (52), 23 states have call successors, (23), 11 states have call predecessors, (23), 10 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-27 14:55:30,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:55:30,139 INFO L93 Difference]: Finished difference Result 79 states and 94 transitions. [2022-04-27 14:55:30,139 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 94 transitions. [2022-04-27 14:55:30,139 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:55:30,140 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:55:30,140 INFO L74 IsIncluded]: Start isIncluded. First operand has 79 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 48 states have internal predecessors, (52), 23 states have call successors, (23), 11 states have call predecessors, (23), 10 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand 79 states. [2022-04-27 14:55:30,140 INFO L87 Difference]: Start difference. First operand has 79 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 48 states have internal predecessors, (52), 23 states have call successors, (23), 11 states have call predecessors, (23), 10 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand 79 states. [2022-04-27 14:55:30,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:55:30,142 INFO L93 Difference]: Finished difference Result 79 states and 94 transitions. [2022-04-27 14:55:30,142 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 94 transitions. [2022-04-27 14:55:30,142 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:55:30,142 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:55:30,142 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:55:30,142 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:55:30,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 48 states have internal predecessors, (52), 23 states have call successors, (23), 11 states have call predecessors, (23), 10 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-27 14:55:30,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 94 transitions. [2022-04-27 14:55:30,145 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 94 transitions. Word has length 30 [2022-04-27 14:55:30,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:55:30,145 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 94 transitions. [2022-04-27 14:55:30,145 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 14:55:30,145 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 94 transitions. [2022-04-27 14:55:30,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-27 14:55:30,145 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:55:30,145 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:55:30,164 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 14:55:30,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:55:30,364 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:55:30,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:55:30,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1080733609, now seen corresponding path program 2 times [2022-04-27 14:55:30,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:55:30,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740807726] [2022-04-27 14:55:30,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:55:30,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:55:30,377 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:55:30,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [249350219] [2022-04-27 14:55:30,377 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 14:55:30,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:55:30,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:55:30,378 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 14:55:30,379 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 14:55:30,408 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 14:55:30,408 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:55:30,409 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-27 14:55:30,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:55:30,416 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:55:30,549 INFO L272 TraceCheckUtils]: 0: Hoare triple {2185#true} call ULTIMATE.init(); {2185#true} is VALID [2022-04-27 14:55:30,550 INFO L290 TraceCheckUtils]: 1: Hoare triple {2185#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2185#true} is VALID [2022-04-27 14:55:30,550 INFO L290 TraceCheckUtils]: 2: Hoare triple {2185#true} assume true; {2185#true} is VALID [2022-04-27 14:55:30,550 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2185#true} {2185#true} #66#return; {2185#true} is VALID [2022-04-27 14:55:30,550 INFO L272 TraceCheckUtils]: 4: Hoare triple {2185#true} call #t~ret6 := main(); {2185#true} is VALID [2022-04-27 14:55:30,551 INFO L290 TraceCheckUtils]: 5: Hoare triple {2185#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~s~0 := 1;~t~0 := 1; {2205#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-27 14:55:30,551 INFO L290 TraceCheckUtils]: 6: Hoare triple {2205#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2205#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-27 14:55:30,551 INFO L290 TraceCheckUtils]: 7: Hoare triple {2205#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} assume !!(#t~post5 < 20);havoc #t~post5; {2205#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-27 14:55:30,552 INFO L272 TraceCheckUtils]: 8: Hoare triple {2205#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {2185#true} is VALID [2022-04-27 14:55:30,552 INFO L290 TraceCheckUtils]: 9: Hoare triple {2185#true} ~cond := #in~cond; {2185#true} is VALID [2022-04-27 14:55:30,552 INFO L290 TraceCheckUtils]: 10: Hoare triple {2185#true} assume !(0 == ~cond); {2185#true} is VALID [2022-04-27 14:55:30,552 INFO L290 TraceCheckUtils]: 11: Hoare triple {2185#true} assume true; {2185#true} is VALID [2022-04-27 14:55:30,552 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2185#true} {2205#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} #54#return; {2205#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-27 14:55:30,552 INFO L272 TraceCheckUtils]: 13: Hoare triple {2205#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {2185#true} is VALID [2022-04-27 14:55:30,552 INFO L290 TraceCheckUtils]: 14: Hoare triple {2185#true} ~cond := #in~cond; {2185#true} is VALID [2022-04-27 14:55:30,552 INFO L290 TraceCheckUtils]: 15: Hoare triple {2185#true} assume !(0 == ~cond); {2185#true} is VALID [2022-04-27 14:55:30,553 INFO L290 TraceCheckUtils]: 16: Hoare triple {2185#true} assume true; {2185#true} is VALID [2022-04-27 14:55:30,553 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2185#true} {2205#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} #56#return; {2205#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-27 14:55:30,553 INFO L272 TraceCheckUtils]: 18: Hoare triple {2205#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {2185#true} is VALID [2022-04-27 14:55:30,553 INFO L290 TraceCheckUtils]: 19: Hoare triple {2185#true} ~cond := #in~cond; {2185#true} is VALID [2022-04-27 14:55:30,553 INFO L290 TraceCheckUtils]: 20: Hoare triple {2185#true} assume !(0 == ~cond); {2185#true} is VALID [2022-04-27 14:55:30,553 INFO L290 TraceCheckUtils]: 21: Hoare triple {2185#true} assume true; {2185#true} is VALID [2022-04-27 14:55:30,554 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2185#true} {2205#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} #58#return; {2205#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-27 14:55:30,554 INFO L290 TraceCheckUtils]: 23: Hoare triple {2205#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} assume !!(~s~0 <= ~n~0);~a~0 := 1 + ~a~0;~t~0 := 2 + ~t~0;~s~0 := ~s~0 + ~t~0; {2260#(and (= (+ (- 1) main_~a~0) 0) (= main_~s~0 4))} is VALID [2022-04-27 14:55:30,554 INFO L290 TraceCheckUtils]: 24: Hoare triple {2260#(and (= (+ (- 1) main_~a~0) 0) (= main_~s~0 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2260#(and (= (+ (- 1) main_~a~0) 0) (= main_~s~0 4))} is VALID [2022-04-27 14:55:30,555 INFO L290 TraceCheckUtils]: 25: Hoare triple {2260#(and (= (+ (- 1) main_~a~0) 0) (= main_~s~0 4))} assume !!(#t~post5 < 20);havoc #t~post5; {2260#(and (= (+ (- 1) main_~a~0) 0) (= main_~s~0 4))} is VALID [2022-04-27 14:55:30,555 INFO L272 TraceCheckUtils]: 26: Hoare triple {2260#(and (= (+ (- 1) main_~a~0) 0) (= main_~s~0 4))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {2185#true} is VALID [2022-04-27 14:55:30,555 INFO L290 TraceCheckUtils]: 27: Hoare triple {2185#true} ~cond := #in~cond; {2185#true} is VALID [2022-04-27 14:55:30,555 INFO L290 TraceCheckUtils]: 28: Hoare triple {2185#true} assume !(0 == ~cond); {2185#true} is VALID [2022-04-27 14:55:30,555 INFO L290 TraceCheckUtils]: 29: Hoare triple {2185#true} assume true; {2185#true} is VALID [2022-04-27 14:55:30,555 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {2185#true} {2260#(and (= (+ (- 1) main_~a~0) 0) (= main_~s~0 4))} #54#return; {2260#(and (= (+ (- 1) main_~a~0) 0) (= main_~s~0 4))} is VALID [2022-04-27 14:55:30,556 INFO L272 TraceCheckUtils]: 31: Hoare triple {2260#(and (= (+ (- 1) main_~a~0) 0) (= main_~s~0 4))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {2285#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:55:30,556 INFO L290 TraceCheckUtils]: 32: Hoare triple {2285#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2289#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:55:30,556 INFO L290 TraceCheckUtils]: 33: Hoare triple {2289#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2186#false} is VALID [2022-04-27 14:55:30,556 INFO L290 TraceCheckUtils]: 34: Hoare triple {2186#false} assume !false; {2186#false} is VALID [2022-04-27 14:55:30,557 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-27 14:55:30,557 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:55:30,693 INFO L290 TraceCheckUtils]: 34: Hoare triple {2186#false} assume !false; {2186#false} is VALID [2022-04-27 14:55:30,694 INFO L290 TraceCheckUtils]: 33: Hoare triple {2289#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2186#false} is VALID [2022-04-27 14:55:30,694 INFO L290 TraceCheckUtils]: 32: Hoare triple {2285#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2289#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:55:30,695 INFO L272 TraceCheckUtils]: 31: Hoare triple {2305#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {2285#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:55:30,695 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {2185#true} {2305#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} #54#return; {2305#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} is VALID [2022-04-27 14:55:30,695 INFO L290 TraceCheckUtils]: 29: Hoare triple {2185#true} assume true; {2185#true} is VALID [2022-04-27 14:55:30,695 INFO L290 TraceCheckUtils]: 28: Hoare triple {2185#true} assume !(0 == ~cond); {2185#true} is VALID [2022-04-27 14:55:30,695 INFO L290 TraceCheckUtils]: 27: Hoare triple {2185#true} ~cond := #in~cond; {2185#true} is VALID [2022-04-27 14:55:30,695 INFO L272 TraceCheckUtils]: 26: Hoare triple {2305#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {2185#true} is VALID [2022-04-27 14:55:30,697 INFO L290 TraceCheckUtils]: 25: Hoare triple {2305#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} assume !!(#t~post5 < 20);havoc #t~post5; {2305#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} is VALID [2022-04-27 14:55:30,698 INFO L290 TraceCheckUtils]: 24: Hoare triple {2305#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2305#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} is VALID [2022-04-27 14:55:30,728 INFO L290 TraceCheckUtils]: 23: Hoare triple {2330#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} assume !!(~s~0 <= ~n~0);~a~0 := 1 + ~a~0;~t~0 := 2 + ~t~0;~s~0 := ~s~0 + ~t~0; {2305#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} is VALID [2022-04-27 14:55:30,730 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2185#true} {2330#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} #58#return; {2330#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} is VALID [2022-04-27 14:55:30,730 INFO L290 TraceCheckUtils]: 21: Hoare triple {2185#true} assume true; {2185#true} is VALID [2022-04-27 14:55:30,730 INFO L290 TraceCheckUtils]: 20: Hoare triple {2185#true} assume !(0 == ~cond); {2185#true} is VALID [2022-04-27 14:55:30,730 INFO L290 TraceCheckUtils]: 19: Hoare triple {2185#true} ~cond := #in~cond; {2185#true} is VALID [2022-04-27 14:55:30,730 INFO L272 TraceCheckUtils]: 18: Hoare triple {2330#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {2185#true} is VALID [2022-04-27 14:55:30,732 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2185#true} {2330#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} #56#return; {2330#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} is VALID [2022-04-27 14:55:30,733 INFO L290 TraceCheckUtils]: 16: Hoare triple {2185#true} assume true; {2185#true} is VALID [2022-04-27 14:55:30,733 INFO L290 TraceCheckUtils]: 15: Hoare triple {2185#true} assume !(0 == ~cond); {2185#true} is VALID [2022-04-27 14:55:30,733 INFO L290 TraceCheckUtils]: 14: Hoare triple {2185#true} ~cond := #in~cond; {2185#true} is VALID [2022-04-27 14:55:30,733 INFO L272 TraceCheckUtils]: 13: Hoare triple {2330#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {2185#true} is VALID [2022-04-27 14:55:30,733 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2185#true} {2330#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} #54#return; {2330#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} is VALID [2022-04-27 14:55:30,733 INFO L290 TraceCheckUtils]: 11: Hoare triple {2185#true} assume true; {2185#true} is VALID [2022-04-27 14:55:30,733 INFO L290 TraceCheckUtils]: 10: Hoare triple {2185#true} assume !(0 == ~cond); {2185#true} is VALID [2022-04-27 14:55:30,733 INFO L290 TraceCheckUtils]: 9: Hoare triple {2185#true} ~cond := #in~cond; {2185#true} is VALID [2022-04-27 14:55:30,733 INFO L272 TraceCheckUtils]: 8: Hoare triple {2330#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {2185#true} is VALID [2022-04-27 14:55:30,734 INFO L290 TraceCheckUtils]: 7: Hoare triple {2330#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} assume !!(#t~post5 < 20);havoc #t~post5; {2330#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} is VALID [2022-04-27 14:55:30,734 INFO L290 TraceCheckUtils]: 6: Hoare triple {2330#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2330#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} is VALID [2022-04-27 14:55:30,735 INFO L290 TraceCheckUtils]: 5: Hoare triple {2185#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~s~0 := 1;~t~0 := 1; {2330#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} is VALID [2022-04-27 14:55:30,735 INFO L272 TraceCheckUtils]: 4: Hoare triple {2185#true} call #t~ret6 := main(); {2185#true} is VALID [2022-04-27 14:55:30,735 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2185#true} {2185#true} #66#return; {2185#true} is VALID [2022-04-27 14:55:30,735 INFO L290 TraceCheckUtils]: 2: Hoare triple {2185#true} assume true; {2185#true} is VALID [2022-04-27 14:55:30,735 INFO L290 TraceCheckUtils]: 1: Hoare triple {2185#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2185#true} is VALID [2022-04-27 14:55:30,735 INFO L272 TraceCheckUtils]: 0: Hoare triple {2185#true} call ULTIMATE.init(); {2185#true} is VALID [2022-04-27 14:55:30,735 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-27 14:55:30,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:55:30,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740807726] [2022-04-27 14:55:30,736 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:55:30,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [249350219] [2022-04-27 14:55:30,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [249350219] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 14:55:30,736 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 14:55:30,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-04-27 14:55:30,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249905627] [2022-04-27 14:55:30,736 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 14:55:30,736 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) Word has length 35 [2022-04-27 14:55:30,736 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:55:30,737 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2022-04-27 14:55:30,770 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 14:55:30,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 14:55:30,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:55:30,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 14:55:30,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-27 14:55:30,770 INFO L87 Difference]: Start difference. First operand 79 states and 94 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2022-04-27 14:55:31,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:55:31,116 INFO L93 Difference]: Finished difference Result 79 states and 94 transitions. [2022-04-27 14:55:31,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 14:55:31,117 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) Word has length 35 [2022-04-27 14:55:31,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:55:31,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2022-04-27 14:55:31,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 51 transitions. [2022-04-27 14:55:31,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2022-04-27 14:55:31,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 51 transitions. [2022-04-27 14:55:31,119 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 51 transitions. [2022-04-27 14:55:31,202 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:55:31,202 INFO L225 Difference]: With dead ends: 79 [2022-04-27 14:55:31,202 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 14:55:31,203 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-04-27 14:55:31,203 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 11 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 14:55:31,204 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 67 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 14:55:31,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 14:55:31,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 14:55:31,204 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:55:31,204 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 14:55:31,204 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 14:55:31,204 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 14:55:31,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:55:31,204 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 14:55:31,204 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 14:55:31,204 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:55:31,205 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:55:31,205 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 14:55:31,205 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 14:55:31,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:55:31,205 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 14:55:31,205 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 14:55:31,205 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:55:31,205 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:55:31,205 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:55:31,205 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:55:31,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 14:55:31,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 14:55:31,205 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 35 [2022-04-27 14:55:31,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:55:31,205 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 14:55:31,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2022-04-27 14:55:31,205 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 14:55:31,205 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:55:31,207 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 14:55:31,223 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 14:55:31,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:55:31,421 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-27 14:55:31,632 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 5) no Hoare annotation was computed. [2022-04-27 14:55:31,632 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 5) no Hoare annotation was computed. [2022-04-27 14:55:31,632 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 5) no Hoare annotation was computed. [2022-04-27 14:55:31,632 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 8 10) no Hoare annotation was computed. [2022-04-27 14:55:31,633 INFO L899 garLoopResultBuilder]: For program point L9(line 9) no Hoare annotation was computed. [2022-04-27 14:55:31,633 INFO L899 garLoopResultBuilder]: For program point L9-2(lines 8 10) no Hoare annotation was computed. [2022-04-27 14:55:31,633 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 8 10) no Hoare annotation was computed. [2022-04-27 14:55:31,633 INFO L899 garLoopResultBuilder]: For program point L33(lines 30 42) no Hoare annotation was computed. [2022-04-27 14:55:31,633 INFO L895 garLoopResultBuilder]: At program point L31(line 31) the Hoare annotation is: (or (and (= (+ main_~t~0 main_~s~0) (+ (* main_~a~0 4) 2 (* main_~a~0 main_~a~0))) (= main_~t~0 (+ (* main_~a~0 2) 1))) (not (= |old(~counter~0)| 0))) [2022-04-27 14:55:31,633 INFO L895 garLoopResultBuilder]: At program point L31-1(line 31) the Hoare annotation is: (or (and (= (+ main_~t~0 main_~s~0) (+ (* main_~a~0 4) 2 (* main_~a~0 main_~a~0))) (= main_~t~0 (+ (* main_~a~0 2) 1))) (not (= |old(~counter~0)| 0))) [2022-04-27 14:55:31,633 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 21 49) no Hoare annotation was computed. [2022-04-27 14:55:31,633 INFO L899 garLoopResultBuilder]: For program point L46(line 46) no Hoare annotation was computed. [2022-04-27 14:55:31,633 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 21 49) no Hoare annotation was computed. [2022-04-27 14:55:31,633 INFO L895 garLoopResultBuilder]: At program point L44(line 44) the Hoare annotation is: (or (and (= (+ main_~t~0 main_~s~0) (+ (* main_~a~0 4) 2 (* main_~a~0 main_~a~0))) (= main_~t~0 (+ (* main_~a~0 2) 1))) (not (= |old(~counter~0)| 0))) [2022-04-27 14:55:31,633 INFO L895 garLoopResultBuilder]: At program point L32(line 32) the Hoare annotation is: (or (and (= (+ main_~t~0 main_~s~0) (+ (* main_~a~0 4) 2 (* main_~a~0 main_~a~0))) (= main_~t~0 (+ (* main_~a~0 2) 1))) (not (= |old(~counter~0)| 0))) [2022-04-27 14:55:31,633 INFO L895 garLoopResultBuilder]: At program point mainENTRY(lines 21 49) the Hoare annotation is: (or (= ~counter~0 0) (not (= |old(~counter~0)| 0))) [2022-04-27 14:55:31,633 INFO L899 garLoopResultBuilder]: For program point L30-1(lines 30 42) no Hoare annotation was computed. [2022-04-27 14:55:31,633 INFO L895 garLoopResultBuilder]: At program point L30-3(lines 30 42) the Hoare annotation is: (or (let ((.cse0 (* main_~a~0 2))) (and (= (+ .cse0 (* main_~a~0 main_~a~0) 1) main_~s~0) (= main_~t~0 (+ .cse0 1)))) (not (= |old(~counter~0)| 0))) [2022-04-27 14:55:31,633 INFO L895 garLoopResultBuilder]: At program point L30-4(lines 30 42) the Hoare annotation is: (or (and (= (+ main_~t~0 main_~s~0) (+ (* main_~a~0 4) 2 (* main_~a~0 main_~a~0))) (= main_~t~0 (+ (* main_~a~0 2) 1))) (not (= |old(~counter~0)| 0))) [2022-04-27 14:55:31,634 INFO L895 garLoopResultBuilder]: At program point L45(line 45) the Hoare annotation is: (or (and (= (+ main_~t~0 main_~s~0) (+ (* main_~a~0 4) 2 (* main_~a~0 main_~a~0))) (= main_~t~0 (+ (* main_~a~0 2) 1))) (and (= main_~t~0 1) (= main_~s~0 1)) (not (= |old(~counter~0)| 0))) [2022-04-27 14:55:31,634 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-27 14:55:31,634 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-27 14:55:31,634 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-27 14:55:31,634 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-27 14:55:31,634 INFO L895 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: (= ~counter~0 0) [2022-04-27 14:55:31,634 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-27 14:55:31,634 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-27 14:55:31,634 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 11 17) the Hoare annotation is: true [2022-04-27 14:55:31,634 INFO L899 garLoopResultBuilder]: For program point L13(lines 13 14) no Hoare annotation was computed. [2022-04-27 14:55:31,634 INFO L899 garLoopResultBuilder]: For program point L12(lines 12 15) no Hoare annotation was computed. [2022-04-27 14:55:31,634 INFO L899 garLoopResultBuilder]: For program point L12-2(lines 11 17) no Hoare annotation was computed. [2022-04-27 14:55:31,634 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 11 17) no Hoare annotation was computed. [2022-04-27 14:55:31,634 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 14) no Hoare annotation was computed. [2022-04-27 14:55:31,636 INFO L356 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1] [2022-04-27 14:55:31,637 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 14:55:31,639 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 14:55:31,639 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 14:55:31,640 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-27 14:55:31,640 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-27 14:55:31,640 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-27 14:55:31,640 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 14:55:31,640 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 14:55:31,641 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-27 14:55:31,641 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-27 14:55:31,641 WARN L170 areAnnotationChecker]: L30-1 has no Hoare annotation [2022-04-27 14:55:31,641 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-27 14:55:31,641 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-27 14:55:31,641 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 14:55:31,641 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 14:55:31,641 WARN L170 areAnnotationChecker]: L9-2 has no Hoare annotation [2022-04-27 14:55:31,641 WARN L170 areAnnotationChecker]: L30-1 has no Hoare annotation [2022-04-27 14:55:31,641 WARN L170 areAnnotationChecker]: L30-1 has no Hoare annotation [2022-04-27 14:55:31,641 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-27 14:55:31,641 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-27 14:55:31,641 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2022-04-27 14:55:31,641 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 14:55:31,641 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 14:55:31,641 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 14:55:31,641 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 14:55:31,641 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 14:55:31,642 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 14:55:31,642 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2022-04-27 14:55:31,642 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2022-04-27 14:55:31,642 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2022-04-27 14:55:31,642 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2022-04-27 14:55:31,642 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2022-04-27 14:55:31,642 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 14:55:31,642 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 14:55:31,642 INFO L163 areAnnotationChecker]: CFG has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 14:55:31,647 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 02:55:31 BoogieIcfgContainer [2022-04-27 14:55:31,647 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 14:55:31,647 INFO L158 Benchmark]: Toolchain (without parser) took 5840.14ms. Allocated memory was 215.0MB in the beginning and 307.2MB in the end (delta: 92.3MB). Free memory was 160.8MB in the beginning and 253.8MB in the end (delta: -92.9MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 14:55:31,648 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 215.0MB. Free memory is still 177.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 14:55:31,648 INFO L158 Benchmark]: CACSL2BoogieTranslator took 165.77ms. Allocated memory is still 215.0MB. Free memory was 160.7MB in the beginning and 189.7MB in the end (delta: -29.0MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2022-04-27 14:55:31,648 INFO L158 Benchmark]: Boogie Preprocessor took 17.15ms. Allocated memory is still 215.0MB. Free memory was 189.7MB in the beginning and 188.2MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 14:55:31,648 INFO L158 Benchmark]: RCFGBuilder took 251.79ms. Allocated memory is still 215.0MB. Free memory was 188.2MB in the beginning and 177.1MB in the end (delta: 11.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-27 14:55:31,648 INFO L158 Benchmark]: TraceAbstraction took 5401.43ms. Allocated memory was 215.0MB in the beginning and 307.2MB in the end (delta: 92.3MB). Free memory was 176.7MB in the beginning and 253.8MB in the end (delta: -77.1MB). Peak memory consumption was 16.5MB. Max. memory is 8.0GB. [2022-04-27 14:55:31,649 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.08ms. Allocated memory is still 215.0MB. Free memory is still 177.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 165.77ms. Allocated memory is still 215.0MB. Free memory was 160.7MB in the beginning and 189.7MB in the end (delta: -29.0MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 17.15ms. Allocated memory is still 215.0MB. Free memory was 189.7MB in the beginning and 188.2MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 251.79ms. Allocated memory is still 215.0MB. Free memory was 188.2MB in the beginning and 177.1MB in the end (delta: 11.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 5401.43ms. Allocated memory was 215.0MB in the beginning and 307.2MB in the end (delta: 92.3MB). Free memory was 176.7MB in the beginning and 253.8MB in the end (delta: -77.1MB). Peak memory consumption was 16.5MB. 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 - PositiveResult [Line: 14]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 33 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.3s, OverallIterations: 8, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 112 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 98 mSDsluCounter, 616 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 392 mSDsCounter, 78 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 426 IncrementalHoareTripleChecker+Invalid, 504 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 78 mSolverCounterUnsat, 224 mSDtfsCounter, 426 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 255 GetRequests, 207 SyntacticMatches, 3 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=79occurred in iteration=7, InterpolantAutomatonStates: 49, 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, 8 MinimizatonAttempts, 8 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 47 PreInvPairs, 76 NumberOfFragments, 203 HoareAnnotationTreeSize, 47 FomulaSimplifications, 36 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 12 FomulaSimplificationsInter, 879 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 169 NumberOfCodeBlocks, 169 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 253 ConstructedInterpolants, 0 QuantifiedInterpolants, 822 SizeOfPredicates, 7 NumberOfNonLiveVariables, 508 ConjunctsInSsa, 47 ConjunctsInUnsatCore, 11 InterpolantComputations, 6 PerfectInterpolantSequences, 149/164 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: (a * 2 + a * a + 1 == s && t == a * 2 + 1) || !(\old(counter) == 0) RESULT: Ultimate proved your program to be correct! [2022-04-27 14:55:31,659 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...