/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_valuebound20.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 14:56:01,659 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 14:56:01,689 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 14:56:01,712 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 14:56:01,712 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 14:56:01,713 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 14:56:01,713 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 14:56:01,714 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 14:56:01,715 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 14:56:01,716 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 14:56:01,716 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 14:56:01,717 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 14:56:01,717 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 14:56:01,718 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 14:56:01,718 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 14:56:01,719 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 14:56:01,719 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 14:56:01,720 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 14:56:01,721 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 14:56:01,722 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 14:56:01,723 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 14:56:01,723 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 14:56:01,724 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 14:56:01,724 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 14:56:01,725 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 14:56:01,726 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 14:56:01,727 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 14:56:01,727 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 14:56:01,727 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 14:56:01,728 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 14:56:01,728 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 14:56:01,728 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 14:56:01,729 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 14:56:01,729 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 14:56:01,729 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 14:56:01,730 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 14:56:01,730 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 14:56:01,730 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 14:56:01,731 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 14:56:01,731 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 14:56:01,731 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 14:56:01,734 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 14:56:01,734 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:56:01,753 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 14:56:01,754 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 14:56:01,754 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 14:56:01,754 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 14:56:01,754 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 14:56:01,755 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 14:56:01,755 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 14:56:01,755 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 14:56:01,755 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 14:56:01,756 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 14:56:01,756 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 14:56:01,756 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 14:56:01,756 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 14:56:01,756 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 14:56:01,756 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 14:56:01,756 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 14:56:01,756 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 14:56:01,757 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 14:56:01,757 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 14:56:01,757 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 14:56:01,758 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 14:56:01,758 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 14:56:01,758 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 14:56:01,758 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 14:56:01,758 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 14:56:01,758 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 14:56:01,758 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 14:56:01,758 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 14:56:01,758 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 14:56:01,758 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 14:56:01,759 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 14:56:01,759 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 14:56:01,759 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 14:56:01,759 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:56:01,972 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 14:56:01,993 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 14:56:01,995 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 14:56:01,996 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 14:56:01,996 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 14:56:01,997 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/sqrt1-ll_valuebound20.c [2022-04-27 14:56:02,050 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/655bdb2a3/1dcbd8781ba642b69c0c386c4f886dbf/FLAGe6b315a7c [2022-04-27 14:56:02,419 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 14:56:02,420 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/sqrt1-ll_valuebound20.c [2022-04-27 14:56:02,425 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/655bdb2a3/1dcbd8781ba642b69c0c386c4f886dbf/FLAGe6b315a7c [2022-04-27 14:56:02,436 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/655bdb2a3/1dcbd8781ba642b69c0c386c4f886dbf [2022-04-27 14:56:02,437 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 14:56:02,439 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 14:56:02,441 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 14:56:02,441 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 14:56:02,443 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 14:56:02,447 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 02:56:02" (1/1) ... [2022-04-27 14:56:02,448 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d81dc58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:56:02, skipping insertion in model container [2022-04-27 14:56:02,448 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 02:56:02" (1/1) ... [2022-04-27 14:56:02,453 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 14:56:02,464 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 14:56:02,588 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_valuebound20.c[520,533] [2022-04-27 14:56:02,598 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 14:56:02,604 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 14:56:02,613 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_valuebound20.c[520,533] [2022-04-27 14:56:02,618 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 14:56:02,627 INFO L208 MainTranslator]: Completed translation [2022-04-27 14:56:02,627 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:56:02 WrapperNode [2022-04-27 14:56:02,627 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 14:56:02,628 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 14:56:02,628 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 14:56:02,628 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 14:56:02,635 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:56:02" (1/1) ... [2022-04-27 14:56:02,635 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:56:02" (1/1) ... [2022-04-27 14:56:02,640 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:56:02" (1/1) ... [2022-04-27 14:56:02,641 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:56:02" (1/1) ... [2022-04-27 14:56:02,653 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:56:02" (1/1) ... [2022-04-27 14:56:02,656 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:56:02" (1/1) ... [2022-04-27 14:56:02,657 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:56:02" (1/1) ... [2022-04-27 14:56:02,658 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 14:56:02,662 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 14:56:02,662 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 14:56:02,662 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 14:56:02,663 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:56:02" (1/1) ... [2022-04-27 14:56:02,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 14:56:02,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:56:02,686 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:56:02,693 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:56:02,715 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 14:56:02,715 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 14:56:02,715 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 14:56:02,716 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 14:56:02,717 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 14:56:02,718 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 14:56:02,718 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 14:56:02,718 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 14:56:02,719 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 14:56:02,719 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 14:56:02,719 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 14:56:02,719 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 14:56:02,719 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 14:56:02,719 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 14:56:02,722 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 14:56:02,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 14:56:02,722 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 14:56:02,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 14:56:02,722 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 14:56:02,722 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 14:56:02,771 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 14:56:02,772 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 14:56:02,957 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 14:56:02,962 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 14:56:02,963 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 14:56:02,964 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 02:56:02 BoogieIcfgContainer [2022-04-27 14:56:02,964 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 14:56:02,965 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 14:56:02,965 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 14:56:02,971 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 14:56:02,972 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 02:56:02" (1/3) ... [2022-04-27 14:56:02,972 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63ebc235 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 02:56:02, skipping insertion in model container [2022-04-27 14:56:02,973 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:56:02" (2/3) ... [2022-04-27 14:56:02,973 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63ebc235 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 02:56:02, skipping insertion in model container [2022-04-27 14:56:02,973 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 02:56:02" (3/3) ... [2022-04-27 14:56:02,974 INFO L111 eAbstractionObserver]: Analyzing ICFG sqrt1-ll_valuebound20.c [2022-04-27 14:56:02,984 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 14:56:02,985 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 14:56:03,034 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 14:56:03,050 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@23ab5367, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@550b79e0 [2022-04-27 14:56:03,051 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 14:56:03,058 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 14:56:03,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 14:56:03,064 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:56:03,065 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:56:03,065 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:56:03,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:56:03,070 INFO L85 PathProgramCache]: Analyzing trace with hash 326851384, now seen corresponding path program 1 times [2022-04-27 14:56:03,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:56:03,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266282978] [2022-04-27 14:56:03,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:56:03,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:56:03,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:56:03,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 14:56:03,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:56:03,251 INFO L290 TraceCheckUtils]: 0: Hoare triple {43#(and (= |#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); {34#true} is VALID [2022-04-27 14:56:03,252 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#true} assume true; {34#true} is VALID [2022-04-27 14:56:03,252 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34#true} {34#true} #69#return; {34#true} is VALID [2022-04-27 14:56:03,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 14:56:03,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:56:03,262 INFO L290 TraceCheckUtils]: 0: Hoare triple {34#true} ~cond := #in~cond; {34#true} is VALID [2022-04-27 14:56:03,263 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#true} assume 0 == ~cond;assume false; {35#false} is VALID [2022-04-27 14:56:03,263 INFO L290 TraceCheckUtils]: 2: Hoare triple {35#false} assume true; {35#false} is VALID [2022-04-27 14:56:03,264 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35#false} {34#true} #55#return; {35#false} is VALID [2022-04-27 14:56:03,265 INFO L272 TraceCheckUtils]: 0: Hoare triple {34#true} call ULTIMATE.init(); {43#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 14:56:03,265 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#(and (= |#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); {34#true} is VALID [2022-04-27 14:56:03,265 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#true} assume true; {34#true} is VALID [2022-04-27 14:56:03,265 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34#true} {34#true} #69#return; {34#true} is VALID [2022-04-27 14:56:03,266 INFO L272 TraceCheckUtils]: 4: Hoare triple {34#true} call #t~ret5 := main(); {34#true} is VALID [2022-04-27 14:56:03,266 INFO L290 TraceCheckUtils]: 5: Hoare triple {34#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; {34#true} is VALID [2022-04-27 14:56:03,266 INFO L272 TraceCheckUtils]: 6: Hoare triple {34#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 <= 20 then 1 else 0)); {34#true} is VALID [2022-04-27 14:56:03,266 INFO L290 TraceCheckUtils]: 7: Hoare triple {34#true} ~cond := #in~cond; {34#true} is VALID [2022-04-27 14:56:03,267 INFO L290 TraceCheckUtils]: 8: Hoare triple {34#true} assume 0 == ~cond;assume false; {35#false} is VALID [2022-04-27 14:56:03,267 INFO L290 TraceCheckUtils]: 9: Hoare triple {35#false} assume true; {35#false} is VALID [2022-04-27 14:56:03,267 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {35#false} {34#true} #55#return; {35#false} is VALID [2022-04-27 14:56:03,267 INFO L290 TraceCheckUtils]: 11: Hoare triple {35#false} ~a~0 := 0;~s~0 := 1;~t~0 := 1; {35#false} is VALID [2022-04-27 14:56:03,267 INFO L290 TraceCheckUtils]: 12: Hoare triple {35#false} assume false; {35#false} is VALID [2022-04-27 14:56:03,268 INFO L272 TraceCheckUtils]: 13: Hoare triple {35#false} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {35#false} is VALID [2022-04-27 14:56:03,268 INFO L290 TraceCheckUtils]: 14: Hoare triple {35#false} ~cond := #in~cond; {35#false} is VALID [2022-04-27 14:56:03,268 INFO L290 TraceCheckUtils]: 15: Hoare triple {35#false} assume 0 == ~cond; {35#false} is VALID [2022-04-27 14:56:03,269 INFO L290 TraceCheckUtils]: 16: Hoare triple {35#false} assume !false; {35#false} is VALID [2022-04-27 14:56:03,269 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:56:03,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:56:03,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266282978] [2022-04-27 14:56:03,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266282978] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 14:56:03,270 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 14:56:03,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 14:56:03,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445745027] [2022-04-27 14:56:03,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:56:03,278 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-27 14:56:03,279 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:56:03,282 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 14:56:03,312 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:56:03,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 14:56:03,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:56:03,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 14:56:03,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 14:56:03,333 INFO L87 Difference]: Start difference. First operand has 31 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 14:56:03,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:56:03,473 INFO L93 Difference]: Finished difference Result 53 states and 76 transitions. [2022-04-27 14:56:03,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 14:56:03,473 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-27 14:56:03,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:56:03,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 14:56:03,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 76 transitions. [2022-04-27 14:56:03,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 14:56:03,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 76 transitions. [2022-04-27 14:56:03,493 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 76 transitions. [2022-04-27 14:56:03,588 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:56:03,595 INFO L225 Difference]: With dead ends: 53 [2022-04-27 14:56:03,595 INFO L226 Difference]: Without dead ends: 26 [2022-04-27 14:56:03,598 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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:56:03,601 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 15 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 14:56:03,602 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 32 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 14:56:03,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-27 14:56:03,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-04-27 14:56:03,628 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:56:03,629 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 26 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 14:56:03,630 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 26 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 14:56:03,630 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 26 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 14:56:03,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:56:03,635 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2022-04-27 14:56:03,635 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2022-04-27 14:56:03,636 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:56:03,636 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:56:03,636 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 26 states. [2022-04-27 14:56:03,637 INFO L87 Difference]: Start difference. First operand has 26 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 26 states. [2022-04-27 14:56:03,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:56:03,639 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2022-04-27 14:56:03,639 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2022-04-27 14:56:03,639 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:56:03,639 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:56:03,639 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:56:03,640 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:56:03,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 14:56:03,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2022-04-27 14:56:03,642 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 17 [2022-04-27 14:56:03,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:56:03,642 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2022-04-27 14:56:03,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 14:56:03,643 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2022-04-27 14:56:03,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 14:56:03,643 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:56:03,643 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:56:03,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 14:56:03,644 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:56:03,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:56:03,645 INFO L85 PathProgramCache]: Analyzing trace with hash 1008578050, now seen corresponding path program 1 times [2022-04-27 14:56:03,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:56:03,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545697667] [2022-04-27 14:56:03,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:56:03,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:56:03,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:56:03,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 14:56:03,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:56:03,752 INFO L290 TraceCheckUtils]: 0: Hoare triple {225#(and (= |#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); {213#true} is VALID [2022-04-27 14:56:03,752 INFO L290 TraceCheckUtils]: 1: Hoare triple {213#true} assume true; {213#true} is VALID [2022-04-27 14:56:03,752 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {213#true} {213#true} #69#return; {213#true} is VALID [2022-04-27 14:56:03,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 14:56:03,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:56:03,757 INFO L290 TraceCheckUtils]: 0: Hoare triple {213#true} ~cond := #in~cond; {213#true} is VALID [2022-04-27 14:56:03,757 INFO L290 TraceCheckUtils]: 1: Hoare triple {213#true} assume !(0 == ~cond); {213#true} is VALID [2022-04-27 14:56:03,757 INFO L290 TraceCheckUtils]: 2: Hoare triple {213#true} assume true; {213#true} is VALID [2022-04-27 14:56:03,757 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {213#true} {213#true} #55#return; {213#true} is VALID [2022-04-27 14:56:03,758 INFO L272 TraceCheckUtils]: 0: Hoare triple {213#true} call ULTIMATE.init(); {225#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 14:56:03,758 INFO L290 TraceCheckUtils]: 1: Hoare triple {225#(and (= |#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); {213#true} is VALID [2022-04-27 14:56:03,758 INFO L290 TraceCheckUtils]: 2: Hoare triple {213#true} assume true; {213#true} is VALID [2022-04-27 14:56:03,758 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {213#true} {213#true} #69#return; {213#true} is VALID [2022-04-27 14:56:03,758 INFO L272 TraceCheckUtils]: 4: Hoare triple {213#true} call #t~ret5 := main(); {213#true} is VALID [2022-04-27 14:56:03,758 INFO L290 TraceCheckUtils]: 5: Hoare triple {213#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; {213#true} is VALID [2022-04-27 14:56:03,759 INFO L272 TraceCheckUtils]: 6: Hoare triple {213#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 <= 20 then 1 else 0)); {213#true} is VALID [2022-04-27 14:56:03,759 INFO L290 TraceCheckUtils]: 7: Hoare triple {213#true} ~cond := #in~cond; {213#true} is VALID [2022-04-27 14:56:03,759 INFO L290 TraceCheckUtils]: 8: Hoare triple {213#true} assume !(0 == ~cond); {213#true} is VALID [2022-04-27 14:56:03,759 INFO L290 TraceCheckUtils]: 9: Hoare triple {213#true} assume true; {213#true} is VALID [2022-04-27 14:56:03,759 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {213#true} {213#true} #55#return; {213#true} is VALID [2022-04-27 14:56:03,759 INFO L290 TraceCheckUtils]: 11: Hoare triple {213#true} ~a~0 := 0;~s~0 := 1;~t~0 := 1; {222#(and (= (* main_~a~0 2) 0) (= main_~t~0 (+ (* main_~a~0 2) 1)))} is VALID [2022-04-27 14:56:03,760 INFO L290 TraceCheckUtils]: 12: Hoare triple {222#(and (= (* main_~a~0 2) 0) (= main_~t~0 (+ (* main_~a~0 2) 1)))} assume !false; {222#(and (= (* main_~a~0 2) 0) (= main_~t~0 (+ (* main_~a~0 2) 1)))} is VALID [2022-04-27 14:56:03,761 INFO L272 TraceCheckUtils]: 13: Hoare triple {222#(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)); {223#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:56:03,761 INFO L290 TraceCheckUtils]: 14: Hoare triple {223#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {224#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 14:56:03,761 INFO L290 TraceCheckUtils]: 15: Hoare triple {224#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {214#false} is VALID [2022-04-27 14:56:03,762 INFO L290 TraceCheckUtils]: 16: Hoare triple {214#false} assume !false; {214#false} is VALID [2022-04-27 14:56:03,762 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:56:03,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:56:03,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545697667] [2022-04-27 14:56:03,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545697667] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 14:56:03,762 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 14:56:03,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 14:56:03,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362984020] [2022-04-27 14:56:03,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:56:03,763 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-27 14:56:03,764 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:56:03,764 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 14:56:03,776 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:56:03,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 14:56:03,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:56:03,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 14:56:03,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 14:56:03,777 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 14:56:04,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:56:04,197 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2022-04-27 14:56:04,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 14:56:04,198 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-27 14:56:04,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:56:04,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 14:56:04,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 50 transitions. [2022-04-27 14:56:04,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 14:56:04,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 50 transitions. [2022-04-27 14:56:04,207 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 50 transitions. [2022-04-27 14:56:04,254 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:56:04,257 INFO L225 Difference]: With dead ends: 40 [2022-04-27 14:56:04,257 INFO L226 Difference]: Without dead ends: 38 [2022-04-27 14:56:04,260 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 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:56:04,262 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 25 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 14:56:04,262 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 39 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 14:56:04,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-27 14:56:04,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2022-04-27 14:56:04,275 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:56:04,275 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 36 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 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:56:04,276 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 36 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 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:56:04,276 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 36 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 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:56:04,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:56:04,283 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2022-04-27 14:56:04,283 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 48 transitions. [2022-04-27 14:56:04,286 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:56:04,286 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:56:04,287 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 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:56:04,288 INFO L87 Difference]: Start difference. First operand has 36 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 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:56:04,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:56:04,291 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2022-04-27 14:56:04,291 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 48 transitions. [2022-04-27 14:56:04,293 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:56:04,294 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:56:04,294 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:56:04,294 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:56:04,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 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:56:04,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 45 transitions. [2022-04-27 14:56:04,296 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 45 transitions. Word has length 17 [2022-04-27 14:56:04,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:56:04,296 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 45 transitions. [2022-04-27 14:56:04,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 14:56:04,296 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 45 transitions. [2022-04-27 14:56:04,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-27 14:56:04,297 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:56:04,297 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:56:04,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 14:56:04,297 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:56:04,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:56:04,297 INFO L85 PathProgramCache]: Analyzing trace with hash -789682422, now seen corresponding path program 1 times [2022-04-27 14:56:04,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:56:04,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781751637] [2022-04-27 14:56:04,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:56:04,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:56:04,307 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:56:04,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2144875731] [2022-04-27 14:56:04,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:56:04,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:56:04,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:56:04,309 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:56:04,312 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:56:04,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:56:04,349 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 14:56:04,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:56:04,360 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:56:04,467 INFO L272 TraceCheckUtils]: 0: Hoare triple {430#true} call ULTIMATE.init(); {430#true} is VALID [2022-04-27 14:56:04,467 INFO L290 TraceCheckUtils]: 1: Hoare triple {430#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); {430#true} is VALID [2022-04-27 14:56:04,468 INFO L290 TraceCheckUtils]: 2: Hoare triple {430#true} assume true; {430#true} is VALID [2022-04-27 14:56:04,468 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {430#true} {430#true} #69#return; {430#true} is VALID [2022-04-27 14:56:04,468 INFO L272 TraceCheckUtils]: 4: Hoare triple {430#true} call #t~ret5 := main(); {430#true} is VALID [2022-04-27 14:56:04,468 INFO L290 TraceCheckUtils]: 5: Hoare triple {430#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; {430#true} is VALID [2022-04-27 14:56:04,468 INFO L272 TraceCheckUtils]: 6: Hoare triple {430#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 <= 20 then 1 else 0)); {430#true} is VALID [2022-04-27 14:56:04,468 INFO L290 TraceCheckUtils]: 7: Hoare triple {430#true} ~cond := #in~cond; {430#true} is VALID [2022-04-27 14:56:04,468 INFO L290 TraceCheckUtils]: 8: Hoare triple {430#true} assume !(0 == ~cond); {430#true} is VALID [2022-04-27 14:56:04,468 INFO L290 TraceCheckUtils]: 9: Hoare triple {430#true} assume true; {430#true} is VALID [2022-04-27 14:56:04,468 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {430#true} {430#true} #55#return; {430#true} is VALID [2022-04-27 14:56:04,469 INFO L290 TraceCheckUtils]: 11: Hoare triple {430#true} ~a~0 := 0;~s~0 := 1;~t~0 := 1; {468#(and (= main_~a~0 0) (= main_~s~0 1))} is VALID [2022-04-27 14:56:04,469 INFO L290 TraceCheckUtils]: 12: Hoare triple {468#(and (= main_~a~0 0) (= main_~s~0 1))} assume !false; {468#(and (= main_~a~0 0) (= main_~s~0 1))} is VALID [2022-04-27 14:56:04,469 INFO L272 TraceCheckUtils]: 13: Hoare triple {468#(and (= main_~a~0 0) (= main_~s~0 1))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {430#true} is VALID [2022-04-27 14:56:04,470 INFO L290 TraceCheckUtils]: 14: Hoare triple {430#true} ~cond := #in~cond; {430#true} is VALID [2022-04-27 14:56:04,470 INFO L290 TraceCheckUtils]: 15: Hoare triple {430#true} assume !(0 == ~cond); {430#true} is VALID [2022-04-27 14:56:04,470 INFO L290 TraceCheckUtils]: 16: Hoare triple {430#true} assume true; {430#true} is VALID [2022-04-27 14:56:04,470 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {430#true} {468#(and (= main_~a~0 0) (= main_~s~0 1))} #57#return; {468#(and (= main_~a~0 0) (= main_~s~0 1))} is VALID [2022-04-27 14:56:04,471 INFO L272 TraceCheckUtils]: 18: Hoare triple {468#(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)); {490#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:56:04,471 INFO L290 TraceCheckUtils]: 19: Hoare triple {490#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {494#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:56:04,472 INFO L290 TraceCheckUtils]: 20: Hoare triple {494#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {431#false} is VALID [2022-04-27 14:56:04,472 INFO L290 TraceCheckUtils]: 21: Hoare triple {431#false} assume !false; {431#false} is VALID [2022-04-27 14:56:04,472 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:56:04,472 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 14:56:04,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:56:04,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781751637] [2022-04-27 14:56:04,473 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:56:04,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2144875731] [2022-04-27 14:56:04,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2144875731] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 14:56:04,473 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 14:56:04,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 14:56:04,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695360222] [2022-04-27 14:56:04,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:56:04,474 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (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:56:04,474 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:56:04,474 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (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:56:04,488 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:56:04,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 14:56:04,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:56:04,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 14:56:04,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 14:56:04,489 INFO L87 Difference]: Start difference. First operand 36 states and 45 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (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:56:04,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:56:04,650 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2022-04-27 14:56:04,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 14:56:04,650 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (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:56:04,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:56:04,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (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:56:04,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2022-04-27 14:56:04,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (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:56:04,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2022-04-27 14:56:04,653 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 50 transitions. [2022-04-27 14:56:04,693 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:56:04,696 INFO L225 Difference]: With dead ends: 44 [2022-04-27 14:56:04,696 INFO L226 Difference]: Without dead ends: 42 [2022-04-27 14:56:04,696 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:56:04,698 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 6 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 14:56:04,699 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 103 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 14:56:04,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-04-27 14:56:04,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2022-04-27 14:56:04,711 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:56:04,711 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand has 41 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 14 states have call successors, (14), 6 states have call predecessors, (14), 5 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 14:56:04,712 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand has 41 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 14 states have call successors, (14), 6 states have call predecessors, (14), 5 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 14:56:04,712 INFO L87 Difference]: Start difference. First operand 42 states. Second operand has 41 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 14 states have call successors, (14), 6 states have call predecessors, (14), 5 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 14:56:04,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:56:04,714 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2022-04-27 14:56:04,714 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 51 transitions. [2022-04-27 14:56:04,715 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:56:04,715 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:56:04,715 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 14 states have call successors, (14), 6 states have call predecessors, (14), 5 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) Second operand 42 states. [2022-04-27 14:56:04,715 INFO L87 Difference]: Start difference. First operand has 41 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 14 states have call successors, (14), 6 states have call predecessors, (14), 5 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) Second operand 42 states. [2022-04-27 14:56:04,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:56:04,717 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2022-04-27 14:56:04,717 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 51 transitions. [2022-04-27 14:56:04,717 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:56:04,717 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:56:04,717 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:56:04,717 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:56:04,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 14 states have call successors, (14), 6 states have call predecessors, (14), 5 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 14:56:04,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 50 transitions. [2022-04-27 14:56:04,719 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 50 transitions. Word has length 22 [2022-04-27 14:56:04,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:56:04,719 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 50 transitions. [2022-04-27 14:56:04,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (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:56:04,720 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 50 transitions. [2022-04-27 14:56:04,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-27 14:56:04,720 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:56:04,720 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:56:04,740 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-27 14:56:04,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:56:04,933 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:56:04,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:56:04,934 INFO L85 PathProgramCache]: Analyzing trace with hash 2087529154, now seen corresponding path program 1 times [2022-04-27 14:56:04,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:56:04,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651960723] [2022-04-27 14:56:04,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:56:04,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:56:04,951 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:56:04,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1233857182] [2022-04-27 14:56:04,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:56:04,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:56:04,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:56:04,956 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:56:04,957 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:56:04,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:56:04,987 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 14:56:05,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:56:05,018 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:56:05,125 INFO L272 TraceCheckUtils]: 0: Hoare triple {716#true} call ULTIMATE.init(); {716#true} is VALID [2022-04-27 14:56:05,126 INFO L290 TraceCheckUtils]: 1: Hoare triple {716#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); {716#true} is VALID [2022-04-27 14:56:05,126 INFO L290 TraceCheckUtils]: 2: Hoare triple {716#true} assume true; {716#true} is VALID [2022-04-27 14:56:05,126 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {716#true} {716#true} #69#return; {716#true} is VALID [2022-04-27 14:56:05,126 INFO L272 TraceCheckUtils]: 4: Hoare triple {716#true} call #t~ret5 := main(); {716#true} is VALID [2022-04-27 14:56:05,126 INFO L290 TraceCheckUtils]: 5: Hoare triple {716#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; {716#true} is VALID [2022-04-27 14:56:05,126 INFO L272 TraceCheckUtils]: 6: Hoare triple {716#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 <= 20 then 1 else 0)); {716#true} is VALID [2022-04-27 14:56:05,126 INFO L290 TraceCheckUtils]: 7: Hoare triple {716#true} ~cond := #in~cond; {716#true} is VALID [2022-04-27 14:56:05,126 INFO L290 TraceCheckUtils]: 8: Hoare triple {716#true} assume !(0 == ~cond); {716#true} is VALID [2022-04-27 14:56:05,126 INFO L290 TraceCheckUtils]: 9: Hoare triple {716#true} assume true; {716#true} is VALID [2022-04-27 14:56:05,127 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {716#true} {716#true} #55#return; {716#true} is VALID [2022-04-27 14:56:05,127 INFO L290 TraceCheckUtils]: 11: Hoare triple {716#true} ~a~0 := 0;~s~0 := 1;~t~0 := 1; {754#(and (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-27 14:56:05,127 INFO L290 TraceCheckUtils]: 12: Hoare triple {754#(and (= main_~t~0 1) (= main_~s~0 1))} assume !false; {754#(and (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-27 14:56:05,127 INFO L272 TraceCheckUtils]: 13: Hoare triple {754#(and (= main_~t~0 1) (= main_~s~0 1))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {716#true} is VALID [2022-04-27 14:56:05,128 INFO L290 TraceCheckUtils]: 14: Hoare triple {716#true} ~cond := #in~cond; {716#true} is VALID [2022-04-27 14:56:05,128 INFO L290 TraceCheckUtils]: 15: Hoare triple {716#true} assume !(0 == ~cond); {716#true} is VALID [2022-04-27 14:56:05,128 INFO L290 TraceCheckUtils]: 16: Hoare triple {716#true} assume true; {716#true} is VALID [2022-04-27 14:56:05,136 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {716#true} {754#(and (= main_~t~0 1) (= main_~s~0 1))} #57#return; {754#(and (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-27 14:56:05,136 INFO L272 TraceCheckUtils]: 18: Hoare triple {754#(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)); {716#true} is VALID [2022-04-27 14:56:05,136 INFO L290 TraceCheckUtils]: 19: Hoare triple {716#true} ~cond := #in~cond; {716#true} is VALID [2022-04-27 14:56:05,136 INFO L290 TraceCheckUtils]: 20: Hoare triple {716#true} assume !(0 == ~cond); {716#true} is VALID [2022-04-27 14:56:05,136 INFO L290 TraceCheckUtils]: 21: Hoare triple {716#true} assume true; {716#true} is VALID [2022-04-27 14:56:05,137 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {716#true} {754#(and (= main_~t~0 1) (= main_~s~0 1))} #59#return; {754#(and (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-27 14:56:05,138 INFO L272 TraceCheckUtils]: 23: Hoare triple {754#(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)); {791#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:56:05,138 INFO L290 TraceCheckUtils]: 24: Hoare triple {791#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {795#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:56:05,138 INFO L290 TraceCheckUtils]: 25: Hoare triple {795#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {717#false} is VALID [2022-04-27 14:56:05,138 INFO L290 TraceCheckUtils]: 26: Hoare triple {717#false} assume !false; {717#false} is VALID [2022-04-27 14:56:05,139 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:56:05,139 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 14:56:05,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:56:05,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651960723] [2022-04-27 14:56:05,139 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:56:05,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1233857182] [2022-04-27 14:56:05,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1233857182] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 14:56:05,139 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 14:56:05,139 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 14:56:05,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473266554] [2022-04-27 14:56:05,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:56:05,140 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2022-04-27 14:56:05,140 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:56:05,140 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 14:56:05,154 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:56:05,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 14:56:05,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:56:05,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 14:56:05,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 14:56:05,155 INFO L87 Difference]: Start difference. First operand 41 states and 50 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 14:56:05,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:56:05,275 INFO L93 Difference]: Finished difference Result 48 states and 56 transitions. [2022-04-27 14:56:05,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 14:56:05,275 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2022-04-27 14:56:05,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:56:05,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 14:56:05,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2022-04-27 14:56:05,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 14:56:05,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2022-04-27 14:56:05,280 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 50 transitions. [2022-04-27 14:56:05,315 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:56:05,317 INFO L225 Difference]: With dead ends: 48 [2022-04-27 14:56:05,317 INFO L226 Difference]: Without dead ends: 43 [2022-04-27 14:56:05,317 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 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:56:05,318 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 6 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 14:56:05,320 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 106 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 14:56:05,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-27 14:56:05,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-04-27 14:56:05,330 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:56:05,331 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 43 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 25 states have internal predecessors, (26), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 14:56:05,331 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 43 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 25 states have internal predecessors, (26), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 14:56:05,332 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 43 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 25 states have internal predecessors, (26), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 14:56:05,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:56:05,335 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2022-04-27 14:56:05,335 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2022-04-27 14:56:05,335 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:56:05,335 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:56:05,336 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 25 states have internal predecessors, (26), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 43 states. [2022-04-27 14:56:05,336 INFO L87 Difference]: Start difference. First operand has 43 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 25 states have internal predecessors, (26), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 43 states. [2022-04-27 14:56:05,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:56:05,339 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2022-04-27 14:56:05,339 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2022-04-27 14:56:05,340 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:56:05,340 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:56:05,340 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:56:05,340 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:56:05,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 25 states have internal predecessors, (26), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 14:56:05,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2022-04-27 14:56:05,342 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 27 [2022-04-27 14:56:05,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:56:05,342 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2022-04-27 14:56:05,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 14:56:05,342 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2022-04-27 14:56:05,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-27 14:56:05,343 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:56:05,343 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:56:05,362 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:56:05,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-27 14:56:05,552 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:56:05,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:56:05,552 INFO L85 PathProgramCache]: Analyzing trace with hash -2092280728, now seen corresponding path program 1 times [2022-04-27 14:56:05,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:56:05,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984496152] [2022-04-27 14:56:05,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:56:05,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:56:05,565 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:56:05,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [868507825] [2022-04-27 14:56:05,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:56:05,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:56:05,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:56:05,568 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:56:05,569 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:56:05,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:56:05,605 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-27 14:56:05,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:56:05,627 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:56:05,778 INFO L272 TraceCheckUtils]: 0: Hoare triple {1025#true} call ULTIMATE.init(); {1025#true} is VALID [2022-04-27 14:56:05,778 INFO L290 TraceCheckUtils]: 1: Hoare triple {1025#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); {1025#true} is VALID [2022-04-27 14:56:05,778 INFO L290 TraceCheckUtils]: 2: Hoare triple {1025#true} assume true; {1025#true} is VALID [2022-04-27 14:56:05,778 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1025#true} {1025#true} #69#return; {1025#true} is VALID [2022-04-27 14:56:05,779 INFO L272 TraceCheckUtils]: 4: Hoare triple {1025#true} call #t~ret5 := main(); {1025#true} is VALID [2022-04-27 14:56:05,779 INFO L290 TraceCheckUtils]: 5: Hoare triple {1025#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; {1025#true} is VALID [2022-04-27 14:56:05,779 INFO L272 TraceCheckUtils]: 6: Hoare triple {1025#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 <= 20 then 1 else 0)); {1025#true} is VALID [2022-04-27 14:56:05,779 INFO L290 TraceCheckUtils]: 7: Hoare triple {1025#true} ~cond := #in~cond; {1025#true} is VALID [2022-04-27 14:56:05,779 INFO L290 TraceCheckUtils]: 8: Hoare triple {1025#true} assume !(0 == ~cond); {1025#true} is VALID [2022-04-27 14:56:05,779 INFO L290 TraceCheckUtils]: 9: Hoare triple {1025#true} assume true; {1025#true} is VALID [2022-04-27 14:56:05,779 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1025#true} {1025#true} #55#return; {1025#true} is VALID [2022-04-27 14:56:05,784 INFO L290 TraceCheckUtils]: 11: Hoare triple {1025#true} ~a~0 := 0;~s~0 := 1;~t~0 := 1; {1063#(and (= main_~a~0 0) (= main_~t~0 1))} is VALID [2022-04-27 14:56:05,784 INFO L290 TraceCheckUtils]: 12: Hoare triple {1063#(and (= main_~a~0 0) (= main_~t~0 1))} assume !false; {1063#(and (= main_~a~0 0) (= main_~t~0 1))} is VALID [2022-04-27 14:56:05,784 INFO L272 TraceCheckUtils]: 13: Hoare triple {1063#(and (= main_~a~0 0) (= main_~t~0 1))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {1025#true} is VALID [2022-04-27 14:56:05,785 INFO L290 TraceCheckUtils]: 14: Hoare triple {1025#true} ~cond := #in~cond; {1025#true} is VALID [2022-04-27 14:56:05,785 INFO L290 TraceCheckUtils]: 15: Hoare triple {1025#true} assume !(0 == ~cond); {1025#true} is VALID [2022-04-27 14:56:05,785 INFO L290 TraceCheckUtils]: 16: Hoare triple {1025#true} assume true; {1025#true} is VALID [2022-04-27 14:56:05,785 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1025#true} {1063#(and (= main_~a~0 0) (= main_~t~0 1))} #57#return; {1063#(and (= main_~a~0 0) (= main_~t~0 1))} is VALID [2022-04-27 14:56:05,785 INFO L272 TraceCheckUtils]: 18: Hoare triple {1063#(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)); {1025#true} is VALID [2022-04-27 14:56:05,786 INFO L290 TraceCheckUtils]: 19: Hoare triple {1025#true} ~cond := #in~cond; {1025#true} is VALID [2022-04-27 14:56:05,786 INFO L290 TraceCheckUtils]: 20: Hoare triple {1025#true} assume !(0 == ~cond); {1025#true} is VALID [2022-04-27 14:56:05,786 INFO L290 TraceCheckUtils]: 21: Hoare triple {1025#true} assume true; {1025#true} is VALID [2022-04-27 14:56:05,786 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1025#true} {1063#(and (= main_~a~0 0) (= main_~t~0 1))} #59#return; {1063#(and (= main_~a~0 0) (= main_~t~0 1))} is VALID [2022-04-27 14:56:05,786 INFO L272 TraceCheckUtils]: 23: Hoare triple {1063#(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)); {1025#true} is VALID [2022-04-27 14:56:05,786 INFO L290 TraceCheckUtils]: 24: Hoare triple {1025#true} ~cond := #in~cond; {1025#true} is VALID [2022-04-27 14:56:05,786 INFO L290 TraceCheckUtils]: 25: Hoare triple {1025#true} assume !(0 == ~cond); {1025#true} is VALID [2022-04-27 14:56:05,786 INFO L290 TraceCheckUtils]: 26: Hoare triple {1025#true} assume true; {1025#true} is VALID [2022-04-27 14:56:05,787 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1025#true} {1063#(and (= main_~a~0 0) (= main_~t~0 1))} #61#return; {1063#(and (= main_~a~0 0) (= main_~t~0 1))} is VALID [2022-04-27 14:56:05,787 INFO L290 TraceCheckUtils]: 28: Hoare triple {1063#(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; {1115#(and (= (+ (- 2) main_~t~0) 1) (= (+ (- 1) main_~a~0) 0))} is VALID [2022-04-27 14:56:05,788 INFO L290 TraceCheckUtils]: 29: Hoare triple {1115#(and (= (+ (- 2) main_~t~0) 1) (= (+ (- 1) main_~a~0) 0))} assume !false; {1115#(and (= (+ (- 2) main_~t~0) 1) (= (+ (- 1) main_~a~0) 0))} is VALID [2022-04-27 14:56:05,788 INFO L272 TraceCheckUtils]: 30: Hoare triple {1115#(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)); {1122#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:56:05,789 INFO L290 TraceCheckUtils]: 31: Hoare triple {1122#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1126#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:56:05,789 INFO L290 TraceCheckUtils]: 32: Hoare triple {1126#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1026#false} is VALID [2022-04-27 14:56:05,789 INFO L290 TraceCheckUtils]: 33: Hoare triple {1026#false} assume !false; {1026#false} is VALID [2022-04-27 14:56:05,789 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:56:05,789 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:56:05,956 INFO L290 TraceCheckUtils]: 33: Hoare triple {1026#false} assume !false; {1026#false} is VALID [2022-04-27 14:56:05,957 INFO L290 TraceCheckUtils]: 32: Hoare triple {1126#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1026#false} is VALID [2022-04-27 14:56:05,957 INFO L290 TraceCheckUtils]: 31: Hoare triple {1122#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1126#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:56:05,957 INFO L272 TraceCheckUtils]: 30: Hoare triple {1142#(= main_~t~0 (+ (* main_~a~0 2) 1))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {1122#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:56:05,958 INFO L290 TraceCheckUtils]: 29: Hoare triple {1142#(= main_~t~0 (+ (* main_~a~0 2) 1))} assume !false; {1142#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-27 14:56:05,958 INFO L290 TraceCheckUtils]: 28: Hoare triple {1142#(= 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; {1142#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-27 14:56:05,959 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1025#true} {1142#(= main_~t~0 (+ (* main_~a~0 2) 1))} #61#return; {1142#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-27 14:56:05,959 INFO L290 TraceCheckUtils]: 26: Hoare triple {1025#true} assume true; {1025#true} is VALID [2022-04-27 14:56:05,959 INFO L290 TraceCheckUtils]: 25: Hoare triple {1025#true} assume !(0 == ~cond); {1025#true} is VALID [2022-04-27 14:56:05,959 INFO L290 TraceCheckUtils]: 24: Hoare triple {1025#true} ~cond := #in~cond; {1025#true} is VALID [2022-04-27 14:56:05,959 INFO L272 TraceCheckUtils]: 23: Hoare triple {1142#(= 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)); {1025#true} is VALID [2022-04-27 14:56:05,960 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1025#true} {1142#(= main_~t~0 (+ (* main_~a~0 2) 1))} #59#return; {1142#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-27 14:56:05,960 INFO L290 TraceCheckUtils]: 21: Hoare triple {1025#true} assume true; {1025#true} is VALID [2022-04-27 14:56:05,960 INFO L290 TraceCheckUtils]: 20: Hoare triple {1025#true} assume !(0 == ~cond); {1025#true} is VALID [2022-04-27 14:56:05,960 INFO L290 TraceCheckUtils]: 19: Hoare triple {1025#true} ~cond := #in~cond; {1025#true} is VALID [2022-04-27 14:56:05,960 INFO L272 TraceCheckUtils]: 18: Hoare triple {1142#(= main_~t~0 (+ (* main_~a~0 2) 1))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {1025#true} is VALID [2022-04-27 14:56:05,960 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1025#true} {1142#(= main_~t~0 (+ (* main_~a~0 2) 1))} #57#return; {1142#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-27 14:56:05,960 INFO L290 TraceCheckUtils]: 16: Hoare triple {1025#true} assume true; {1025#true} is VALID [2022-04-27 14:56:05,961 INFO L290 TraceCheckUtils]: 15: Hoare triple {1025#true} assume !(0 == ~cond); {1025#true} is VALID [2022-04-27 14:56:05,961 INFO L290 TraceCheckUtils]: 14: Hoare triple {1025#true} ~cond := #in~cond; {1025#true} is VALID [2022-04-27 14:56:05,961 INFO L272 TraceCheckUtils]: 13: Hoare triple {1142#(= main_~t~0 (+ (* main_~a~0 2) 1))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {1025#true} is VALID [2022-04-27 14:56:05,961 INFO L290 TraceCheckUtils]: 12: Hoare triple {1142#(= main_~t~0 (+ (* main_~a~0 2) 1))} assume !false; {1142#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-27 14:56:05,961 INFO L290 TraceCheckUtils]: 11: Hoare triple {1025#true} ~a~0 := 0;~s~0 := 1;~t~0 := 1; {1142#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-27 14:56:05,961 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1025#true} {1025#true} #55#return; {1025#true} is VALID [2022-04-27 14:56:05,962 INFO L290 TraceCheckUtils]: 9: Hoare triple {1025#true} assume true; {1025#true} is VALID [2022-04-27 14:56:05,962 INFO L290 TraceCheckUtils]: 8: Hoare triple {1025#true} assume !(0 == ~cond); {1025#true} is VALID [2022-04-27 14:56:05,962 INFO L290 TraceCheckUtils]: 7: Hoare triple {1025#true} ~cond := #in~cond; {1025#true} is VALID [2022-04-27 14:56:05,962 INFO L272 TraceCheckUtils]: 6: Hoare triple {1025#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 <= 20 then 1 else 0)); {1025#true} is VALID [2022-04-27 14:56:05,962 INFO L290 TraceCheckUtils]: 5: Hoare triple {1025#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; {1025#true} is VALID [2022-04-27 14:56:05,962 INFO L272 TraceCheckUtils]: 4: Hoare triple {1025#true} call #t~ret5 := main(); {1025#true} is VALID [2022-04-27 14:56:05,962 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1025#true} {1025#true} #69#return; {1025#true} is VALID [2022-04-27 14:56:05,962 INFO L290 TraceCheckUtils]: 2: Hoare triple {1025#true} assume true; {1025#true} is VALID [2022-04-27 14:56:05,962 INFO L290 TraceCheckUtils]: 1: Hoare triple {1025#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); {1025#true} is VALID [2022-04-27 14:56:05,962 INFO L272 TraceCheckUtils]: 0: Hoare triple {1025#true} call ULTIMATE.init(); {1025#true} is VALID [2022-04-27 14:56:05,962 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-04-27 14:56:05,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:56:05,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984496152] [2022-04-27 14:56:05,963 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:56:05,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [868507825] [2022-04-27 14:56:05,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [868507825] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 14:56:05,963 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:56:05,963 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-27 14:56:05,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396887763] [2022-04-27 14:56:05,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:56:05,964 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34 [2022-04-27 14:56:05,965 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:56:05,965 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 14:56:05,984 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:56:05,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 14:56:05,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:56:05,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 14:56:05,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-27 14:56:05,985 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 14:56:06,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:56:06,079 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2022-04-27 14:56:06,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 14:56:06,079 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34 [2022-04-27 14:56:06,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:56:06,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 14:56:06,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2022-04-27 14:56:06,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 14:56:06,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2022-04-27 14:56:06,081 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 36 transitions. [2022-04-27 14:56:06,119 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:56:06,120 INFO L225 Difference]: With dead ends: 49 [2022-04-27 14:56:06,120 INFO L226 Difference]: Without dead ends: 47 [2022-04-27 14:56:06,121 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 60 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:56:06,121 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 6 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 14:56:06,121 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 79 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 14:56:06,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-27 14:56:06,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-04-27 14:56:06,128 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:56:06,128 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 47 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 14:56:06,128 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 47 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 14:56:06,129 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 47 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 14:56:06,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:56:06,130 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2022-04-27 14:56:06,130 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2022-04-27 14:56:06,130 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:56:06,130 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:56:06,130 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 47 states. [2022-04-27 14:56:06,130 INFO L87 Difference]: Start difference. First operand has 47 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 47 states. [2022-04-27 14:56:06,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:56:06,132 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2022-04-27 14:56:06,132 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2022-04-27 14:56:06,132 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:56:06,132 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:56:06,132 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:56:06,132 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:56:06,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 14:56:06,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2022-04-27 14:56:06,133 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 34 [2022-04-27 14:56:06,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:56:06,133 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2022-04-27 14:56:06,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 14:56:06,134 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2022-04-27 14:56:06,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-27 14:56:06,134 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:56:06,134 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:56:06,153 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:56:06,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:56:06,354 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:56:06,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:56:06,354 INFO L85 PathProgramCache]: Analyzing trace with hash 398970980, now seen corresponding path program 2 times [2022-04-27 14:56:06,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:56:06,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440984294] [2022-04-27 14:56:06,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:56:06,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:56:06,366 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:56:06,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [129916518] [2022-04-27 14:56:06,367 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 14:56:06,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:56:06,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:56:06,368 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:56:06,369 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:56:06,401 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 14:56:06,401 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:56:06,402 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-27 14:56:06,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:56:06,419 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:56:06,583 INFO L272 TraceCheckUtils]: 0: Hoare triple {1471#true} call ULTIMATE.init(); {1471#true} is VALID [2022-04-27 14:56:06,583 INFO L290 TraceCheckUtils]: 1: Hoare triple {1471#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); {1471#true} is VALID [2022-04-27 14:56:06,583 INFO L290 TraceCheckUtils]: 2: Hoare triple {1471#true} assume true; {1471#true} is VALID [2022-04-27 14:56:06,583 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1471#true} {1471#true} #69#return; {1471#true} is VALID [2022-04-27 14:56:06,583 INFO L272 TraceCheckUtils]: 4: Hoare triple {1471#true} call #t~ret5 := main(); {1471#true} is VALID [2022-04-27 14:56:06,583 INFO L290 TraceCheckUtils]: 5: Hoare triple {1471#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; {1471#true} is VALID [2022-04-27 14:56:06,584 INFO L272 TraceCheckUtils]: 6: Hoare triple {1471#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 <= 20 then 1 else 0)); {1471#true} is VALID [2022-04-27 14:56:06,584 INFO L290 TraceCheckUtils]: 7: Hoare triple {1471#true} ~cond := #in~cond; {1471#true} is VALID [2022-04-27 14:56:06,584 INFO L290 TraceCheckUtils]: 8: Hoare triple {1471#true} assume !(0 == ~cond); {1471#true} is VALID [2022-04-27 14:56:06,584 INFO L290 TraceCheckUtils]: 9: Hoare triple {1471#true} assume true; {1471#true} is VALID [2022-04-27 14:56:06,584 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1471#true} {1471#true} #55#return; {1471#true} is VALID [2022-04-27 14:56:06,586 INFO L290 TraceCheckUtils]: 11: Hoare triple {1471#true} ~a~0 := 0;~s~0 := 1;~t~0 := 1; {1509#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-27 14:56:06,586 INFO L290 TraceCheckUtils]: 12: Hoare triple {1509#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} assume !false; {1509#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-27 14:56:06,586 INFO L272 TraceCheckUtils]: 13: Hoare triple {1509#(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)); {1471#true} is VALID [2022-04-27 14:56:06,586 INFO L290 TraceCheckUtils]: 14: Hoare triple {1471#true} ~cond := #in~cond; {1471#true} is VALID [2022-04-27 14:56:06,586 INFO L290 TraceCheckUtils]: 15: Hoare triple {1471#true} assume !(0 == ~cond); {1471#true} is VALID [2022-04-27 14:56:06,586 INFO L290 TraceCheckUtils]: 16: Hoare triple {1471#true} assume true; {1471#true} is VALID [2022-04-27 14:56:06,588 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1471#true} {1509#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} #57#return; {1509#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-27 14:56:06,588 INFO L272 TraceCheckUtils]: 18: Hoare triple {1509#(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)); {1471#true} is VALID [2022-04-27 14:56:06,588 INFO L290 TraceCheckUtils]: 19: Hoare triple {1471#true} ~cond := #in~cond; {1471#true} is VALID [2022-04-27 14:56:06,588 INFO L290 TraceCheckUtils]: 20: Hoare triple {1471#true} assume !(0 == ~cond); {1471#true} is VALID [2022-04-27 14:56:06,588 INFO L290 TraceCheckUtils]: 21: Hoare triple {1471#true} assume true; {1471#true} is VALID [2022-04-27 14:56:06,590 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1471#true} {1509#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} #59#return; {1509#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-27 14:56:06,590 INFO L272 TraceCheckUtils]: 23: Hoare triple {1509#(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)); {1471#true} is VALID [2022-04-27 14:56:06,590 INFO L290 TraceCheckUtils]: 24: Hoare triple {1471#true} ~cond := #in~cond; {1471#true} is VALID [2022-04-27 14:56:06,590 INFO L290 TraceCheckUtils]: 25: Hoare triple {1471#true} assume !(0 == ~cond); {1471#true} is VALID [2022-04-27 14:56:06,590 INFO L290 TraceCheckUtils]: 26: Hoare triple {1471#true} assume true; {1471#true} is VALID [2022-04-27 14:56:06,591 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1471#true} {1509#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} #61#return; {1509#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-27 14:56:06,591 INFO L290 TraceCheckUtils]: 28: Hoare triple {1509#(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; {1561#(and (= (+ main_~s~0 (- 3)) 1) (= (+ (- 1) main_~a~0) 0))} is VALID [2022-04-27 14:56:06,591 INFO L290 TraceCheckUtils]: 29: Hoare triple {1561#(and (= (+ main_~s~0 (- 3)) 1) (= (+ (- 1) main_~a~0) 0))} assume !false; {1561#(and (= (+ main_~s~0 (- 3)) 1) (= (+ (- 1) main_~a~0) 0))} is VALID [2022-04-27 14:56:06,591 INFO L272 TraceCheckUtils]: 30: Hoare triple {1561#(and (= (+ main_~s~0 (- 3)) 1) (= (+ (- 1) main_~a~0) 0))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {1471#true} is VALID [2022-04-27 14:56:06,592 INFO L290 TraceCheckUtils]: 31: Hoare triple {1471#true} ~cond := #in~cond; {1471#true} is VALID [2022-04-27 14:56:06,592 INFO L290 TraceCheckUtils]: 32: Hoare triple {1471#true} assume !(0 == ~cond); {1471#true} is VALID [2022-04-27 14:56:06,592 INFO L290 TraceCheckUtils]: 33: Hoare triple {1471#true} assume true; {1471#true} is VALID [2022-04-27 14:56:06,595 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1471#true} {1561#(and (= (+ main_~s~0 (- 3)) 1) (= (+ (- 1) main_~a~0) 0))} #57#return; {1561#(and (= (+ main_~s~0 (- 3)) 1) (= (+ (- 1) main_~a~0) 0))} is VALID [2022-04-27 14:56:06,595 INFO L272 TraceCheckUtils]: 35: Hoare triple {1561#(and (= (+ main_~s~0 (- 3)) 1) (= (+ (- 1) main_~a~0) 0))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {1583#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:56:06,596 INFO L290 TraceCheckUtils]: 36: Hoare triple {1583#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1587#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:56:06,596 INFO L290 TraceCheckUtils]: 37: Hoare triple {1587#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1472#false} is VALID [2022-04-27 14:56:06,596 INFO L290 TraceCheckUtils]: 38: Hoare triple {1472#false} assume !false; {1472#false} is VALID [2022-04-27 14:56:06,596 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-27 14:56:06,596 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:56:06,738 INFO L290 TraceCheckUtils]: 38: Hoare triple {1472#false} assume !false; {1472#false} is VALID [2022-04-27 14:56:06,738 INFO L290 TraceCheckUtils]: 37: Hoare triple {1587#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1472#false} is VALID [2022-04-27 14:56:06,739 INFO L290 TraceCheckUtils]: 36: Hoare triple {1583#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1587#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:56:06,739 INFO L272 TraceCheckUtils]: 35: Hoare triple {1603#(= (+ (* 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)); {1583#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:56:06,740 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1471#true} {1603#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} #57#return; {1603#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} is VALID [2022-04-27 14:56:06,740 INFO L290 TraceCheckUtils]: 33: Hoare triple {1471#true} assume true; {1471#true} is VALID [2022-04-27 14:56:06,740 INFO L290 TraceCheckUtils]: 32: Hoare triple {1471#true} assume !(0 == ~cond); {1471#true} is VALID [2022-04-27 14:56:06,740 INFO L290 TraceCheckUtils]: 31: Hoare triple {1471#true} ~cond := #in~cond; {1471#true} is VALID [2022-04-27 14:56:06,740 INFO L272 TraceCheckUtils]: 30: Hoare triple {1603#(= (+ (* 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)); {1471#true} is VALID [2022-04-27 14:56:06,741 INFO L290 TraceCheckUtils]: 29: Hoare triple {1603#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} assume !false; {1603#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} is VALID [2022-04-27 14:56:06,753 INFO L290 TraceCheckUtils]: 28: Hoare triple {1625#(= (+ (* (+ 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; {1603#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} is VALID [2022-04-27 14:56:06,753 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1471#true} {1625#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} #61#return; {1625#(= (+ (* (+ 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:56:06,753 INFO L290 TraceCheckUtils]: 26: Hoare triple {1471#true} assume true; {1471#true} is VALID [2022-04-27 14:56:06,754 INFO L290 TraceCheckUtils]: 25: Hoare triple {1471#true} assume !(0 == ~cond); {1471#true} is VALID [2022-04-27 14:56:06,754 INFO L290 TraceCheckUtils]: 24: Hoare triple {1471#true} ~cond := #in~cond; {1471#true} is VALID [2022-04-27 14:56:06,754 INFO L272 TraceCheckUtils]: 23: Hoare triple {1625#(= (+ (* (+ 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)); {1471#true} is VALID [2022-04-27 14:56:06,754 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1471#true} {1625#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} #59#return; {1625#(= (+ (* (+ 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:56:06,754 INFO L290 TraceCheckUtils]: 21: Hoare triple {1471#true} assume true; {1471#true} is VALID [2022-04-27 14:56:06,754 INFO L290 TraceCheckUtils]: 20: Hoare triple {1471#true} assume !(0 == ~cond); {1471#true} is VALID [2022-04-27 14:56:06,754 INFO L290 TraceCheckUtils]: 19: Hoare triple {1471#true} ~cond := #in~cond; {1471#true} is VALID [2022-04-27 14:56:06,754 INFO L272 TraceCheckUtils]: 18: Hoare triple {1625#(= (+ (* (+ 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)); {1471#true} is VALID [2022-04-27 14:56:06,755 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1471#true} {1625#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} #57#return; {1625#(= (+ (* (+ 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:56:06,755 INFO L290 TraceCheckUtils]: 16: Hoare triple {1471#true} assume true; {1471#true} is VALID [2022-04-27 14:56:06,755 INFO L290 TraceCheckUtils]: 15: Hoare triple {1471#true} assume !(0 == ~cond); {1471#true} is VALID [2022-04-27 14:56:06,755 INFO L290 TraceCheckUtils]: 14: Hoare triple {1471#true} ~cond := #in~cond; {1471#true} is VALID [2022-04-27 14:56:06,755 INFO L272 TraceCheckUtils]: 13: Hoare triple {1625#(= (+ (* (+ 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)); {1471#true} is VALID [2022-04-27 14:56:06,756 INFO L290 TraceCheckUtils]: 12: Hoare triple {1625#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} assume !false; {1625#(= (+ (* (+ 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:56:06,756 INFO L290 TraceCheckUtils]: 11: Hoare triple {1471#true} ~a~0 := 0;~s~0 := 1;~t~0 := 1; {1625#(= (+ (* (+ 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:56:06,756 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1471#true} {1471#true} #55#return; {1471#true} is VALID [2022-04-27 14:56:06,757 INFO L290 TraceCheckUtils]: 9: Hoare triple {1471#true} assume true; {1471#true} is VALID [2022-04-27 14:56:06,757 INFO L290 TraceCheckUtils]: 8: Hoare triple {1471#true} assume !(0 == ~cond); {1471#true} is VALID [2022-04-27 14:56:06,757 INFO L290 TraceCheckUtils]: 7: Hoare triple {1471#true} ~cond := #in~cond; {1471#true} is VALID [2022-04-27 14:56:06,757 INFO L272 TraceCheckUtils]: 6: Hoare triple {1471#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 <= 20 then 1 else 0)); {1471#true} is VALID [2022-04-27 14:56:06,757 INFO L290 TraceCheckUtils]: 5: Hoare triple {1471#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; {1471#true} is VALID [2022-04-27 14:56:06,757 INFO L272 TraceCheckUtils]: 4: Hoare triple {1471#true} call #t~ret5 := main(); {1471#true} is VALID [2022-04-27 14:56:06,757 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1471#true} {1471#true} #69#return; {1471#true} is VALID [2022-04-27 14:56:06,757 INFO L290 TraceCheckUtils]: 2: Hoare triple {1471#true} assume true; {1471#true} is VALID [2022-04-27 14:56:06,757 INFO L290 TraceCheckUtils]: 1: Hoare triple {1471#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); {1471#true} is VALID [2022-04-27 14:56:06,757 INFO L272 TraceCheckUtils]: 0: Hoare triple {1471#true} call ULTIMATE.init(); {1471#true} is VALID [2022-04-27 14:56:06,757 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-27 14:56:06,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:56:06,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440984294] [2022-04-27 14:56:06,758 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:56:06,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [129916518] [2022-04-27 14:56:06,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [129916518] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 14:56:06,758 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 14:56:06,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-04-27 14:56:06,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70665136] [2022-04-27 14:56:06,758 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 14:56:06,758 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, (13), 2 states have call predecessors, (13), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) Word has length 39 [2022-04-27 14:56:06,759 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:56:06,759 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, (13), 2 states have call predecessors, (13), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2022-04-27 14:56:06,797 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:56:06,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 14:56:06,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:56:06,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 14:56:06,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-27 14:56:06,798 INFO L87 Difference]: Start difference. First operand 47 states and 51 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, (13), 2 states have call predecessors, (13), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2022-04-27 14:56:07,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:56:07,227 INFO L93 Difference]: Finished difference Result 55 states and 65 transitions. [2022-04-27 14:56:07,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 14:56:07,228 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, (13), 2 states have call predecessors, (13), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) Word has length 39 [2022-04-27 14:56:07,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:56:07,228 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, (13), 2 states have call predecessors, (13), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2022-04-27 14:56:07,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 53 transitions. [2022-04-27 14:56:07,229 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, (13), 2 states have call predecessors, (13), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2022-04-27 14:56:07,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 53 transitions. [2022-04-27 14:56:07,230 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 53 transitions. [2022-04-27 14:56:07,290 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:56:07,290 INFO L225 Difference]: With dead ends: 55 [2022-04-27 14:56:07,290 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 14:56:07,291 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 70 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:56:07,292 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 9 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 14:56:07,293 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 98 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 14:56:07,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 14:56:07,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 14:56:07,293 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:56:07,293 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:56:07,293 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:56:07,293 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:56:07,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:56:07,293 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 14:56:07,294 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 14:56:07,294 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:56:07,294 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:56:07,294 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:56:07,294 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:56:07,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:56:07,294 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 14:56:07,294 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 14:56:07,294 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:56:07,294 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:56:07,294 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:56:07,294 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:56:07,294 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:56:07,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 14:56:07,294 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 39 [2022-04-27 14:56:07,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:56:07,294 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 14:56:07,295 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, (13), 2 states have call predecessors, (13), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2022-04-27 14:56:07,295 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 14:56:07,295 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:56:07,296 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 14:56:07,315 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-04-27 14:56:07,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:56:07,505 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-27 14:56:07,665 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 5) no Hoare annotation was computed. [2022-04-27 14:56:07,665 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 5) no Hoare annotation was computed. [2022-04-27 14:56:07,665 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 5) no Hoare annotation was computed. [2022-04-27 14:56:07,666 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 8 10) the Hoare annotation is: true [2022-04-27 14:56:07,666 INFO L899 garLoopResultBuilder]: For program point L9(line 9) no Hoare annotation was computed. [2022-04-27 14:56:07,666 INFO L899 garLoopResultBuilder]: For program point L9-2(lines 8 10) no Hoare annotation was computed. [2022-04-27 14:56:07,666 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 8 10) no Hoare annotation was computed. [2022-04-27 14:56:07,666 INFO L899 garLoopResultBuilder]: For program point L33(lines 30 42) no Hoare annotation was computed. [2022-04-27 14:56:07,666 INFO L895 garLoopResultBuilder]: At program point L31(line 31) the Hoare annotation is: (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))) [2022-04-27 14:56:07,666 INFO L895 garLoopResultBuilder]: At program point L31-1(line 31) the Hoare annotation is: (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))) [2022-04-27 14:56:07,666 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 20 49) no Hoare annotation was computed. [2022-04-27 14:56:07,666 INFO L899 garLoopResultBuilder]: For program point L46(line 46) no Hoare annotation was computed. [2022-04-27 14:56:07,666 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 20 49) no Hoare annotation was computed. [2022-04-27 14:56:07,666 INFO L895 garLoopResultBuilder]: At program point L44(line 44) the Hoare annotation is: (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))) [2022-04-27 14:56:07,666 INFO L895 garLoopResultBuilder]: At program point L32(line 32) the Hoare annotation is: (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))) [2022-04-27 14:56:07,666 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 20 49) the Hoare annotation is: true [2022-04-27 14:56:07,666 INFO L895 garLoopResultBuilder]: At program point L30-2(lines 30 42) the Hoare annotation is: (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))) [2022-04-27 14:56:07,666 INFO L895 garLoopResultBuilder]: At program point L30-3(lines 30 42) the Hoare annotation is: (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))) [2022-04-27 14:56:07,666 INFO L902 garLoopResultBuilder]: At program point L24(line 24) the Hoare annotation is: true [2022-04-27 14:56:07,666 INFO L899 garLoopResultBuilder]: For program point L24-1(line 24) no Hoare annotation was computed. [2022-04-27 14:56:07,666 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))) [2022-04-27 14:56:07,667 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-27 14:56:07,667 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-27 14:56:07,667 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-27 14:56:07,667 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-27 14:56:07,667 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-27 14:56:07,667 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-27 14:56:07,667 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-27 14:56:07,667 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 11 17) the Hoare annotation is: true [2022-04-27 14:56:07,667 INFO L899 garLoopResultBuilder]: For program point L13(lines 13 14) no Hoare annotation was computed. [2022-04-27 14:56:07,667 INFO L899 garLoopResultBuilder]: For program point L12(lines 12 15) no Hoare annotation was computed. [2022-04-27 14:56:07,667 INFO L899 garLoopResultBuilder]: For program point L12-2(lines 11 17) no Hoare annotation was computed. [2022-04-27 14:56:07,667 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 11 17) no Hoare annotation was computed. [2022-04-27 14:56:07,667 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 14) no Hoare annotation was computed. [2022-04-27 14:56:07,669 INFO L356 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1] [2022-04-27 14:56:07,670 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 14:56:07,672 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 14:56:07,672 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 14:56:07,673 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-27 14:56:07,673 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-27 14:56:07,673 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-27 14:56:07,673 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 14:56:07,673 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 14:56:07,673 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-27 14:56:07,673 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-27 14:56:07,673 WARN L170 areAnnotationChecker]: L24-1 has no Hoare annotation [2022-04-27 14:56:07,673 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-27 14:56:07,673 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-27 14:56:07,673 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 14:56:07,673 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 14:56:07,673 WARN L170 areAnnotationChecker]: L9-2 has no Hoare annotation [2022-04-27 14:56:07,674 WARN L170 areAnnotationChecker]: L24-1 has no Hoare annotation [2022-04-27 14:56:07,674 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-27 14:56:07,674 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-27 14:56:07,674 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2022-04-27 14:56:07,674 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-27 14:56:07,675 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 14:56:07,675 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 14:56:07,675 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 14:56:07,675 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 14:56:07,675 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 14:56:07,675 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 14:56:07,675 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2022-04-27 14:56:07,675 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2022-04-27 14:56:07,675 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2022-04-27 14:56:07,675 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2022-04-27 14:56:07,675 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2022-04-27 14:56:07,675 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 14:56:07,675 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 14:56:07,675 INFO L163 areAnnotationChecker]: CFG has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 14:56:07,680 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 02:56:07 BoogieIcfgContainer [2022-04-27 14:56:07,681 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 14:56:07,681 INFO L158 Benchmark]: Toolchain (without parser) took 5242.68ms. Allocated memory was 168.8MB in the beginning and 208.7MB in the end (delta: 39.8MB). Free memory was 117.7MB in the beginning and 145.8MB in the end (delta: -28.1MB). Peak memory consumption was 12.1MB. Max. memory is 8.0GB. [2022-04-27 14:56:07,682 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 168.8MB. Free memory was 134.4MB in the beginning and 134.3MB in the end (delta: 74.4kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 14:56:07,682 INFO L158 Benchmark]: CACSL2BoogieTranslator took 187.08ms. Allocated memory was 168.8MB in the beginning and 208.7MB in the end (delta: 39.8MB). Free memory was 117.5MB in the beginning and 184.3MB in the end (delta: -66.8MB). Peak memory consumption was 14.6MB. Max. memory is 8.0GB. [2022-04-27 14:56:07,682 INFO L158 Benchmark]: Boogie Preprocessor took 30.23ms. Allocated memory is still 208.7MB. Free memory was 184.3MB in the beginning and 182.9MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 14:56:07,682 INFO L158 Benchmark]: RCFGBuilder took 302.46ms. Allocated memory is still 208.7MB. Free memory was 182.9MB in the beginning and 171.4MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-27 14:56:07,682 INFO L158 Benchmark]: TraceAbstraction took 4715.33ms. Allocated memory is still 208.7MB. Free memory was 170.7MB in the beginning and 145.8MB in the end (delta: 24.9MB). Peak memory consumption was 25.8MB. Max. memory is 8.0GB. [2022-04-27 14:56:07,683 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.09ms. Allocated memory is still 168.8MB. Free memory was 134.4MB in the beginning and 134.3MB in the end (delta: 74.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 187.08ms. Allocated memory was 168.8MB in the beginning and 208.7MB in the end (delta: 39.8MB). Free memory was 117.5MB in the beginning and 184.3MB in the end (delta: -66.8MB). Peak memory consumption was 14.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 30.23ms. Allocated memory is still 208.7MB. Free memory was 184.3MB in the beginning and 182.9MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 302.46ms. Allocated memory is still 208.7MB. Free memory was 182.9MB in the beginning and 171.4MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 4715.33ms. Allocated memory is still 208.7MB. Free memory was 170.7MB in the beginning and 145.8MB in the end (delta: 24.9MB). Peak memory consumption was 25.8MB. 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, 34 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.6s, OverallIterations: 6, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 89 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 67 mSDsluCounter, 457 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 289 mSDsCounter, 68 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 353 IncrementalHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 68 mSolverCounterUnsat, 168 mSDtfsCounter, 353 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 217 GetRequests, 182 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=47occurred in iteration=5, InterpolantAutomatonStates: 32, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 3 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 14 LocationsWithAnnotation, 37 PreInvPairs, 58 NumberOfFragments, 161 HoareAnnotationTreeSize, 37 FomulaSimplifications, 4 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 14 FomulaSimplificationsInter, 476 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 156 NumberOfCodeBlocks, 156 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 221 ConstructedInterpolants, 0 QuantifiedInterpolants, 603 SizeOfPredicates, 5 NumberOfNonLiveVariables, 378 ConjunctsInSsa, 40 ConjunctsInUnsatCore, 8 InterpolantComputations, 5 PerfectInterpolantSequences, 112/120 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: t + s == a * 4 + 2 + a * a && t == a * 2 + 1 RESULT: Ultimate proved your program to be correct! [2022-04-27 14:56:07,696 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...