/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/cohencu-ll_unwindbound2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-14 15:10:03,775 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-14 15:10:03,776 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-14 15:10:03,824 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-14 15:10:03,824 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-14 15:10:03,827 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-14 15:10:03,830 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-14 15:10:03,833 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-14 15:10:03,834 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-14 15:10:03,837 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-14 15:10:03,838 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-14 15:10:03,839 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-14 15:10:03,839 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-14 15:10:03,839 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-14 15:10:03,840 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-14 15:10:03,840 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-14 15:10:03,841 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-14 15:10:03,841 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-14 15:10:03,842 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-14 15:10:03,843 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-14 15:10:03,844 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-14 15:10:03,848 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-14 15:10:03,849 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-14 15:10:03,849 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-14 15:10:03,850 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-14 15:10:03,859 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-14 15:10:03,859 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-14 15:10:03,859 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-14 15:10:03,860 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-14 15:10:03,860 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-14 15:10:03,861 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-14 15:10:03,861 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-14 15:10:03,861 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-14 15:10:03,862 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-14 15:10:03,862 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-14 15:10:03,863 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-14 15:10:03,863 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-14 15:10:03,863 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-14 15:10:03,863 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-14 15:10:03,863 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-14 15:10:03,864 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-14 15:10:03,869 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-14 15:10:03,870 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-14 15:10:03,892 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-14 15:10:03,893 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-14 15:10:03,893 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-14 15:10:03,893 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-14 15:10:03,893 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-14 15:10:03,894 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-14 15:10:03,894 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-14 15:10:03,894 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-14 15:10:03,894 INFO L138 SettingsManager]: * Use SBE=true [2022-04-14 15:10:03,895 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-14 15:10:03,895 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-14 15:10:03,895 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-14 15:10:03,895 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-14 15:10:03,895 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-14 15:10:03,895 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-14 15:10:03,895 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-14 15:10:03,895 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-14 15:10:03,896 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-14 15:10:03,896 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-14 15:10:03,896 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-14 15:10:03,896 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-14 15:10:03,896 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-14 15:10:03,896 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-14 15:10:03,896 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-14 15:10:03,896 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 15:10:03,896 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-14 15:10:03,896 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-14 15:10:03,896 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-14 15:10:03,897 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-14 15:10:03,897 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-14 15:10:03,897 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-04-14 15:10:03,897 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-14 15:10:03,897 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-14 15:10:03,897 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-14 15:10:04,091 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-14 15:10:04,111 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-14 15:10:04,112 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-14 15:10:04,113 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-14 15:10:04,113 INFO L275 PluginConnector]: CDTParser initialized [2022-04-14 15:10:04,115 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/cohencu-ll_unwindbound2.c [2022-04-14 15:10:04,170 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/086e63cc6/e3d49883cfcd47419c1338030a49ec84/FLAG30ac1de5c [2022-04-14 15:10:04,516 INFO L306 CDTParser]: Found 1 translation units. [2022-04-14 15:10:04,517 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/cohencu-ll_unwindbound2.c [2022-04-14 15:10:04,523 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/086e63cc6/e3d49883cfcd47419c1338030a49ec84/FLAG30ac1de5c [2022-04-14 15:10:04,952 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/086e63cc6/e3d49883cfcd47419c1338030a49ec84 [2022-04-14 15:10:04,953 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-14 15:10:04,954 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-14 15:10:04,955 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-14 15:10:04,970 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-14 15:10:04,973 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-14 15:10:04,973 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 03:10:04" (1/1) ... [2022-04-14 15:10:04,974 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b15cb92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:10:04, skipping insertion in model container [2022-04-14 15:10:04,974 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 03:10:04" (1/1) ... [2022-04-14 15:10:04,978 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-14 15:10:04,987 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-14 15:10:05,124 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/cohencu-ll_unwindbound2.c[588,601] [2022-04-14 15:10:05,157 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 15:10:05,171 INFO L203 MainTranslator]: Completed pre-run [2022-04-14 15:10:05,193 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/cohencu-ll_unwindbound2.c[588,601] [2022-04-14 15:10:05,215 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 15:10:05,243 INFO L208 MainTranslator]: Completed translation [2022-04-14 15:10:05,244 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:10:05 WrapperNode [2022-04-14 15:10:05,244 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-14 15:10:05,245 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-14 15:10:05,245 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-14 15:10:05,245 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-14 15:10:05,255 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:10:05" (1/1) ... [2022-04-14 15:10:05,255 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:10:05" (1/1) ... [2022-04-14 15:10:05,259 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:10:05" (1/1) ... [2022-04-14 15:10:05,259 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:10:05" (1/1) ... [2022-04-14 15:10:05,263 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:10:05" (1/1) ... [2022-04-14 15:10:05,266 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:10:05" (1/1) ... [2022-04-14 15:10:05,266 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:10:05" (1/1) ... [2022-04-14 15:10:05,268 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-14 15:10:05,268 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-14 15:10:05,268 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-14 15:10:05,268 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-14 15:10:05,269 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:10:05" (1/1) ... [2022-04-14 15:10:05,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 15:10:05,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:10:05,291 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-14 15:10:05,293 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-14 15:10:05,316 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-14 15:10:05,316 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-14 15:10:05,316 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-14 15:10:05,316 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-14 15:10:05,316 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-14 15:10:05,316 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-14 15:10:05,316 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-14 15:10:05,316 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-14 15:10:05,316 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-14 15:10:05,317 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-14 15:10:05,317 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ushort [2022-04-14 15:10:05,317 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-14 15:10:05,317 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-14 15:10:05,317 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-14 15:10:05,317 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-14 15:10:05,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-14 15:10:05,317 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-14 15:10:05,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-14 15:10:05,317 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-14 15:10:05,317 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-14 15:10:05,357 INFO L234 CfgBuilder]: Building ICFG [2022-04-14 15:10:05,358 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-14 15:10:05,485 INFO L275 CfgBuilder]: Performing block encoding [2022-04-14 15:10:05,490 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-14 15:10:05,490 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-14 15:10:05,491 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 03:10:05 BoogieIcfgContainer [2022-04-14 15:10:05,491 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-14 15:10:05,492 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-14 15:10:05,492 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-14 15:10:05,494 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-14 15:10:05,495 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 03:10:04" (1/3) ... [2022-04-14 15:10:05,495 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@585d342a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 03:10:05, skipping insertion in model container [2022-04-14 15:10:05,495 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:10:05" (2/3) ... [2022-04-14 15:10:05,495 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@585d342a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 03:10:05, skipping insertion in model container [2022-04-14 15:10:05,495 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 03:10:05" (3/3) ... [2022-04-14 15:10:05,496 INFO L111 eAbstractionObserver]: Analyzing ICFG cohencu-ll_unwindbound2.c [2022-04-14 15:10:05,499 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-14 15:10:05,499 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-14 15:10:05,527 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-14 15:10:05,531 INFO L340 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 [2022-04-14 15:10:05,531 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-14 15:10:05,544 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-14 15:10:05,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-14 15:10:05,547 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:10:05,547 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 15:10:05,548 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:10:05,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:10:05,551 INFO L85 PathProgramCache]: Analyzing trace with hash 1839589780, now seen corresponding path program 1 times [2022-04-14 15:10:05,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:10:05,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340204495] [2022-04-14 15:10:05,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:10:05,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:10:05,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:10:05,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 15:10:05,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:10:05,684 INFO L290 TraceCheckUtils]: 0: Hoare triple {39#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {34#true} is VALID [2022-04-14 15:10:05,684 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#true} assume true; {34#true} is VALID [2022-04-14 15:10:05,684 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34#true} {34#true} #81#return; {34#true} is VALID [2022-04-14 15:10:05,686 INFO L272 TraceCheckUtils]: 0: Hoare triple {34#true} call ULTIMATE.init(); {39#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 15:10:05,686 INFO L290 TraceCheckUtils]: 1: Hoare triple {39#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {34#true} is VALID [2022-04-14 15:10:05,686 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#true} assume true; {34#true} is VALID [2022-04-14 15:10:05,686 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34#true} {34#true} #81#return; {34#true} is VALID [2022-04-14 15:10:05,686 INFO L272 TraceCheckUtils]: 4: Hoare triple {34#true} call #t~ret6 := main(); {34#true} is VALID [2022-04-14 15:10:05,687 INFO L290 TraceCheckUtils]: 5: Hoare triple {34#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {34#true} is VALID [2022-04-14 15:10:05,687 INFO L290 TraceCheckUtils]: 6: Hoare triple {34#true} assume !true; {35#false} is VALID [2022-04-14 15:10:05,687 INFO L272 TraceCheckUtils]: 7: Hoare triple {35#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {35#false} is VALID [2022-04-14 15:10:05,688 INFO L290 TraceCheckUtils]: 8: Hoare triple {35#false} ~cond := #in~cond; {35#false} is VALID [2022-04-14 15:10:05,688 INFO L290 TraceCheckUtils]: 9: Hoare triple {35#false} assume 0 == ~cond; {35#false} is VALID [2022-04-14 15:10:05,688 INFO L290 TraceCheckUtils]: 10: Hoare triple {35#false} assume !false; {35#false} is VALID [2022-04-14 15:10:05,688 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-14 15:10:05,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:10:05,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340204495] [2022-04-14 15:10:05,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340204495] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 15:10:05,689 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 15:10:05,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-14 15:10:05,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278162278] [2022-04-14 15:10:05,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 15:10:05,699 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-14 15:10:05,700 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:10:05,702 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 15:10:05,715 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:10:05,715 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-14 15:10:05,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:10:05,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-14 15:10:05,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-14 15:10:05,735 INFO L87 Difference]: Start difference. First operand has 31 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 15:10:05,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:10:05,903 INFO L93 Difference]: Finished difference Result 57 states and 95 transitions. [2022-04-14 15:10:05,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-14 15:10:05,903 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-14 15:10:05,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:10:05,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 15:10:05,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2022-04-14 15:10:05,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 15:10:05,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2022-04-14 15:10:05,916 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 95 transitions. [2022-04-14 15:10:06,017 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:10:06,026 INFO L225 Difference]: With dead ends: 57 [2022-04-14 15:10:06,027 INFO L226 Difference]: Without dead ends: 27 [2022-04-14 15:10:06,030 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-14 15:10:06,036 INFO L913 BasicCegarLoop]: 41 mSDtfsCounter, 6 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-14 15:10:06,037 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 45 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-14 15:10:06,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-14 15:10:06,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2022-04-14 15:10:06,069 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:10:06,071 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 26 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-14 15:10:06,072 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 26 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-14 15:10:06,073 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 26 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-14 15:10:06,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:10:06,080 INFO L93 Difference]: Finished difference Result 27 states and 38 transitions. [2022-04-14 15:10:06,080 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 38 transitions. [2022-04-14 15:10:06,081 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:10:06,081 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:10:06,082 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 27 states. [2022-04-14 15:10:06,083 INFO L87 Difference]: Start difference. First operand has 26 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 27 states. [2022-04-14 15:10:06,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:10:06,086 INFO L93 Difference]: Finished difference Result 27 states and 38 transitions. [2022-04-14 15:10:06,086 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 38 transitions. [2022-04-14 15:10:06,087 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:10:06,087 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:10:06,087 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:10:06,087 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:10:06,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-14 15:10:06,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2022-04-14 15:10:06,092 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 11 [2022-04-14 15:10:06,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:10:06,092 INFO L478 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2022-04-14 15:10:06,093 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 15:10:06,094 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2022-04-14 15:10:06,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-14 15:10:06,097 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:10:06,097 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 15:10:06,102 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-14 15:10:06,102 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:10:06,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:10:06,103 INFO L85 PathProgramCache]: Analyzing trace with hash 660459433, now seen corresponding path program 1 times [2022-04-14 15:10:06,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:10:06,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884025082] [2022-04-14 15:10:06,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:10:06,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:10:06,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:10:06,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 15:10:06,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:10:06,216 INFO L290 TraceCheckUtils]: 0: Hoare triple {234#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {232#(= ~counter~0 0)} is VALID [2022-04-14 15:10:06,217 INFO L290 TraceCheckUtils]: 1: Hoare triple {232#(= ~counter~0 0)} assume true; {232#(= ~counter~0 0)} is VALID [2022-04-14 15:10:06,218 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {232#(= ~counter~0 0)} {227#true} #81#return; {232#(= ~counter~0 0)} is VALID [2022-04-14 15:10:06,219 INFO L272 TraceCheckUtils]: 0: Hoare triple {227#true} call ULTIMATE.init(); {234#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 15:10:06,219 INFO L290 TraceCheckUtils]: 1: Hoare triple {234#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {232#(= ~counter~0 0)} is VALID [2022-04-14 15:10:06,220 INFO L290 TraceCheckUtils]: 2: Hoare triple {232#(= ~counter~0 0)} assume true; {232#(= ~counter~0 0)} is VALID [2022-04-14 15:10:06,221 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {232#(= ~counter~0 0)} {227#true} #81#return; {232#(= ~counter~0 0)} is VALID [2022-04-14 15:10:06,221 INFO L272 TraceCheckUtils]: 4: Hoare triple {232#(= ~counter~0 0)} call #t~ret6 := main(); {232#(= ~counter~0 0)} is VALID [2022-04-14 15:10:06,222 INFO L290 TraceCheckUtils]: 5: Hoare triple {232#(= ~counter~0 0)} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {232#(= ~counter~0 0)} is VALID [2022-04-14 15:10:06,222 INFO L290 TraceCheckUtils]: 6: Hoare triple {232#(= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {233#(= |main_#t~post5| 0)} is VALID [2022-04-14 15:10:06,223 INFO L290 TraceCheckUtils]: 7: Hoare triple {233#(= |main_#t~post5| 0)} assume !(#t~post5 < 2);havoc #t~post5; {228#false} is VALID [2022-04-14 15:10:06,223 INFO L272 TraceCheckUtils]: 8: Hoare triple {228#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {228#false} is VALID [2022-04-14 15:10:06,224 INFO L290 TraceCheckUtils]: 9: Hoare triple {228#false} ~cond := #in~cond; {228#false} is VALID [2022-04-14 15:10:06,225 INFO L290 TraceCheckUtils]: 10: Hoare triple {228#false} assume 0 == ~cond; {228#false} is VALID [2022-04-14 15:10:06,225 INFO L290 TraceCheckUtils]: 11: Hoare triple {228#false} assume !false; {228#false} is VALID [2022-04-14 15:10:06,226 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-14 15:10:06,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:10:06,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884025082] [2022-04-14 15:10:06,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884025082] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 15:10:06,227 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 15:10:06,227 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 15:10:06,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119202600] [2022-04-14 15:10:06,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 15:10:06,229 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-14 15:10:06,229 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:10:06,229 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 15:10:06,238 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:10:06,238 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 15:10:06,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:10:06,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 15:10:06,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-14 15:10:06,239 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 15:10:06,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:10:06,467 INFO L93 Difference]: Finished difference Result 40 states and 56 transitions. [2022-04-14 15:10:06,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-14 15:10:06,467 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-14 15:10:06,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:10:06,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 15:10:06,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 56 transitions. [2022-04-14 15:10:06,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 15:10:06,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 56 transitions. [2022-04-14 15:10:06,479 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 56 transitions. [2022-04-14 15:10:06,528 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:10:06,529 INFO L225 Difference]: With dead ends: 40 [2022-04-14 15:10:06,529 INFO L226 Difference]: Without dead ends: 28 [2022-04-14 15:10:06,529 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-14 15:10:06,530 INFO L913 BasicCegarLoop]: 35 mSDtfsCounter, 6 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-14 15:10:06,531 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 69 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-14 15:10:06,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-14 15:10:06,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-04-14 15:10:06,534 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:10:06,535 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 28 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-14 15:10:06,535 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 28 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-14 15:10:06,535 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 28 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-14 15:10:06,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:10:06,537 INFO L93 Difference]: Finished difference Result 28 states and 39 transitions. [2022-04-14 15:10:06,537 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 39 transitions. [2022-04-14 15:10:06,538 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:10:06,538 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:10:06,538 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 28 states. [2022-04-14 15:10:06,538 INFO L87 Difference]: Start difference. First operand has 28 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 28 states. [2022-04-14 15:10:06,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:10:06,540 INFO L93 Difference]: Finished difference Result 28 states and 39 transitions. [2022-04-14 15:10:06,540 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 39 transitions. [2022-04-14 15:10:06,541 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:10:06,541 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:10:06,541 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:10:06,541 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:10:06,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-14 15:10:06,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 39 transitions. [2022-04-14 15:10:06,557 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 39 transitions. Word has length 12 [2022-04-14 15:10:06,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:10:06,557 INFO L478 AbstractCegarLoop]: Abstraction has 28 states and 39 transitions. [2022-04-14 15:10:06,557 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 15:10:06,557 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 39 transitions. [2022-04-14 15:10:06,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-14 15:10:06,558 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:10:06,558 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 15:10:06,558 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-14 15:10:06,558 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:10:06,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:10:06,559 INFO L85 PathProgramCache]: Analyzing trace with hash 662008565, now seen corresponding path program 1 times [2022-04-14 15:10:06,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:10:06,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568316162] [2022-04-14 15:10:06,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:10:06,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:10:06,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:10:06,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 15:10:06,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:10:06,655 INFO L290 TraceCheckUtils]: 0: Hoare triple {414#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {406#true} is VALID [2022-04-14 15:10:06,655 INFO L290 TraceCheckUtils]: 1: Hoare triple {406#true} assume true; {406#true} is VALID [2022-04-14 15:10:06,656 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {406#true} {406#true} #81#return; {406#true} is VALID [2022-04-14 15:10:06,656 INFO L272 TraceCheckUtils]: 0: Hoare triple {406#true} call ULTIMATE.init(); {414#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 15:10:06,657 INFO L290 TraceCheckUtils]: 1: Hoare triple {414#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {406#true} is VALID [2022-04-14 15:10:06,657 INFO L290 TraceCheckUtils]: 2: Hoare triple {406#true} assume true; {406#true} is VALID [2022-04-14 15:10:06,657 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {406#true} {406#true} #81#return; {406#true} is VALID [2022-04-14 15:10:06,657 INFO L272 TraceCheckUtils]: 4: Hoare triple {406#true} call #t~ret6 := main(); {406#true} is VALID [2022-04-14 15:10:06,658 INFO L290 TraceCheckUtils]: 5: Hoare triple {406#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {411#(= (+ (* main_~n~0 6) 6) main_~z~0)} is VALID [2022-04-14 15:10:06,658 INFO L290 TraceCheckUtils]: 6: Hoare triple {411#(= (+ (* main_~n~0 6) 6) main_~z~0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {411#(= (+ (* main_~n~0 6) 6) main_~z~0)} is VALID [2022-04-14 15:10:06,659 INFO L290 TraceCheckUtils]: 7: Hoare triple {411#(= (+ (* main_~n~0 6) 6) main_~z~0)} assume !!(#t~post5 < 2);havoc #t~post5; {411#(= (+ (* main_~n~0 6) 6) main_~z~0)} is VALID [2022-04-14 15:10:06,659 INFO L272 TraceCheckUtils]: 8: Hoare triple {411#(= (+ (* main_~n~0 6) 6) main_~z~0)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {412#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:10:06,660 INFO L290 TraceCheckUtils]: 9: Hoare triple {412#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {413#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-14 15:10:06,660 INFO L290 TraceCheckUtils]: 10: Hoare triple {413#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {407#false} is VALID [2022-04-14 15:10:06,660 INFO L290 TraceCheckUtils]: 11: Hoare triple {407#false} assume !false; {407#false} is VALID [2022-04-14 15:10:06,661 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-14 15:10:06,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:10:06,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568316162] [2022-04-14 15:10:06,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568316162] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 15:10:06,661 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 15:10:06,661 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-14 15:10:06,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716194826] [2022-04-14 15:10:06,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 15:10:06,662 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-14 15:10:06,662 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:10:06,663 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 15:10:06,677 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:10:06,677 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-14 15:10:06,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:10:06,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-14 15:10:06,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-14 15:10:06,678 INFO L87 Difference]: Start difference. First operand 28 states and 39 transitions. Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 15:10:07,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:10:07,000 INFO L93 Difference]: Finished difference Result 34 states and 44 transitions. [2022-04-14 15:10:07,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-14 15:10:07,001 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-14 15:10:07,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:10:07,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 15:10:07,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 43 transitions. [2022-04-14 15:10:07,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 15:10:07,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 43 transitions. [2022-04-14 15:10:07,003 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 43 transitions. [2022-04-14 15:10:07,040 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-14 15:10:07,041 INFO L225 Difference]: With dead ends: 34 [2022-04-14 15:10:07,042 INFO L226 Difference]: Without dead ends: 32 [2022-04-14 15:10:07,042 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-14 15:10:07,043 INFO L913 BasicCegarLoop]: 30 mSDtfsCounter, 17 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-14 15:10:07,043 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 51 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-14 15:10:07,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-14 15:10:07,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-14 15:10:07,047 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:10:07,048 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-14 15:10:07,048 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-14 15:10:07,048 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-14 15:10:07,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:10:07,050 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2022-04-14 15:10:07,050 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-14 15:10:07,050 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:10:07,050 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:10:07,051 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 32 states. [2022-04-14 15:10:07,051 INFO L87 Difference]: Start difference. First operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 32 states. [2022-04-14 15:10:07,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:10:07,052 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2022-04-14 15:10:07,052 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-14 15:10:07,053 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:10:07,053 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:10:07,053 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:10:07,053 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:10:07,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-14 15:10:07,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2022-04-14 15:10:07,054 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 12 [2022-04-14 15:10:07,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:10:07,055 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2022-04-14 15:10:07,055 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 15:10:07,055 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-14 15:10:07,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-14 15:10:07,055 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:10:07,055 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 15:10:07,055 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-14 15:10:07,055 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:10:07,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:10:07,056 INFO L85 PathProgramCache]: Analyzing trace with hash 2023221563, now seen corresponding path program 1 times [2022-04-14 15:10:07,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:10:07,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329246905] [2022-04-14 15:10:07,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:10:07,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:10:07,068 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 15:10:07,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [537310074] [2022-04-14 15:10:07,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:10:07,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:10:07,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:10:07,070 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-14 15:10:07,104 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-14 15:10:07,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:10:07,127 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-14 15:10:07,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:10:07,140 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 15:10:07,239 INFO L272 TraceCheckUtils]: 0: Hoare triple {593#true} call ULTIMATE.init(); {593#true} is VALID [2022-04-14 15:10:07,239 INFO L290 TraceCheckUtils]: 1: Hoare triple {593#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {593#true} is VALID [2022-04-14 15:10:07,239 INFO L290 TraceCheckUtils]: 2: Hoare triple {593#true} assume true; {593#true} is VALID [2022-04-14 15:10:07,239 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {593#true} {593#true} #81#return; {593#true} is VALID [2022-04-14 15:10:07,239 INFO L272 TraceCheckUtils]: 4: Hoare triple {593#true} call #t~ret6 := main(); {593#true} is VALID [2022-04-14 15:10:07,240 INFO L290 TraceCheckUtils]: 5: Hoare triple {593#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {613#(and (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-14 15:10:07,240 INFO L290 TraceCheckUtils]: 6: Hoare triple {613#(and (= main_~n~0 0) (= main_~y~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {613#(and (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-14 15:10:07,241 INFO L290 TraceCheckUtils]: 7: Hoare triple {613#(and (= main_~n~0 0) (= main_~y~0 1))} assume !!(#t~post5 < 2);havoc #t~post5; {613#(and (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-14 15:10:07,241 INFO L272 TraceCheckUtils]: 8: Hoare triple {613#(and (= main_~n~0 0) (= main_~y~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {593#true} is VALID [2022-04-14 15:10:07,241 INFO L290 TraceCheckUtils]: 9: Hoare triple {593#true} ~cond := #in~cond; {593#true} is VALID [2022-04-14 15:10:07,241 INFO L290 TraceCheckUtils]: 10: Hoare triple {593#true} assume !(0 == ~cond); {593#true} is VALID [2022-04-14 15:10:07,241 INFO L290 TraceCheckUtils]: 11: Hoare triple {593#true} assume true; {593#true} is VALID [2022-04-14 15:10:07,242 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {593#true} {613#(and (= main_~n~0 0) (= main_~y~0 1))} #59#return; {613#(and (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-14 15:10:07,242 INFO L272 TraceCheckUtils]: 13: Hoare triple {613#(and (= main_~n~0 0) (= main_~y~0 1))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {638#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 15:10:07,243 INFO L290 TraceCheckUtils]: 14: Hoare triple {638#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {642#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:10:07,243 INFO L290 TraceCheckUtils]: 15: Hoare triple {642#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {594#false} is VALID [2022-04-14 15:10:07,243 INFO L290 TraceCheckUtils]: 16: Hoare triple {594#false} assume !false; {594#false} is VALID [2022-04-14 15:10:07,243 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-14 15:10:07,244 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-14 15:10:07,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:10:07,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329246905] [2022-04-14 15:10:07,244 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 15:10:07,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [537310074] [2022-04-14 15:10:07,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [537310074] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 15:10:07,244 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 15:10:07,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-14 15:10:07,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546771395] [2022-04-14 15:10:07,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 15:10:07,245 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2022-04-14 15:10:07,245 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:10:07,245 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 15:10:07,256 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-14 15:10:07,256 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 15:10:07,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:10:07,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 15:10:07,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-14 15:10:07,257 INFO L87 Difference]: Start difference. First operand 32 states and 42 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 15:10:07,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:10:07,561 INFO L93 Difference]: Finished difference Result 50 states and 70 transitions. [2022-04-14 15:10:07,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 15:10:07,561 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2022-04-14 15:10:07,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:10:07,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 15:10:07,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-14 15:10:07,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 15:10:07,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-14 15:10:07,564 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 67 transitions. [2022-04-14 15:10:07,601 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:10:07,603 INFO L225 Difference]: With dead ends: 50 [2022-04-14 15:10:07,603 INFO L226 Difference]: Without dead ends: 48 [2022-04-14 15:10:07,603 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-14 15:10:07,604 INFO L913 BasicCegarLoop]: 48 mSDtfsCounter, 6 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-14 15:10:07,604 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 139 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-14 15:10:07,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-04-14 15:10:07,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 38. [2022-04-14 15:10:07,625 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:10:07,626 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand has 38 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-14 15:10:07,626 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand has 38 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-14 15:10:07,626 INFO L87 Difference]: Start difference. First operand 48 states. Second operand has 38 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-14 15:10:07,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:10:07,628 INFO L93 Difference]: Finished difference Result 48 states and 68 transitions. [2022-04-14 15:10:07,628 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 68 transitions. [2022-04-14 15:10:07,629 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:10:07,629 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:10:07,629 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 48 states. [2022-04-14 15:10:07,629 INFO L87 Difference]: Start difference. First operand has 38 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 48 states. [2022-04-14 15:10:07,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:10:07,631 INFO L93 Difference]: Finished difference Result 48 states and 68 transitions. [2022-04-14 15:10:07,631 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 68 transitions. [2022-04-14 15:10:07,632 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:10:07,632 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:10:07,632 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:10:07,632 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:10:07,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-14 15:10:07,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 49 transitions. [2022-04-14 15:10:07,634 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 49 transitions. Word has length 17 [2022-04-14 15:10:07,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:10:07,634 INFO L478 AbstractCegarLoop]: Abstraction has 38 states and 49 transitions. [2022-04-14 15:10:07,634 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 15:10:07,634 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 49 transitions. [2022-04-14 15:10:07,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-14 15:10:07,634 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:10:07,634 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 15:10:07,652 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-14 15:10:07,851 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:10:07,851 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:10:07,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:10:07,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1612678773, now seen corresponding path program 1 times [2022-04-14 15:10:07,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:10:07,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614664248] [2022-04-14 15:10:07,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:10:07,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:10:07,862 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 15:10:07,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1980970788] [2022-04-14 15:10:07,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:10:07,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:10:07,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:10:07,871 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-14 15:10:07,873 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-14 15:10:07,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:10:07,908 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-14 15:10:07,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:10:07,920 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 15:10:08,029 INFO L272 TraceCheckUtils]: 0: Hoare triple {887#true} call ULTIMATE.init(); {887#true} is VALID [2022-04-14 15:10:08,029 INFO L290 TraceCheckUtils]: 1: Hoare triple {887#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {887#true} is VALID [2022-04-14 15:10:08,029 INFO L290 TraceCheckUtils]: 2: Hoare triple {887#true} assume true; {887#true} is VALID [2022-04-14 15:10:08,029 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {887#true} {887#true} #81#return; {887#true} is VALID [2022-04-14 15:10:08,029 INFO L272 TraceCheckUtils]: 4: Hoare triple {887#true} call #t~ret6 := main(); {887#true} is VALID [2022-04-14 15:10:08,033 INFO L290 TraceCheckUtils]: 5: Hoare triple {887#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {907#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-14 15:10:08,034 INFO L290 TraceCheckUtils]: 6: Hoare triple {907#(and (= main_~x~0 0) (= main_~n~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {907#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-14 15:10:08,034 INFO L290 TraceCheckUtils]: 7: Hoare triple {907#(and (= main_~x~0 0) (= main_~n~0 0))} assume !!(#t~post5 < 2);havoc #t~post5; {907#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-14 15:10:08,034 INFO L272 TraceCheckUtils]: 8: Hoare triple {907#(and (= main_~x~0 0) (= main_~n~0 0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {887#true} is VALID [2022-04-14 15:10:08,034 INFO L290 TraceCheckUtils]: 9: Hoare triple {887#true} ~cond := #in~cond; {887#true} is VALID [2022-04-14 15:10:08,035 INFO L290 TraceCheckUtils]: 10: Hoare triple {887#true} assume !(0 == ~cond); {887#true} is VALID [2022-04-14 15:10:08,035 INFO L290 TraceCheckUtils]: 11: Hoare triple {887#true} assume true; {887#true} is VALID [2022-04-14 15:10:08,035 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {887#true} {907#(and (= main_~x~0 0) (= main_~n~0 0))} #59#return; {907#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-14 15:10:08,035 INFO L272 TraceCheckUtils]: 13: Hoare triple {907#(and (= main_~x~0 0) (= main_~n~0 0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {887#true} is VALID [2022-04-14 15:10:08,035 INFO L290 TraceCheckUtils]: 14: Hoare triple {887#true} ~cond := #in~cond; {887#true} is VALID [2022-04-14 15:10:08,036 INFO L290 TraceCheckUtils]: 15: Hoare triple {887#true} assume !(0 == ~cond); {887#true} is VALID [2022-04-14 15:10:08,036 INFO L290 TraceCheckUtils]: 16: Hoare triple {887#true} assume true; {887#true} is VALID [2022-04-14 15:10:08,036 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {887#true} {907#(and (= main_~x~0 0) (= main_~n~0 0))} #61#return; {907#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-14 15:10:08,037 INFO L272 TraceCheckUtils]: 18: Hoare triple {907#(and (= main_~x~0 0) (= main_~n~0 0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {947#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 15:10:08,037 INFO L290 TraceCheckUtils]: 19: Hoare triple {947#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {951#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:10:08,037 INFO L290 TraceCheckUtils]: 20: Hoare triple {951#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {888#false} is VALID [2022-04-14 15:10:08,038 INFO L290 TraceCheckUtils]: 21: Hoare triple {888#false} assume !false; {888#false} is VALID [2022-04-14 15:10:08,038 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-14 15:10:08,038 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-14 15:10:08,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:10:08,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614664248] [2022-04-14 15:10:08,038 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 15:10:08,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1980970788] [2022-04-14 15:10:08,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1980970788] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 15:10:08,038 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 15:10:08,038 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-14 15:10:08,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59116769] [2022-04-14 15:10:08,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 15:10:08,039 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-14 15:10:08,039 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:10:08,039 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-14 15:10:08,056 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:10:08,056 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 15:10:08,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:10:08,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 15:10:08,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-14 15:10:08,057 INFO L87 Difference]: Start difference. First operand 38 states and 49 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-14 15:10:08,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:10:08,271 INFO L93 Difference]: Finished difference Result 54 states and 73 transitions. [2022-04-14 15:10:08,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 15:10:08,271 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-14 15:10:08,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:10:08,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-14 15:10:08,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-14 15:10:08,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-14 15:10:08,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-14 15:10:08,274 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 67 transitions. [2022-04-14 15:10:08,326 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:10:08,328 INFO L225 Difference]: With dead ends: 54 [2022-04-14 15:10:08,328 INFO L226 Difference]: Without dead ends: 52 [2022-04-14 15:10:08,329 INFO L912 BasicCegarLoop]: 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-14 15:10:08,330 INFO L913 BasicCegarLoop]: 48 mSDtfsCounter, 6 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 15:10:08,331 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 144 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 15:10:08,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-14 15:10:08,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 48. [2022-04-14 15:10:08,346 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:10:08,346 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 48 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-14 15:10:08,348 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 48 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-14 15:10:08,350 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 48 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-14 15:10:08,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:10:08,353 INFO L93 Difference]: Finished difference Result 52 states and 71 transitions. [2022-04-14 15:10:08,353 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 71 transitions. [2022-04-14 15:10:08,353 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:10:08,353 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:10:08,353 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Second operand 52 states. [2022-04-14 15:10:08,354 INFO L87 Difference]: Start difference. First operand has 48 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Second operand 52 states. [2022-04-14 15:10:08,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:10:08,356 INFO L93 Difference]: Finished difference Result 52 states and 71 transitions. [2022-04-14 15:10:08,357 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 71 transitions. [2022-04-14 15:10:08,357 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:10:08,357 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:10:08,357 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:10:08,358 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:10:08,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-14 15:10:08,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 64 transitions. [2022-04-14 15:10:08,361 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 64 transitions. Word has length 22 [2022-04-14 15:10:08,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:10:08,361 INFO L478 AbstractCegarLoop]: Abstraction has 48 states and 64 transitions. [2022-04-14 15:10:08,361 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-14 15:10:08,361 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 64 transitions. [2022-04-14 15:10:08,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-14 15:10:08,362 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:10:08,362 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 15:10:08,393 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-14 15:10:08,578 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:10:08,578 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:10:08,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:10:08,579 INFO L85 PathProgramCache]: Analyzing trace with hash 1625830715, now seen corresponding path program 1 times [2022-04-14 15:10:08,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:10:08,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243893131] [2022-04-14 15:10:08,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:10:08,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:10:08,591 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 15:10:08,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [807567415] [2022-04-14 15:10:08,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:10:08,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:10:08,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:10:08,592 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-14 15:10:08,619 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-14 15:10:08,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:10:08,659 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-14 15:10:08,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:10:08,668 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 15:10:08,850 INFO L272 TraceCheckUtils]: 0: Hoare triple {1225#true} call ULTIMATE.init(); {1225#true} is VALID [2022-04-14 15:10:08,850 INFO L290 TraceCheckUtils]: 1: Hoare triple {1225#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1225#true} is VALID [2022-04-14 15:10:08,850 INFO L290 TraceCheckUtils]: 2: Hoare triple {1225#true} assume true; {1225#true} is VALID [2022-04-14 15:10:08,850 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1225#true} {1225#true} #81#return; {1225#true} is VALID [2022-04-14 15:10:08,850 INFO L272 TraceCheckUtils]: 4: Hoare triple {1225#true} call #t~ret6 := main(); {1225#true} is VALID [2022-04-14 15:10:08,851 INFO L290 TraceCheckUtils]: 5: Hoare triple {1225#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {1245#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-14 15:10:08,851 INFO L290 TraceCheckUtils]: 6: Hoare triple {1245#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1245#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-14 15:10:08,852 INFO L290 TraceCheckUtils]: 7: Hoare triple {1245#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !!(#t~post5 < 2);havoc #t~post5; {1245#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-14 15:10:08,852 INFO L272 TraceCheckUtils]: 8: Hoare triple {1245#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {1225#true} is VALID [2022-04-14 15:10:08,852 INFO L290 TraceCheckUtils]: 9: Hoare triple {1225#true} ~cond := #in~cond; {1225#true} is VALID [2022-04-14 15:10:08,852 INFO L290 TraceCheckUtils]: 10: Hoare triple {1225#true} assume !(0 == ~cond); {1225#true} is VALID [2022-04-14 15:10:08,852 INFO L290 TraceCheckUtils]: 11: Hoare triple {1225#true} assume true; {1225#true} is VALID [2022-04-14 15:10:08,853 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1225#true} {1245#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} #59#return; {1245#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-14 15:10:08,853 INFO L272 TraceCheckUtils]: 13: Hoare triple {1245#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {1225#true} is VALID [2022-04-14 15:10:08,853 INFO L290 TraceCheckUtils]: 14: Hoare triple {1225#true} ~cond := #in~cond; {1225#true} is VALID [2022-04-14 15:10:08,853 INFO L290 TraceCheckUtils]: 15: Hoare triple {1225#true} assume !(0 == ~cond); {1225#true} is VALID [2022-04-14 15:10:08,853 INFO L290 TraceCheckUtils]: 16: Hoare triple {1225#true} assume true; {1225#true} is VALID [2022-04-14 15:10:08,854 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1225#true} {1245#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} #61#return; {1245#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-14 15:10:08,854 INFO L272 TraceCheckUtils]: 18: Hoare triple {1245#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {1225#true} is VALID [2022-04-14 15:10:08,854 INFO L290 TraceCheckUtils]: 19: Hoare triple {1225#true} ~cond := #in~cond; {1225#true} is VALID [2022-04-14 15:10:08,854 INFO L290 TraceCheckUtils]: 20: Hoare triple {1225#true} assume !(0 == ~cond); {1225#true} is VALID [2022-04-14 15:10:08,854 INFO L290 TraceCheckUtils]: 21: Hoare triple {1225#true} assume true; {1225#true} is VALID [2022-04-14 15:10:08,855 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1225#true} {1245#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} #63#return; {1245#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-14 15:10:08,856 INFO L272 TraceCheckUtils]: 23: Hoare triple {1245#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {1300#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 15:10:08,856 INFO L290 TraceCheckUtils]: 24: Hoare triple {1300#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1304#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:10:08,857 INFO L290 TraceCheckUtils]: 25: Hoare triple {1304#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1226#false} is VALID [2022-04-14 15:10:08,857 INFO L290 TraceCheckUtils]: 26: Hoare triple {1226#false} assume !false; {1226#false} is VALID [2022-04-14 15:10:08,857 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-14 15:10:08,857 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-14 15:10:08,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:10:08,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243893131] [2022-04-14 15:10:08,857 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 15:10:08,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [807567415] [2022-04-14 15:10:08,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [807567415] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 15:10:08,857 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 15:10:08,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-14 15:10:08,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492117599] [2022-04-14 15:10:08,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 15:10:08,858 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (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-14 15:10:08,858 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:10:08,858 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (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-14 15:10:08,884 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:10:08,884 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 15:10:08,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:10:08,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 15:10:08,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-14 15:10:08,885 INFO L87 Difference]: Start difference. First operand 48 states and 64 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (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-14 15:10:09,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:10:09,162 INFO L93 Difference]: Finished difference Result 62 states and 79 transitions. [2022-04-14 15:10:09,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 15:10:09,162 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (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-14 15:10:09,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:10:09,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (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-14 15:10:09,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-14 15:10:09,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (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-14 15:10:09,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-14 15:10:09,164 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 67 transitions. [2022-04-14 15:10:09,213 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:10:09,214 INFO L225 Difference]: With dead ends: 62 [2022-04-14 15:10:09,214 INFO L226 Difference]: Without dead ends: 50 [2022-04-14 15:10:09,215 INFO L912 BasicCegarLoop]: 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-14 15:10:09,215 INFO L913 BasicCegarLoop]: 46 mSDtfsCounter, 6 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-14 15:10:09,215 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 130 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-14 15:10:09,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-14 15:10:09,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-04-14 15:10:09,224 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:10:09,225 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 50 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-14 15:10:09,225 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 50 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-14 15:10:09,225 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 50 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-14 15:10:09,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:10:09,227 INFO L93 Difference]: Finished difference Result 50 states and 62 transitions. [2022-04-14 15:10:09,227 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2022-04-14 15:10:09,227 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:10:09,227 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:10:09,227 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 50 states. [2022-04-14 15:10:09,228 INFO L87 Difference]: Start difference. First operand has 50 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 50 states. [2022-04-14 15:10:09,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:10:09,229 INFO L93 Difference]: Finished difference Result 50 states and 62 transitions. [2022-04-14 15:10:09,229 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2022-04-14 15:10:09,229 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:10:09,229 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:10:09,229 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:10:09,229 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:10:09,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-14 15:10:09,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 62 transitions. [2022-04-14 15:10:09,233 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 62 transitions. Word has length 27 [2022-04-14 15:10:09,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:10:09,234 INFO L478 AbstractCegarLoop]: Abstraction has 50 states and 62 transitions. [2022-04-14 15:10:09,234 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (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-14 15:10:09,234 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2022-04-14 15:10:09,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-14 15:10:09,235 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:10:09,235 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 15:10:09,263 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-04-14 15:10:09,449 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:10:09,449 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:10:09,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:10:09,450 INFO L85 PathProgramCache]: Analyzing trace with hash 1440923632, now seen corresponding path program 1 times [2022-04-14 15:10:09,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:10:09,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426201234] [2022-04-14 15:10:09,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:10:09,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:10:09,477 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 15:10:09,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [868342145] [2022-04-14 15:10:09,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:10:09,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:10:09,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:10:09,494 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-14 15:10:09,500 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-14 15:10:09,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:10:09,540 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-14 15:10:09,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:10:09,555 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 15:10:09,728 INFO L272 TraceCheckUtils]: 0: Hoare triple {1585#true} call ULTIMATE.init(); {1585#true} is VALID [2022-04-14 15:10:09,729 INFO L290 TraceCheckUtils]: 1: Hoare triple {1585#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1593#(<= ~counter~0 0)} is VALID [2022-04-14 15:10:09,729 INFO L290 TraceCheckUtils]: 2: Hoare triple {1593#(<= ~counter~0 0)} assume true; {1593#(<= ~counter~0 0)} is VALID [2022-04-14 15:10:09,730 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1593#(<= ~counter~0 0)} {1585#true} #81#return; {1593#(<= ~counter~0 0)} is VALID [2022-04-14 15:10:09,730 INFO L272 TraceCheckUtils]: 4: Hoare triple {1593#(<= ~counter~0 0)} call #t~ret6 := main(); {1593#(<= ~counter~0 0)} is VALID [2022-04-14 15:10:09,730 INFO L290 TraceCheckUtils]: 5: Hoare triple {1593#(<= ~counter~0 0)} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {1593#(<= ~counter~0 0)} is VALID [2022-04-14 15:10:09,731 INFO L290 TraceCheckUtils]: 6: Hoare triple {1593#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1609#(<= ~counter~0 1)} is VALID [2022-04-14 15:10:09,731 INFO L290 TraceCheckUtils]: 7: Hoare triple {1609#(<= ~counter~0 1)} assume !!(#t~post5 < 2);havoc #t~post5; {1609#(<= ~counter~0 1)} is VALID [2022-04-14 15:10:09,732 INFO L272 TraceCheckUtils]: 8: Hoare triple {1609#(<= ~counter~0 1)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {1609#(<= ~counter~0 1)} is VALID [2022-04-14 15:10:09,732 INFO L290 TraceCheckUtils]: 9: Hoare triple {1609#(<= ~counter~0 1)} ~cond := #in~cond; {1609#(<= ~counter~0 1)} is VALID [2022-04-14 15:10:09,732 INFO L290 TraceCheckUtils]: 10: Hoare triple {1609#(<= ~counter~0 1)} assume !(0 == ~cond); {1609#(<= ~counter~0 1)} is VALID [2022-04-14 15:10:09,733 INFO L290 TraceCheckUtils]: 11: Hoare triple {1609#(<= ~counter~0 1)} assume true; {1609#(<= ~counter~0 1)} is VALID [2022-04-14 15:10:09,733 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1609#(<= ~counter~0 1)} {1609#(<= ~counter~0 1)} #59#return; {1609#(<= ~counter~0 1)} is VALID [2022-04-14 15:10:09,734 INFO L272 TraceCheckUtils]: 13: Hoare triple {1609#(<= ~counter~0 1)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {1609#(<= ~counter~0 1)} is VALID [2022-04-14 15:10:09,734 INFO L290 TraceCheckUtils]: 14: Hoare triple {1609#(<= ~counter~0 1)} ~cond := #in~cond; {1609#(<= ~counter~0 1)} is VALID [2022-04-14 15:10:09,735 INFO L290 TraceCheckUtils]: 15: Hoare triple {1609#(<= ~counter~0 1)} assume !(0 == ~cond); {1609#(<= ~counter~0 1)} is VALID [2022-04-14 15:10:09,735 INFO L290 TraceCheckUtils]: 16: Hoare triple {1609#(<= ~counter~0 1)} assume true; {1609#(<= ~counter~0 1)} is VALID [2022-04-14 15:10:09,735 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1609#(<= ~counter~0 1)} {1609#(<= ~counter~0 1)} #61#return; {1609#(<= ~counter~0 1)} is VALID [2022-04-14 15:10:09,736 INFO L272 TraceCheckUtils]: 18: Hoare triple {1609#(<= ~counter~0 1)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {1609#(<= ~counter~0 1)} is VALID [2022-04-14 15:10:09,736 INFO L290 TraceCheckUtils]: 19: Hoare triple {1609#(<= ~counter~0 1)} ~cond := #in~cond; {1609#(<= ~counter~0 1)} is VALID [2022-04-14 15:10:09,737 INFO L290 TraceCheckUtils]: 20: Hoare triple {1609#(<= ~counter~0 1)} assume !(0 == ~cond); {1609#(<= ~counter~0 1)} is VALID [2022-04-14 15:10:09,737 INFO L290 TraceCheckUtils]: 21: Hoare triple {1609#(<= ~counter~0 1)} assume true; {1609#(<= ~counter~0 1)} is VALID [2022-04-14 15:10:09,737 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1609#(<= ~counter~0 1)} {1609#(<= ~counter~0 1)} #63#return; {1609#(<= ~counter~0 1)} is VALID [2022-04-14 15:10:09,738 INFO L272 TraceCheckUtils]: 23: Hoare triple {1609#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {1609#(<= ~counter~0 1)} is VALID [2022-04-14 15:10:09,738 INFO L290 TraceCheckUtils]: 24: Hoare triple {1609#(<= ~counter~0 1)} ~cond := #in~cond; {1609#(<= ~counter~0 1)} is VALID [2022-04-14 15:10:09,738 INFO L290 TraceCheckUtils]: 25: Hoare triple {1609#(<= ~counter~0 1)} assume !(0 == ~cond); {1609#(<= ~counter~0 1)} is VALID [2022-04-14 15:10:09,739 INFO L290 TraceCheckUtils]: 26: Hoare triple {1609#(<= ~counter~0 1)} assume true; {1609#(<= ~counter~0 1)} is VALID [2022-04-14 15:10:09,739 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1609#(<= ~counter~0 1)} {1609#(<= ~counter~0 1)} #65#return; {1609#(<= ~counter~0 1)} is VALID [2022-04-14 15:10:09,740 INFO L272 TraceCheckUtils]: 28: Hoare triple {1609#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {1609#(<= ~counter~0 1)} is VALID [2022-04-14 15:10:09,740 INFO L290 TraceCheckUtils]: 29: Hoare triple {1609#(<= ~counter~0 1)} ~cond := #in~cond; {1609#(<= ~counter~0 1)} is VALID [2022-04-14 15:10:09,740 INFO L290 TraceCheckUtils]: 30: Hoare triple {1609#(<= ~counter~0 1)} assume !(0 == ~cond); {1609#(<= ~counter~0 1)} is VALID [2022-04-14 15:10:09,740 INFO L290 TraceCheckUtils]: 31: Hoare triple {1609#(<= ~counter~0 1)} assume true; {1609#(<= ~counter~0 1)} is VALID [2022-04-14 15:10:09,741 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1609#(<= ~counter~0 1)} {1609#(<= ~counter~0 1)} #67#return; {1609#(<= ~counter~0 1)} is VALID [2022-04-14 15:10:09,741 INFO L290 TraceCheckUtils]: 33: Hoare triple {1609#(<= ~counter~0 1)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {1609#(<= ~counter~0 1)} is VALID [2022-04-14 15:10:09,741 INFO L290 TraceCheckUtils]: 34: Hoare triple {1609#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1694#(<= |main_#t~post5| 1)} is VALID [2022-04-14 15:10:09,742 INFO L290 TraceCheckUtils]: 35: Hoare triple {1694#(<= |main_#t~post5| 1)} assume !(#t~post5 < 2);havoc #t~post5; {1586#false} is VALID [2022-04-14 15:10:09,742 INFO L272 TraceCheckUtils]: 36: Hoare triple {1586#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {1586#false} is VALID [2022-04-14 15:10:09,742 INFO L290 TraceCheckUtils]: 37: Hoare triple {1586#false} ~cond := #in~cond; {1586#false} is VALID [2022-04-14 15:10:09,742 INFO L290 TraceCheckUtils]: 38: Hoare triple {1586#false} assume !(0 == ~cond); {1586#false} is VALID [2022-04-14 15:10:09,742 INFO L290 TraceCheckUtils]: 39: Hoare triple {1586#false} assume true; {1586#false} is VALID [2022-04-14 15:10:09,742 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {1586#false} {1586#false} #69#return; {1586#false} is VALID [2022-04-14 15:10:09,742 INFO L272 TraceCheckUtils]: 41: Hoare triple {1586#false} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {1586#false} is VALID [2022-04-14 15:10:09,742 INFO L290 TraceCheckUtils]: 42: Hoare triple {1586#false} ~cond := #in~cond; {1586#false} is VALID [2022-04-14 15:10:09,742 INFO L290 TraceCheckUtils]: 43: Hoare triple {1586#false} assume 0 == ~cond; {1586#false} is VALID [2022-04-14 15:10:09,743 INFO L290 TraceCheckUtils]: 44: Hoare triple {1586#false} assume !false; {1586#false} is VALID [2022-04-14 15:10:09,743 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 30 proven. 2 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-04-14 15:10:09,743 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 15:10:09,905 INFO L290 TraceCheckUtils]: 44: Hoare triple {1586#false} assume !false; {1586#false} is VALID [2022-04-14 15:10:09,905 INFO L290 TraceCheckUtils]: 43: Hoare triple {1586#false} assume 0 == ~cond; {1586#false} is VALID [2022-04-14 15:10:09,905 INFO L290 TraceCheckUtils]: 42: Hoare triple {1586#false} ~cond := #in~cond; {1586#false} is VALID [2022-04-14 15:10:09,905 INFO L272 TraceCheckUtils]: 41: Hoare triple {1586#false} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {1586#false} is VALID [2022-04-14 15:10:09,905 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {1585#true} {1586#false} #69#return; {1586#false} is VALID [2022-04-14 15:10:09,905 INFO L290 TraceCheckUtils]: 39: Hoare triple {1585#true} assume true; {1585#true} is VALID [2022-04-14 15:10:09,905 INFO L290 TraceCheckUtils]: 38: Hoare triple {1585#true} assume !(0 == ~cond); {1585#true} is VALID [2022-04-14 15:10:09,905 INFO L290 TraceCheckUtils]: 37: Hoare triple {1585#true} ~cond := #in~cond; {1585#true} is VALID [2022-04-14 15:10:09,905 INFO L272 TraceCheckUtils]: 36: Hoare triple {1586#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {1585#true} is VALID [2022-04-14 15:10:09,906 INFO L290 TraceCheckUtils]: 35: Hoare triple {1694#(<= |main_#t~post5| 1)} assume !(#t~post5 < 2);havoc #t~post5; {1586#false} is VALID [2022-04-14 15:10:09,906 INFO L290 TraceCheckUtils]: 34: Hoare triple {1609#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1694#(<= |main_#t~post5| 1)} is VALID [2022-04-14 15:10:09,906 INFO L290 TraceCheckUtils]: 33: Hoare triple {1609#(<= ~counter~0 1)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {1609#(<= ~counter~0 1)} is VALID [2022-04-14 15:10:09,907 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1585#true} {1609#(<= ~counter~0 1)} #67#return; {1609#(<= ~counter~0 1)} is VALID [2022-04-14 15:10:09,907 INFO L290 TraceCheckUtils]: 31: Hoare triple {1585#true} assume true; {1585#true} is VALID [2022-04-14 15:10:09,907 INFO L290 TraceCheckUtils]: 30: Hoare triple {1585#true} assume !(0 == ~cond); {1585#true} is VALID [2022-04-14 15:10:09,907 INFO L290 TraceCheckUtils]: 29: Hoare triple {1585#true} ~cond := #in~cond; {1585#true} is VALID [2022-04-14 15:10:09,907 INFO L272 TraceCheckUtils]: 28: Hoare triple {1609#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {1585#true} is VALID [2022-04-14 15:10:09,908 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1585#true} {1609#(<= ~counter~0 1)} #65#return; {1609#(<= ~counter~0 1)} is VALID [2022-04-14 15:10:09,908 INFO L290 TraceCheckUtils]: 26: Hoare triple {1585#true} assume true; {1585#true} is VALID [2022-04-14 15:10:09,908 INFO L290 TraceCheckUtils]: 25: Hoare triple {1585#true} assume !(0 == ~cond); {1585#true} is VALID [2022-04-14 15:10:09,908 INFO L290 TraceCheckUtils]: 24: Hoare triple {1585#true} ~cond := #in~cond; {1585#true} is VALID [2022-04-14 15:10:09,908 INFO L272 TraceCheckUtils]: 23: Hoare triple {1609#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {1585#true} is VALID [2022-04-14 15:10:09,908 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1585#true} {1609#(<= ~counter~0 1)} #63#return; {1609#(<= ~counter~0 1)} is VALID [2022-04-14 15:10:09,908 INFO L290 TraceCheckUtils]: 21: Hoare triple {1585#true} assume true; {1585#true} is VALID [2022-04-14 15:10:09,908 INFO L290 TraceCheckUtils]: 20: Hoare triple {1585#true} assume !(0 == ~cond); {1585#true} is VALID [2022-04-14 15:10:09,909 INFO L290 TraceCheckUtils]: 19: Hoare triple {1585#true} ~cond := #in~cond; {1585#true} is VALID [2022-04-14 15:10:09,909 INFO L272 TraceCheckUtils]: 18: Hoare triple {1609#(<= ~counter~0 1)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {1585#true} is VALID [2022-04-14 15:10:09,909 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1585#true} {1609#(<= ~counter~0 1)} #61#return; {1609#(<= ~counter~0 1)} is VALID [2022-04-14 15:10:09,909 INFO L290 TraceCheckUtils]: 16: Hoare triple {1585#true} assume true; {1585#true} is VALID [2022-04-14 15:10:09,909 INFO L290 TraceCheckUtils]: 15: Hoare triple {1585#true} assume !(0 == ~cond); {1585#true} is VALID [2022-04-14 15:10:09,909 INFO L290 TraceCheckUtils]: 14: Hoare triple {1585#true} ~cond := #in~cond; {1585#true} is VALID [2022-04-14 15:10:09,910 INFO L272 TraceCheckUtils]: 13: Hoare triple {1609#(<= ~counter~0 1)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {1585#true} is VALID [2022-04-14 15:10:09,910 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1585#true} {1609#(<= ~counter~0 1)} #59#return; {1609#(<= ~counter~0 1)} is VALID [2022-04-14 15:10:09,910 INFO L290 TraceCheckUtils]: 11: Hoare triple {1585#true} assume true; {1585#true} is VALID [2022-04-14 15:10:09,910 INFO L290 TraceCheckUtils]: 10: Hoare triple {1585#true} assume !(0 == ~cond); {1585#true} is VALID [2022-04-14 15:10:09,910 INFO L290 TraceCheckUtils]: 9: Hoare triple {1585#true} ~cond := #in~cond; {1585#true} is VALID [2022-04-14 15:10:09,910 INFO L272 TraceCheckUtils]: 8: Hoare triple {1609#(<= ~counter~0 1)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {1585#true} is VALID [2022-04-14 15:10:09,911 INFO L290 TraceCheckUtils]: 7: Hoare triple {1609#(<= ~counter~0 1)} assume !!(#t~post5 < 2);havoc #t~post5; {1609#(<= ~counter~0 1)} is VALID [2022-04-14 15:10:09,911 INFO L290 TraceCheckUtils]: 6: Hoare triple {1593#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1609#(<= ~counter~0 1)} is VALID [2022-04-14 15:10:09,912 INFO L290 TraceCheckUtils]: 5: Hoare triple {1593#(<= ~counter~0 0)} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {1593#(<= ~counter~0 0)} is VALID [2022-04-14 15:10:09,912 INFO L272 TraceCheckUtils]: 4: Hoare triple {1593#(<= ~counter~0 0)} call #t~ret6 := main(); {1593#(<= ~counter~0 0)} is VALID [2022-04-14 15:10:09,912 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1593#(<= ~counter~0 0)} {1585#true} #81#return; {1593#(<= ~counter~0 0)} is VALID [2022-04-14 15:10:09,913 INFO L290 TraceCheckUtils]: 2: Hoare triple {1593#(<= ~counter~0 0)} assume true; {1593#(<= ~counter~0 0)} is VALID [2022-04-14 15:10:09,913 INFO L290 TraceCheckUtils]: 1: Hoare triple {1585#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1593#(<= ~counter~0 0)} is VALID [2022-04-14 15:10:09,913 INFO L272 TraceCheckUtils]: 0: Hoare triple {1585#true} call ULTIMATE.init(); {1585#true} is VALID [2022-04-14 15:10:09,914 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-14 15:10:09,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:10:09,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426201234] [2022-04-14 15:10:09,914 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 15:10:09,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [868342145] [2022-04-14 15:10:09,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [868342145] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 15:10:09,914 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-14 15:10:09,914 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2022-04-14 15:10:09,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068407661] [2022-04-14 15:10:09,914 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-14 15:10:09,915 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 4 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 45 [2022-04-14 15:10:09,917 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:10:09,917 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 4 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-04-14 15:10:09,947 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:10:09,948 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 15:10:09,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:10:09,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 15:10:09,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-14 15:10:09,948 INFO L87 Difference]: Start difference. First operand 50 states and 62 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 4 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-04-14 15:10:10,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:10:10,224 INFO L93 Difference]: Finished difference Result 72 states and 87 transitions. [2022-04-14 15:10:10,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-14 15:10:10,225 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 4 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 45 [2022-04-14 15:10:10,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:10:10,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 4 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-04-14 15:10:10,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 72 transitions. [2022-04-14 15:10:10,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 4 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-04-14 15:10:10,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 72 transitions. [2022-04-14 15:10:10,227 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 72 transitions. [2022-04-14 15:10:10,276 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:10:10,277 INFO L225 Difference]: With dead ends: 72 [2022-04-14 15:10:10,277 INFO L226 Difference]: Without dead ends: 56 [2022-04-14 15:10:10,278 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 85 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-14 15:10:10,278 INFO L913 BasicCegarLoop]: 40 mSDtfsCounter, 2 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 15:10:10,278 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 134 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 15:10:10,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-04-14 15:10:10,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-04-14 15:10:10,290 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:10:10,291 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand has 56 states, 30 states have (on average 1.1) internal successors, (33), 31 states have internal predecessors, (33), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-14 15:10:10,291 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand has 56 states, 30 states have (on average 1.1) internal successors, (33), 31 states have internal predecessors, (33), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-14 15:10:10,291 INFO L87 Difference]: Start difference. First operand 56 states. Second operand has 56 states, 30 states have (on average 1.1) internal successors, (33), 31 states have internal predecessors, (33), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-14 15:10:10,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:10:10,293 INFO L93 Difference]: Finished difference Result 56 states and 67 transitions. [2022-04-14 15:10:10,293 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 67 transitions. [2022-04-14 15:10:10,293 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:10:10,293 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:10:10,293 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 30 states have (on average 1.1) internal successors, (33), 31 states have internal predecessors, (33), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 56 states. [2022-04-14 15:10:10,293 INFO L87 Difference]: Start difference. First operand has 56 states, 30 states have (on average 1.1) internal successors, (33), 31 states have internal predecessors, (33), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 56 states. [2022-04-14 15:10:10,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:10:10,295 INFO L93 Difference]: Finished difference Result 56 states and 67 transitions. [2022-04-14 15:10:10,295 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 67 transitions. [2022-04-14 15:10:10,295 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:10:10,295 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:10:10,295 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:10:10,295 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:10:10,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 30 states have (on average 1.1) internal successors, (33), 31 states have internal predecessors, (33), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-14 15:10:10,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 67 transitions. [2022-04-14 15:10:10,296 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 67 transitions. Word has length 45 [2022-04-14 15:10:10,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:10:10,297 INFO L478 AbstractCegarLoop]: Abstraction has 56 states and 67 transitions. [2022-04-14 15:10:10,297 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 4 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-04-14 15:10:10,297 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 67 transitions. [2022-04-14 15:10:10,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-14 15:10:10,297 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:10:10,297 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 15:10:10,316 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-14 15:10:10,510 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:10:10,510 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:10:10,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:10:10,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1933038948, now seen corresponding path program 1 times [2022-04-14 15:10:10,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:10:10,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942952043] [2022-04-14 15:10:10,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:10:10,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:10:10,520 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 15:10:10,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1552787603] [2022-04-14 15:10:10,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:10:10,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:10:10,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:10:10,522 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 15:10:10,522 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-14 15:10:10,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:10:10,556 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-14 15:10:10,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:10:10,564 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 15:10:10,722 INFO L272 TraceCheckUtils]: 0: Hoare triple {2167#true} call ULTIMATE.init(); {2167#true} is VALID [2022-04-14 15:10:10,722 INFO L290 TraceCheckUtils]: 1: Hoare triple {2167#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2167#true} is VALID [2022-04-14 15:10:10,722 INFO L290 TraceCheckUtils]: 2: Hoare triple {2167#true} assume true; {2167#true} is VALID [2022-04-14 15:10:10,722 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2167#true} {2167#true} #81#return; {2167#true} is VALID [2022-04-14 15:10:10,722 INFO L272 TraceCheckUtils]: 4: Hoare triple {2167#true} call #t~ret6 := main(); {2167#true} is VALID [2022-04-14 15:10:10,722 INFO L290 TraceCheckUtils]: 5: Hoare triple {2167#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {2187#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-14 15:10:10,723 INFO L290 TraceCheckUtils]: 6: Hoare triple {2187#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2187#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-14 15:10:10,723 INFO L290 TraceCheckUtils]: 7: Hoare triple {2187#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !!(#t~post5 < 2);havoc #t~post5; {2187#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-14 15:10:10,723 INFO L272 TraceCheckUtils]: 8: Hoare triple {2187#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {2167#true} is VALID [2022-04-14 15:10:10,723 INFO L290 TraceCheckUtils]: 9: Hoare triple {2167#true} ~cond := #in~cond; {2167#true} is VALID [2022-04-14 15:10:10,723 INFO L290 TraceCheckUtils]: 10: Hoare triple {2167#true} assume !(0 == ~cond); {2167#true} is VALID [2022-04-14 15:10:10,723 INFO L290 TraceCheckUtils]: 11: Hoare triple {2167#true} assume true; {2167#true} is VALID [2022-04-14 15:10:10,724 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2167#true} {2187#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #59#return; {2187#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-14 15:10:10,724 INFO L272 TraceCheckUtils]: 13: Hoare triple {2187#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {2167#true} is VALID [2022-04-14 15:10:10,724 INFO L290 TraceCheckUtils]: 14: Hoare triple {2167#true} ~cond := #in~cond; {2167#true} is VALID [2022-04-14 15:10:10,724 INFO L290 TraceCheckUtils]: 15: Hoare triple {2167#true} assume !(0 == ~cond); {2167#true} is VALID [2022-04-14 15:10:10,724 INFO L290 TraceCheckUtils]: 16: Hoare triple {2167#true} assume true; {2167#true} is VALID [2022-04-14 15:10:10,725 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2167#true} {2187#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #61#return; {2187#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-14 15:10:10,725 INFO L272 TraceCheckUtils]: 18: Hoare triple {2187#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {2167#true} is VALID [2022-04-14 15:10:10,725 INFO L290 TraceCheckUtils]: 19: Hoare triple {2167#true} ~cond := #in~cond; {2167#true} is VALID [2022-04-14 15:10:10,725 INFO L290 TraceCheckUtils]: 20: Hoare triple {2167#true} assume !(0 == ~cond); {2167#true} is VALID [2022-04-14 15:10:10,725 INFO L290 TraceCheckUtils]: 21: Hoare triple {2167#true} assume true; {2167#true} is VALID [2022-04-14 15:10:10,725 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2167#true} {2187#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #63#return; {2187#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-14 15:10:10,725 INFO L272 TraceCheckUtils]: 23: Hoare triple {2187#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {2167#true} is VALID [2022-04-14 15:10:10,726 INFO L290 TraceCheckUtils]: 24: Hoare triple {2167#true} ~cond := #in~cond; {2167#true} is VALID [2022-04-14 15:10:10,726 INFO L290 TraceCheckUtils]: 25: Hoare triple {2167#true} assume !(0 == ~cond); {2167#true} is VALID [2022-04-14 15:10:10,726 INFO L290 TraceCheckUtils]: 26: Hoare triple {2167#true} assume true; {2167#true} is VALID [2022-04-14 15:10:10,726 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {2167#true} {2187#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #65#return; {2187#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-14 15:10:10,726 INFO L272 TraceCheckUtils]: 28: Hoare triple {2187#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {2167#true} is VALID [2022-04-14 15:10:10,726 INFO L290 TraceCheckUtils]: 29: Hoare triple {2167#true} ~cond := #in~cond; {2167#true} is VALID [2022-04-14 15:10:10,726 INFO L290 TraceCheckUtils]: 30: Hoare triple {2167#true} assume !(0 == ~cond); {2167#true} is VALID [2022-04-14 15:10:10,726 INFO L290 TraceCheckUtils]: 31: Hoare triple {2167#true} assume true; {2167#true} is VALID [2022-04-14 15:10:10,727 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2167#true} {2187#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #67#return; {2187#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-14 15:10:10,727 INFO L290 TraceCheckUtils]: 33: Hoare triple {2187#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {2272#(and (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} is VALID [2022-04-14 15:10:10,728 INFO L290 TraceCheckUtils]: 34: Hoare triple {2272#(and (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2272#(and (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} is VALID [2022-04-14 15:10:10,728 INFO L290 TraceCheckUtils]: 35: Hoare triple {2272#(and (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} assume !!(#t~post5 < 2);havoc #t~post5; {2272#(and (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} is VALID [2022-04-14 15:10:10,728 INFO L272 TraceCheckUtils]: 36: Hoare triple {2272#(and (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {2167#true} is VALID [2022-04-14 15:10:10,728 INFO L290 TraceCheckUtils]: 37: Hoare triple {2167#true} ~cond := #in~cond; {2167#true} is VALID [2022-04-14 15:10:10,728 INFO L290 TraceCheckUtils]: 38: Hoare triple {2167#true} assume !(0 == ~cond); {2167#true} is VALID [2022-04-14 15:10:10,728 INFO L290 TraceCheckUtils]: 39: Hoare triple {2167#true} assume true; {2167#true} is VALID [2022-04-14 15:10:10,729 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {2167#true} {2272#(and (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} #59#return; {2272#(and (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} is VALID [2022-04-14 15:10:10,729 INFO L272 TraceCheckUtils]: 41: Hoare triple {2272#(and (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {2297#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 15:10:10,730 INFO L290 TraceCheckUtils]: 42: Hoare triple {2297#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2301#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:10:10,730 INFO L290 TraceCheckUtils]: 43: Hoare triple {2301#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2168#false} is VALID [2022-04-14 15:10:10,730 INFO L290 TraceCheckUtils]: 44: Hoare triple {2168#false} assume !false; {2168#false} is VALID [2022-04-14 15:10:10,730 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-14 15:10:10,730 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 15:10:10,877 INFO L290 TraceCheckUtils]: 44: Hoare triple {2168#false} assume !false; {2168#false} is VALID [2022-04-14 15:10:10,877 INFO L290 TraceCheckUtils]: 43: Hoare triple {2301#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2168#false} is VALID [2022-04-14 15:10:10,878 INFO L290 TraceCheckUtils]: 42: Hoare triple {2297#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2301#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:10:10,878 INFO L272 TraceCheckUtils]: 41: Hoare triple {2317#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {2297#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 15:10:10,879 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {2167#true} {2317#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} #59#return; {2317#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} is VALID [2022-04-14 15:10:10,879 INFO L290 TraceCheckUtils]: 39: Hoare triple {2167#true} assume true; {2167#true} is VALID [2022-04-14 15:10:10,879 INFO L290 TraceCheckUtils]: 38: Hoare triple {2167#true} assume !(0 == ~cond); {2167#true} is VALID [2022-04-14 15:10:10,879 INFO L290 TraceCheckUtils]: 37: Hoare triple {2167#true} ~cond := #in~cond; {2167#true} is VALID [2022-04-14 15:10:10,879 INFO L272 TraceCheckUtils]: 36: Hoare triple {2317#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {2167#true} is VALID [2022-04-14 15:10:10,879 INFO L290 TraceCheckUtils]: 35: Hoare triple {2317#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} assume !!(#t~post5 < 2);havoc #t~post5; {2317#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} is VALID [2022-04-14 15:10:10,880 INFO L290 TraceCheckUtils]: 34: Hoare triple {2317#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2317#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} is VALID [2022-04-14 15:10:10,882 INFO L290 TraceCheckUtils]: 33: Hoare triple {2342#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {2317#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} is VALID [2022-04-14 15:10:10,883 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2167#true} {2342#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} #67#return; {2342#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} is VALID [2022-04-14 15:10:10,883 INFO L290 TraceCheckUtils]: 31: Hoare triple {2167#true} assume true; {2167#true} is VALID [2022-04-14 15:10:10,883 INFO L290 TraceCheckUtils]: 30: Hoare triple {2167#true} assume !(0 == ~cond); {2167#true} is VALID [2022-04-14 15:10:10,883 INFO L290 TraceCheckUtils]: 29: Hoare triple {2167#true} ~cond := #in~cond; {2167#true} is VALID [2022-04-14 15:10:10,883 INFO L272 TraceCheckUtils]: 28: Hoare triple {2342#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {2167#true} is VALID [2022-04-14 15:10:10,883 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {2167#true} {2342#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} #65#return; {2342#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} is VALID [2022-04-14 15:10:10,883 INFO L290 TraceCheckUtils]: 26: Hoare triple {2167#true} assume true; {2167#true} is VALID [2022-04-14 15:10:10,883 INFO L290 TraceCheckUtils]: 25: Hoare triple {2167#true} assume !(0 == ~cond); {2167#true} is VALID [2022-04-14 15:10:10,884 INFO L290 TraceCheckUtils]: 24: Hoare triple {2167#true} ~cond := #in~cond; {2167#true} is VALID [2022-04-14 15:10:10,884 INFO L272 TraceCheckUtils]: 23: Hoare triple {2342#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {2167#true} is VALID [2022-04-14 15:10:10,884 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2167#true} {2342#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} #63#return; {2342#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} is VALID [2022-04-14 15:10:10,884 INFO L290 TraceCheckUtils]: 21: Hoare triple {2167#true} assume true; {2167#true} is VALID [2022-04-14 15:10:10,884 INFO L290 TraceCheckUtils]: 20: Hoare triple {2167#true} assume !(0 == ~cond); {2167#true} is VALID [2022-04-14 15:10:10,884 INFO L290 TraceCheckUtils]: 19: Hoare triple {2167#true} ~cond := #in~cond; {2167#true} is VALID [2022-04-14 15:10:10,884 INFO L272 TraceCheckUtils]: 18: Hoare triple {2342#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {2167#true} is VALID [2022-04-14 15:10:10,885 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2167#true} {2342#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} #61#return; {2342#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} is VALID [2022-04-14 15:10:10,885 INFO L290 TraceCheckUtils]: 16: Hoare triple {2167#true} assume true; {2167#true} is VALID [2022-04-14 15:10:10,885 INFO L290 TraceCheckUtils]: 15: Hoare triple {2167#true} assume !(0 == ~cond); {2167#true} is VALID [2022-04-14 15:10:10,885 INFO L290 TraceCheckUtils]: 14: Hoare triple {2167#true} ~cond := #in~cond; {2167#true} is VALID [2022-04-14 15:10:10,885 INFO L272 TraceCheckUtils]: 13: Hoare triple {2342#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {2167#true} is VALID [2022-04-14 15:10:10,885 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2167#true} {2342#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} #59#return; {2342#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} is VALID [2022-04-14 15:10:10,886 INFO L290 TraceCheckUtils]: 11: Hoare triple {2167#true} assume true; {2167#true} is VALID [2022-04-14 15:10:10,886 INFO L290 TraceCheckUtils]: 10: Hoare triple {2167#true} assume !(0 == ~cond); {2167#true} is VALID [2022-04-14 15:10:10,886 INFO L290 TraceCheckUtils]: 9: Hoare triple {2167#true} ~cond := #in~cond; {2167#true} is VALID [2022-04-14 15:10:10,886 INFO L272 TraceCheckUtils]: 8: Hoare triple {2342#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {2167#true} is VALID [2022-04-14 15:10:10,886 INFO L290 TraceCheckUtils]: 7: Hoare triple {2342#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} assume !!(#t~post5 < 2);havoc #t~post5; {2342#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} is VALID [2022-04-14 15:10:10,886 INFO L290 TraceCheckUtils]: 6: Hoare triple {2342#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2342#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} is VALID [2022-04-14 15:10:10,887 INFO L290 TraceCheckUtils]: 5: Hoare triple {2167#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {2342#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} is VALID [2022-04-14 15:10:10,887 INFO L272 TraceCheckUtils]: 4: Hoare triple {2167#true} call #t~ret6 := main(); {2167#true} is VALID [2022-04-14 15:10:10,887 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2167#true} {2167#true} #81#return; {2167#true} is VALID [2022-04-14 15:10:10,887 INFO L290 TraceCheckUtils]: 2: Hoare triple {2167#true} assume true; {2167#true} is VALID [2022-04-14 15:10:10,887 INFO L290 TraceCheckUtils]: 1: Hoare triple {2167#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2167#true} is VALID [2022-04-14 15:10:10,887 INFO L272 TraceCheckUtils]: 0: Hoare triple {2167#true} call ULTIMATE.init(); {2167#true} is VALID [2022-04-14 15:10:10,887 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-14 15:10:10,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:10:10,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942952043] [2022-04-14 15:10:10,888 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 15:10:10,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1552787603] [2022-04-14 15:10:10,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1552787603] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 15:10:10,888 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-14 15:10:10,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-04-14 15:10:10,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190743584] [2022-04-14 15:10:10,888 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-14 15:10:10,889 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, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) Word has length 45 [2022-04-14 15:10:10,889 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:10:10,889 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, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-14 15:10:10,934 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:10:10,935 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-14 15:10:10,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:10:10,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-14 15:10:10,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-14 15:10:10,935 INFO L87 Difference]: Start difference. First operand 56 states and 67 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, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-14 15:10:11,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:10:11,959 INFO L93 Difference]: Finished difference Result 78 states and 98 transitions. [2022-04-14 15:10:11,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-14 15:10:11,960 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, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) Word has length 45 [2022-04-14 15:10:11,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:10:11,960 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, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-14 15:10:11,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 80 transitions. [2022-04-14 15:10:11,961 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, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-14 15:10:11,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 80 transitions. [2022-04-14 15:10:11,962 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 80 transitions. [2022-04-14 15:10:12,089 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:10:12,091 INFO L225 Difference]: With dead ends: 78 [2022-04-14 15:10:12,091 INFO L226 Difference]: Without dead ends: 76 [2022-04-14 15:10:12,092 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 82 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-14 15:10:12,092 INFO L913 BasicCegarLoop]: 44 mSDtfsCounter, 11 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-14 15:10:12,092 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 134 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-14 15:10:12,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-04-14 15:10:12,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 64. [2022-04-14 15:10:12,118 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:10:12,119 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand has 64 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 37 states have internal predecessors, (39), 18 states have call successors, (18), 10 states have call predecessors, (18), 9 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-14 15:10:12,119 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand has 64 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 37 states have internal predecessors, (39), 18 states have call successors, (18), 10 states have call predecessors, (18), 9 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-14 15:10:12,125 INFO L87 Difference]: Start difference. First operand 76 states. Second operand has 64 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 37 states have internal predecessors, (39), 18 states have call successors, (18), 10 states have call predecessors, (18), 9 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-14 15:10:12,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:10:12,127 INFO L93 Difference]: Finished difference Result 76 states and 96 transitions. [2022-04-14 15:10:12,127 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 96 transitions. [2022-04-14 15:10:12,127 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:10:12,127 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:10:12,128 INFO L74 IsIncluded]: Start isIncluded. First operand has 64 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 37 states have internal predecessors, (39), 18 states have call successors, (18), 10 states have call predecessors, (18), 9 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 76 states. [2022-04-14 15:10:12,128 INFO L87 Difference]: Start difference. First operand has 64 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 37 states have internal predecessors, (39), 18 states have call successors, (18), 10 states have call predecessors, (18), 9 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 76 states. [2022-04-14 15:10:12,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:10:12,130 INFO L93 Difference]: Finished difference Result 76 states and 96 transitions. [2022-04-14 15:10:12,130 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 96 transitions. [2022-04-14 15:10:12,130 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:10:12,131 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:10:12,131 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:10:12,131 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:10:12,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 37 states have internal predecessors, (39), 18 states have call successors, (18), 10 states have call predecessors, (18), 9 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-14 15:10:12,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 73 transitions. [2022-04-14 15:10:12,132 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 73 transitions. Word has length 45 [2022-04-14 15:10:12,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:10:12,132 INFO L478 AbstractCegarLoop]: Abstraction has 64 states and 73 transitions. [2022-04-14 15:10:12,132 INFO L479 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, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-14 15:10:12,133 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 73 transitions. [2022-04-14 15:10:12,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-14 15:10:12,133 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:10:12,133 INFO L499 BasicCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 15:10:12,159 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-14 15:10:12,355 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:10:12,355 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:10:12,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:10:12,356 INFO L85 PathProgramCache]: Analyzing trace with hash 780782572, now seen corresponding path program 2 times [2022-04-14 15:10:12,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:10:12,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817842688] [2022-04-14 15:10:12,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:10:12,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:10:12,366 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 15:10:12,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [715572467] [2022-04-14 15:10:12,366 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-14 15:10:12,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:10:12,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:10:12,374 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 15:10:12,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-14 15:10:12,436 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-14 15:10:12,436 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-14 15:10:12,440 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-14 15:10:12,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:10:12,454 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 15:10:12,646 INFO L272 TraceCheckUtils]: 0: Hoare triple {2817#true} call ULTIMATE.init(); {2817#true} is VALID [2022-04-14 15:10:12,646 INFO L290 TraceCheckUtils]: 1: Hoare triple {2817#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2817#true} is VALID [2022-04-14 15:10:12,647 INFO L290 TraceCheckUtils]: 2: Hoare triple {2817#true} assume true; {2817#true} is VALID [2022-04-14 15:10:12,647 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2817#true} {2817#true} #81#return; {2817#true} is VALID [2022-04-14 15:10:12,647 INFO L272 TraceCheckUtils]: 4: Hoare triple {2817#true} call #t~ret6 := main(); {2817#true} is VALID [2022-04-14 15:10:12,647 INFO L290 TraceCheckUtils]: 5: Hoare triple {2817#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {2837#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-14 15:10:12,648 INFO L290 TraceCheckUtils]: 6: Hoare triple {2837#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2837#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-14 15:10:12,648 INFO L290 TraceCheckUtils]: 7: Hoare triple {2837#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} assume !!(#t~post5 < 2);havoc #t~post5; {2837#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-14 15:10:12,648 INFO L272 TraceCheckUtils]: 8: Hoare triple {2837#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {2817#true} is VALID [2022-04-14 15:10:12,648 INFO L290 TraceCheckUtils]: 9: Hoare triple {2817#true} ~cond := #in~cond; {2817#true} is VALID [2022-04-14 15:10:12,648 INFO L290 TraceCheckUtils]: 10: Hoare triple {2817#true} assume !(0 == ~cond); {2817#true} is VALID [2022-04-14 15:10:12,648 INFO L290 TraceCheckUtils]: 11: Hoare triple {2817#true} assume true; {2817#true} is VALID [2022-04-14 15:10:12,649 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2817#true} {2837#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} #59#return; {2837#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-14 15:10:12,649 INFO L272 TraceCheckUtils]: 13: Hoare triple {2837#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {2817#true} is VALID [2022-04-14 15:10:12,649 INFO L290 TraceCheckUtils]: 14: Hoare triple {2817#true} ~cond := #in~cond; {2817#true} is VALID [2022-04-14 15:10:12,649 INFO L290 TraceCheckUtils]: 15: Hoare triple {2817#true} assume !(0 == ~cond); {2817#true} is VALID [2022-04-14 15:10:12,649 INFO L290 TraceCheckUtils]: 16: Hoare triple {2817#true} assume true; {2817#true} is VALID [2022-04-14 15:10:12,649 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2817#true} {2837#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} #61#return; {2837#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-14 15:10:12,649 INFO L272 TraceCheckUtils]: 18: Hoare triple {2837#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {2817#true} is VALID [2022-04-14 15:10:12,650 INFO L290 TraceCheckUtils]: 19: Hoare triple {2817#true} ~cond := #in~cond; {2817#true} is VALID [2022-04-14 15:10:12,650 INFO L290 TraceCheckUtils]: 20: Hoare triple {2817#true} assume !(0 == ~cond); {2817#true} is VALID [2022-04-14 15:10:12,650 INFO L290 TraceCheckUtils]: 21: Hoare triple {2817#true} assume true; {2817#true} is VALID [2022-04-14 15:10:12,650 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2817#true} {2837#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} #63#return; {2837#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-14 15:10:12,650 INFO L272 TraceCheckUtils]: 23: Hoare triple {2837#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {2817#true} is VALID [2022-04-14 15:10:12,650 INFO L290 TraceCheckUtils]: 24: Hoare triple {2817#true} ~cond := #in~cond; {2817#true} is VALID [2022-04-14 15:10:12,650 INFO L290 TraceCheckUtils]: 25: Hoare triple {2817#true} assume !(0 == ~cond); {2817#true} is VALID [2022-04-14 15:10:12,651 INFO L290 TraceCheckUtils]: 26: Hoare triple {2817#true} assume true; {2817#true} is VALID [2022-04-14 15:10:12,651 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {2817#true} {2837#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} #65#return; {2837#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-14 15:10:12,651 INFO L272 TraceCheckUtils]: 28: Hoare triple {2837#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {2817#true} is VALID [2022-04-14 15:10:12,652 INFO L290 TraceCheckUtils]: 29: Hoare triple {2817#true} ~cond := #in~cond; {2817#true} is VALID [2022-04-14 15:10:12,652 INFO L290 TraceCheckUtils]: 30: Hoare triple {2817#true} assume !(0 == ~cond); {2817#true} is VALID [2022-04-14 15:10:12,652 INFO L290 TraceCheckUtils]: 31: Hoare triple {2817#true} assume true; {2817#true} is VALID [2022-04-14 15:10:12,652 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2817#true} {2837#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} #67#return; {2837#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-14 15:10:12,652 INFO L290 TraceCheckUtils]: 33: Hoare triple {2837#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {2922#(and (= (+ (- 1) main_~x~0) 0) (= main_~n~0 1))} is VALID [2022-04-14 15:10:12,653 INFO L290 TraceCheckUtils]: 34: Hoare triple {2922#(and (= (+ (- 1) main_~x~0) 0) (= main_~n~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2922#(and (= (+ (- 1) main_~x~0) 0) (= main_~n~0 1))} is VALID [2022-04-14 15:10:12,653 INFO L290 TraceCheckUtils]: 35: Hoare triple {2922#(and (= (+ (- 1) main_~x~0) 0) (= main_~n~0 1))} assume !!(#t~post5 < 2);havoc #t~post5; {2922#(and (= (+ (- 1) main_~x~0) 0) (= main_~n~0 1))} is VALID [2022-04-14 15:10:12,653 INFO L272 TraceCheckUtils]: 36: Hoare triple {2922#(and (= (+ (- 1) main_~x~0) 0) (= main_~n~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {2817#true} is VALID [2022-04-14 15:10:12,653 INFO L290 TraceCheckUtils]: 37: Hoare triple {2817#true} ~cond := #in~cond; {2817#true} is VALID [2022-04-14 15:10:12,653 INFO L290 TraceCheckUtils]: 38: Hoare triple {2817#true} assume !(0 == ~cond); {2817#true} is VALID [2022-04-14 15:10:12,653 INFO L290 TraceCheckUtils]: 39: Hoare triple {2817#true} assume true; {2817#true} is VALID [2022-04-14 15:10:12,654 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {2817#true} {2922#(and (= (+ (- 1) main_~x~0) 0) (= main_~n~0 1))} #59#return; {2922#(and (= (+ (- 1) main_~x~0) 0) (= main_~n~0 1))} is VALID [2022-04-14 15:10:12,654 INFO L272 TraceCheckUtils]: 41: Hoare triple {2922#(and (= (+ (- 1) main_~x~0) 0) (= main_~n~0 1))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {2817#true} is VALID [2022-04-14 15:10:12,654 INFO L290 TraceCheckUtils]: 42: Hoare triple {2817#true} ~cond := #in~cond; {2817#true} is VALID [2022-04-14 15:10:12,658 INFO L290 TraceCheckUtils]: 43: Hoare triple {2817#true} assume !(0 == ~cond); {2817#true} is VALID [2022-04-14 15:10:12,658 INFO L290 TraceCheckUtils]: 44: Hoare triple {2817#true} assume true; {2817#true} is VALID [2022-04-14 15:10:12,658 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {2817#true} {2922#(and (= (+ (- 1) main_~x~0) 0) (= main_~n~0 1))} #61#return; {2922#(and (= (+ (- 1) main_~x~0) 0) (= main_~n~0 1))} is VALID [2022-04-14 15:10:12,659 INFO L272 TraceCheckUtils]: 46: Hoare triple {2922#(and (= (+ (- 1) main_~x~0) 0) (= main_~n~0 1))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {2962#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 15:10:12,659 INFO L290 TraceCheckUtils]: 47: Hoare triple {2962#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2966#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:10:12,660 INFO L290 TraceCheckUtils]: 48: Hoare triple {2966#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2818#false} is VALID [2022-04-14 15:10:12,660 INFO L290 TraceCheckUtils]: 49: Hoare triple {2818#false} assume !false; {2818#false} is VALID [2022-04-14 15:10:12,660 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-14 15:10:12,660 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 15:10:12,870 INFO L290 TraceCheckUtils]: 49: Hoare triple {2818#false} assume !false; {2818#false} is VALID [2022-04-14 15:10:12,870 INFO L290 TraceCheckUtils]: 48: Hoare triple {2966#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2818#false} is VALID [2022-04-14 15:10:12,871 INFO L290 TraceCheckUtils]: 47: Hoare triple {2962#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2966#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:10:12,871 INFO L272 TraceCheckUtils]: 46: Hoare triple {2982#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {2962#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 15:10:12,871 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {2817#true} {2982#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} #61#return; {2982#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-14 15:10:12,871 INFO L290 TraceCheckUtils]: 44: Hoare triple {2817#true} assume true; {2817#true} is VALID [2022-04-14 15:10:12,871 INFO L290 TraceCheckUtils]: 43: Hoare triple {2817#true} assume !(0 == ~cond); {2817#true} is VALID [2022-04-14 15:10:12,872 INFO L290 TraceCheckUtils]: 42: Hoare triple {2817#true} ~cond := #in~cond; {2817#true} is VALID [2022-04-14 15:10:12,872 INFO L272 TraceCheckUtils]: 41: Hoare triple {2982#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {2817#true} is VALID [2022-04-14 15:10:12,872 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {2817#true} {2982#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} #59#return; {2982#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-14 15:10:12,872 INFO L290 TraceCheckUtils]: 39: Hoare triple {2817#true} assume true; {2817#true} is VALID [2022-04-14 15:10:12,872 INFO L290 TraceCheckUtils]: 38: Hoare triple {2817#true} assume !(0 == ~cond); {2817#true} is VALID [2022-04-14 15:10:12,872 INFO L290 TraceCheckUtils]: 37: Hoare triple {2817#true} ~cond := #in~cond; {2817#true} is VALID [2022-04-14 15:10:12,872 INFO L272 TraceCheckUtils]: 36: Hoare triple {2982#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {2817#true} is VALID [2022-04-14 15:10:12,872 INFO L290 TraceCheckUtils]: 35: Hoare triple {2982#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} assume !!(#t~post5 < 2);havoc #t~post5; {2982#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-14 15:10:12,873 INFO L290 TraceCheckUtils]: 34: Hoare triple {2982#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2982#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-14 15:10:12,875 INFO L290 TraceCheckUtils]: 33: Hoare triple {3022#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {2982#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-14 15:10:12,875 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2817#true} {3022#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #67#return; {3022#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-14 15:10:12,875 INFO L290 TraceCheckUtils]: 31: Hoare triple {2817#true} assume true; {2817#true} is VALID [2022-04-14 15:10:12,875 INFO L290 TraceCheckUtils]: 30: Hoare triple {2817#true} assume !(0 == ~cond); {2817#true} is VALID [2022-04-14 15:10:12,875 INFO L290 TraceCheckUtils]: 29: Hoare triple {2817#true} ~cond := #in~cond; {2817#true} is VALID [2022-04-14 15:10:12,875 INFO L272 TraceCheckUtils]: 28: Hoare triple {3022#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {2817#true} is VALID [2022-04-14 15:10:12,876 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {2817#true} {3022#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #65#return; {3022#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-14 15:10:12,876 INFO L290 TraceCheckUtils]: 26: Hoare triple {2817#true} assume true; {2817#true} is VALID [2022-04-14 15:10:12,876 INFO L290 TraceCheckUtils]: 25: Hoare triple {2817#true} assume !(0 == ~cond); {2817#true} is VALID [2022-04-14 15:10:12,876 INFO L290 TraceCheckUtils]: 24: Hoare triple {2817#true} ~cond := #in~cond; {2817#true} is VALID [2022-04-14 15:10:12,876 INFO L272 TraceCheckUtils]: 23: Hoare triple {3022#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {2817#true} is VALID [2022-04-14 15:10:12,876 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2817#true} {3022#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #63#return; {3022#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-14 15:10:12,876 INFO L290 TraceCheckUtils]: 21: Hoare triple {2817#true} assume true; {2817#true} is VALID [2022-04-14 15:10:12,877 INFO L290 TraceCheckUtils]: 20: Hoare triple {2817#true} assume !(0 == ~cond); {2817#true} is VALID [2022-04-14 15:10:12,877 INFO L290 TraceCheckUtils]: 19: Hoare triple {2817#true} ~cond := #in~cond; {2817#true} is VALID [2022-04-14 15:10:12,877 INFO L272 TraceCheckUtils]: 18: Hoare triple {3022#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {2817#true} is VALID [2022-04-14 15:10:12,877 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2817#true} {3022#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #61#return; {3022#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-14 15:10:12,877 INFO L290 TraceCheckUtils]: 16: Hoare triple {2817#true} assume true; {2817#true} is VALID [2022-04-14 15:10:12,877 INFO L290 TraceCheckUtils]: 15: Hoare triple {2817#true} assume !(0 == ~cond); {2817#true} is VALID [2022-04-14 15:10:12,877 INFO L290 TraceCheckUtils]: 14: Hoare triple {2817#true} ~cond := #in~cond; {2817#true} is VALID [2022-04-14 15:10:12,877 INFO L272 TraceCheckUtils]: 13: Hoare triple {3022#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {2817#true} is VALID [2022-04-14 15:10:12,878 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2817#true} {3022#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #59#return; {3022#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-14 15:10:12,878 INFO L290 TraceCheckUtils]: 11: Hoare triple {2817#true} assume true; {2817#true} is VALID [2022-04-14 15:10:12,878 INFO L290 TraceCheckUtils]: 10: Hoare triple {2817#true} assume !(0 == ~cond); {2817#true} is VALID [2022-04-14 15:10:12,878 INFO L290 TraceCheckUtils]: 9: Hoare triple {2817#true} ~cond := #in~cond; {2817#true} is VALID [2022-04-14 15:10:12,878 INFO L272 TraceCheckUtils]: 8: Hoare triple {3022#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {2817#true} is VALID [2022-04-14 15:10:12,881 INFO L290 TraceCheckUtils]: 7: Hoare triple {3022#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} assume !!(#t~post5 < 2);havoc #t~post5; {3022#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-14 15:10:12,882 INFO L290 TraceCheckUtils]: 6: Hoare triple {3022#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3022#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-14 15:10:12,882 INFO L290 TraceCheckUtils]: 5: Hoare triple {2817#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {3022#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-14 15:10:12,882 INFO L272 TraceCheckUtils]: 4: Hoare triple {2817#true} call #t~ret6 := main(); {2817#true} is VALID [2022-04-14 15:10:12,882 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2817#true} {2817#true} #81#return; {2817#true} is VALID [2022-04-14 15:10:12,882 INFO L290 TraceCheckUtils]: 2: Hoare triple {2817#true} assume true; {2817#true} is VALID [2022-04-14 15:10:12,882 INFO L290 TraceCheckUtils]: 1: Hoare triple {2817#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2817#true} is VALID [2022-04-14 15:10:12,882 INFO L272 TraceCheckUtils]: 0: Hoare triple {2817#true} call ULTIMATE.init(); {2817#true} is VALID [2022-04-14 15:10:12,883 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-14 15:10:12,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:10:12,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817842688] [2022-04-14 15:10:12,883 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 15:10:12,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [715572467] [2022-04-14 15:10:12,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [715572467] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 15:10:12,883 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-14 15:10:12,883 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-04-14 15:10:12,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937235855] [2022-04-14 15:10:12,883 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-14 15:10:12,883 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, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) Word has length 50 [2022-04-14 15:10:12,884 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:10:12,884 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, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) [2022-04-14 15:10:12,942 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-14 15:10:12,942 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-14 15:10:12,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:10:12,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-14 15:10:12,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-14 15:10:12,942 INFO L87 Difference]: Start difference. First operand 64 states and 73 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, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) [2022-04-14 15:10:13,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:10:13,434 INFO L93 Difference]: Finished difference Result 82 states and 101 transitions. [2022-04-14 15:10:13,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-14 15:10:13,434 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, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) Word has length 50 [2022-04-14 15:10:13,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:10:13,435 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, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) [2022-04-14 15:10:13,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 80 transitions. [2022-04-14 15:10:13,436 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, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) [2022-04-14 15:10:13,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 80 transitions. [2022-04-14 15:10:13,437 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 80 transitions. [2022-04-14 15:10:13,504 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:10:13,505 INFO L225 Difference]: With dead ends: 82 [2022-04-14 15:10:13,505 INFO L226 Difference]: Without dead ends: 80 [2022-04-14 15:10:13,505 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-04-14 15:10:13,505 INFO L913 BasicCegarLoop]: 59 mSDtfsCounter, 6 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-14 15:10:13,506 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 244 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-14 15:10:13,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-04-14 15:10:13,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 71. [2022-04-14 15:10:13,523 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:10:13,523 INFO L82 GeneralOperation]: Start isEquivalent. First operand 80 states. Second operand has 71 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 41 states have internal predecessors, (42), 21 states have call successors, (21), 11 states have call predecessors, (21), 10 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-14 15:10:13,523 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand has 71 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 41 states have internal predecessors, (42), 21 states have call successors, (21), 11 states have call predecessors, (21), 10 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-14 15:10:13,523 INFO L87 Difference]: Start difference. First operand 80 states. Second operand has 71 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 41 states have internal predecessors, (42), 21 states have call successors, (21), 11 states have call predecessors, (21), 10 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-14 15:10:13,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:10:13,525 INFO L93 Difference]: Finished difference Result 80 states and 99 transitions. [2022-04-14 15:10:13,525 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 99 transitions. [2022-04-14 15:10:13,526 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:10:13,526 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:10:13,526 INFO L74 IsIncluded]: Start isIncluded. First operand has 71 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 41 states have internal predecessors, (42), 21 states have call successors, (21), 11 states have call predecessors, (21), 10 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) Second operand 80 states. [2022-04-14 15:10:13,526 INFO L87 Difference]: Start difference. First operand has 71 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 41 states have internal predecessors, (42), 21 states have call successors, (21), 11 states have call predecessors, (21), 10 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) Second operand 80 states. [2022-04-14 15:10:13,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:10:13,527 INFO L93 Difference]: Finished difference Result 80 states and 99 transitions. [2022-04-14 15:10:13,527 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 99 transitions. [2022-04-14 15:10:13,528 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:10:13,528 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:10:13,528 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:10:13,528 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:10:13,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 41 states have internal predecessors, (42), 21 states have call successors, (21), 11 states have call predecessors, (21), 10 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-14 15:10:13,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 82 transitions. [2022-04-14 15:10:13,529 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 82 transitions. Word has length 50 [2022-04-14 15:10:13,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:10:13,529 INFO L478 AbstractCegarLoop]: Abstraction has 71 states and 82 transitions. [2022-04-14 15:10:13,529 INFO L479 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, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) [2022-04-14 15:10:13,530 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 82 transitions. [2022-04-14 15:10:13,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-14 15:10:13,530 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:10:13,530 INFO L499 BasicCegarLoop]: trace histogram [9, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 15:10:13,546 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-14 15:10:13,746 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:10:13,746 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:10:13,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:10:13,747 INFO L85 PathProgramCache]: Analyzing trace with hash -1909341660, now seen corresponding path program 3 times [2022-04-14 15:10:13,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:10:13,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576863994] [2022-04-14 15:10:13,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:10:13,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:10:13,755 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 15:10:13,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1970504913] [2022-04-14 15:10:13,755 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-14 15:10:13,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:10:13,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:10:13,756 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 15:10:13,757 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-14 15:10:13,788 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-04-14 15:10:13,788 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-14 15:10:13,788 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-14 15:10:13,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:10:13,797 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 15:10:14,021 INFO L272 TraceCheckUtils]: 0: Hoare triple {3517#true} call ULTIMATE.init(); {3517#true} is VALID [2022-04-14 15:10:14,021 INFO L290 TraceCheckUtils]: 1: Hoare triple {3517#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3517#true} is VALID [2022-04-14 15:10:14,021 INFO L290 TraceCheckUtils]: 2: Hoare triple {3517#true} assume true; {3517#true} is VALID [2022-04-14 15:10:14,021 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3517#true} {3517#true} #81#return; {3517#true} is VALID [2022-04-14 15:10:14,021 INFO L272 TraceCheckUtils]: 4: Hoare triple {3517#true} call #t~ret6 := main(); {3517#true} is VALID [2022-04-14 15:10:14,021 INFO L290 TraceCheckUtils]: 5: Hoare triple {3517#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {3537#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-14 15:10:14,034 INFO L290 TraceCheckUtils]: 6: Hoare triple {3537#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3537#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-14 15:10:14,035 INFO L290 TraceCheckUtils]: 7: Hoare triple {3537#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !!(#t~post5 < 2);havoc #t~post5; {3537#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-14 15:10:14,035 INFO L272 TraceCheckUtils]: 8: Hoare triple {3537#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {3517#true} is VALID [2022-04-14 15:10:14,035 INFO L290 TraceCheckUtils]: 9: Hoare triple {3517#true} ~cond := #in~cond; {3517#true} is VALID [2022-04-14 15:10:14,035 INFO L290 TraceCheckUtils]: 10: Hoare triple {3517#true} assume !(0 == ~cond); {3517#true} is VALID [2022-04-14 15:10:14,035 INFO L290 TraceCheckUtils]: 11: Hoare triple {3517#true} assume true; {3517#true} is VALID [2022-04-14 15:10:14,036 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {3517#true} {3537#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #59#return; {3537#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-14 15:10:14,036 INFO L272 TraceCheckUtils]: 13: Hoare triple {3537#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {3517#true} is VALID [2022-04-14 15:10:14,037 INFO L290 TraceCheckUtils]: 14: Hoare triple {3517#true} ~cond := #in~cond; {3517#true} is VALID [2022-04-14 15:10:14,037 INFO L290 TraceCheckUtils]: 15: Hoare triple {3517#true} assume !(0 == ~cond); {3517#true} is VALID [2022-04-14 15:10:14,037 INFO L290 TraceCheckUtils]: 16: Hoare triple {3517#true} assume true; {3517#true} is VALID [2022-04-14 15:10:14,037 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {3517#true} {3537#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #61#return; {3537#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-14 15:10:14,037 INFO L272 TraceCheckUtils]: 18: Hoare triple {3537#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {3517#true} is VALID [2022-04-14 15:10:14,037 INFO L290 TraceCheckUtils]: 19: Hoare triple {3517#true} ~cond := #in~cond; {3517#true} is VALID [2022-04-14 15:10:14,037 INFO L290 TraceCheckUtils]: 20: Hoare triple {3517#true} assume !(0 == ~cond); {3517#true} is VALID [2022-04-14 15:10:14,037 INFO L290 TraceCheckUtils]: 21: Hoare triple {3517#true} assume true; {3517#true} is VALID [2022-04-14 15:10:14,038 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3517#true} {3537#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #63#return; {3537#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-14 15:10:14,038 INFO L272 TraceCheckUtils]: 23: Hoare triple {3537#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {3517#true} is VALID [2022-04-14 15:10:14,038 INFO L290 TraceCheckUtils]: 24: Hoare triple {3517#true} ~cond := #in~cond; {3517#true} is VALID [2022-04-14 15:10:14,038 INFO L290 TraceCheckUtils]: 25: Hoare triple {3517#true} assume !(0 == ~cond); {3517#true} is VALID [2022-04-14 15:10:14,038 INFO L290 TraceCheckUtils]: 26: Hoare triple {3517#true} assume true; {3517#true} is VALID [2022-04-14 15:10:14,039 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {3517#true} {3537#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #65#return; {3537#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-14 15:10:14,039 INFO L272 TraceCheckUtils]: 28: Hoare triple {3537#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {3517#true} is VALID [2022-04-14 15:10:14,039 INFO L290 TraceCheckUtils]: 29: Hoare triple {3517#true} ~cond := #in~cond; {3517#true} is VALID [2022-04-14 15:10:14,039 INFO L290 TraceCheckUtils]: 30: Hoare triple {3517#true} assume !(0 == ~cond); {3517#true} is VALID [2022-04-14 15:10:14,039 INFO L290 TraceCheckUtils]: 31: Hoare triple {3517#true} assume true; {3517#true} is VALID [2022-04-14 15:10:14,039 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {3517#true} {3537#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #67#return; {3537#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-14 15:10:14,040 INFO L290 TraceCheckUtils]: 33: Hoare triple {3537#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {3622#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~y~0 (+ main_~x~0 6)))} is VALID [2022-04-14 15:10:14,040 INFO L290 TraceCheckUtils]: 34: Hoare triple {3622#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~y~0 (+ main_~x~0 6)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3622#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~y~0 (+ main_~x~0 6)))} is VALID [2022-04-14 15:10:14,041 INFO L290 TraceCheckUtils]: 35: Hoare triple {3622#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~y~0 (+ main_~x~0 6)))} assume !!(#t~post5 < 2);havoc #t~post5; {3622#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~y~0 (+ main_~x~0 6)))} is VALID [2022-04-14 15:10:14,041 INFO L272 TraceCheckUtils]: 36: Hoare triple {3622#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~y~0 (+ main_~x~0 6)))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {3517#true} is VALID [2022-04-14 15:10:14,041 INFO L290 TraceCheckUtils]: 37: Hoare triple {3517#true} ~cond := #in~cond; {3517#true} is VALID [2022-04-14 15:10:14,041 INFO L290 TraceCheckUtils]: 38: Hoare triple {3517#true} assume !(0 == ~cond); {3517#true} is VALID [2022-04-14 15:10:14,041 INFO L290 TraceCheckUtils]: 39: Hoare triple {3517#true} assume true; {3517#true} is VALID [2022-04-14 15:10:14,041 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {3517#true} {3622#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~y~0 (+ main_~x~0 6)))} #59#return; {3622#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~y~0 (+ main_~x~0 6)))} is VALID [2022-04-14 15:10:14,041 INFO L272 TraceCheckUtils]: 41: Hoare triple {3622#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~y~0 (+ main_~x~0 6)))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {3517#true} is VALID [2022-04-14 15:10:14,041 INFO L290 TraceCheckUtils]: 42: Hoare triple {3517#true} ~cond := #in~cond; {3517#true} is VALID [2022-04-14 15:10:14,042 INFO L290 TraceCheckUtils]: 43: Hoare triple {3517#true} assume !(0 == ~cond); {3517#true} is VALID [2022-04-14 15:10:14,042 INFO L290 TraceCheckUtils]: 44: Hoare triple {3517#true} assume true; {3517#true} is VALID [2022-04-14 15:10:14,042 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {3517#true} {3622#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~y~0 (+ main_~x~0 6)))} #61#return; {3622#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~y~0 (+ main_~x~0 6)))} is VALID [2022-04-14 15:10:14,042 INFO L272 TraceCheckUtils]: 46: Hoare triple {3622#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~y~0 (+ main_~x~0 6)))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {3517#true} is VALID [2022-04-14 15:10:14,042 INFO L290 TraceCheckUtils]: 47: Hoare triple {3517#true} ~cond := #in~cond; {3517#true} is VALID [2022-04-14 15:10:14,042 INFO L290 TraceCheckUtils]: 48: Hoare triple {3517#true} assume !(0 == ~cond); {3517#true} is VALID [2022-04-14 15:10:14,042 INFO L290 TraceCheckUtils]: 49: Hoare triple {3517#true} assume true; {3517#true} is VALID [2022-04-14 15:10:14,043 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {3517#true} {3622#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~y~0 (+ main_~x~0 6)))} #63#return; {3622#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~y~0 (+ main_~x~0 6)))} is VALID [2022-04-14 15:10:14,043 INFO L272 TraceCheckUtils]: 51: Hoare triple {3622#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~y~0 (+ main_~x~0 6)))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {3677#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 15:10:14,044 INFO L290 TraceCheckUtils]: 52: Hoare triple {3677#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3681#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:10:14,044 INFO L290 TraceCheckUtils]: 53: Hoare triple {3681#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3518#false} is VALID [2022-04-14 15:10:14,044 INFO L290 TraceCheckUtils]: 54: Hoare triple {3518#false} assume !false; {3518#false} is VALID [2022-04-14 15:10:14,044 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 16 proven. 6 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-14 15:10:14,045 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 15:10:14,322 INFO L290 TraceCheckUtils]: 54: Hoare triple {3518#false} assume !false; {3518#false} is VALID [2022-04-14 15:10:14,322 INFO L290 TraceCheckUtils]: 53: Hoare triple {3681#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3518#false} is VALID [2022-04-14 15:10:14,322 INFO L290 TraceCheckUtils]: 52: Hoare triple {3677#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3681#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:10:14,323 INFO L272 TraceCheckUtils]: 51: Hoare triple {3697#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {3677#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 15:10:14,324 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {3517#true} {3697#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} #63#return; {3697#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} is VALID [2022-04-14 15:10:14,324 INFO L290 TraceCheckUtils]: 49: Hoare triple {3517#true} assume true; {3517#true} is VALID [2022-04-14 15:10:14,324 INFO L290 TraceCheckUtils]: 48: Hoare triple {3517#true} assume !(0 == ~cond); {3517#true} is VALID [2022-04-14 15:10:14,324 INFO L290 TraceCheckUtils]: 47: Hoare triple {3517#true} ~cond := #in~cond; {3517#true} is VALID [2022-04-14 15:10:14,324 INFO L272 TraceCheckUtils]: 46: Hoare triple {3697#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {3517#true} is VALID [2022-04-14 15:10:14,324 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {3517#true} {3697#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} #61#return; {3697#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} is VALID [2022-04-14 15:10:14,325 INFO L290 TraceCheckUtils]: 44: Hoare triple {3517#true} assume true; {3517#true} is VALID [2022-04-14 15:10:14,325 INFO L290 TraceCheckUtils]: 43: Hoare triple {3517#true} assume !(0 == ~cond); {3517#true} is VALID [2022-04-14 15:10:14,325 INFO L290 TraceCheckUtils]: 42: Hoare triple {3517#true} ~cond := #in~cond; {3517#true} is VALID [2022-04-14 15:10:14,325 INFO L272 TraceCheckUtils]: 41: Hoare triple {3697#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {3517#true} is VALID [2022-04-14 15:10:14,325 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {3517#true} {3697#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} #59#return; {3697#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} is VALID [2022-04-14 15:10:14,325 INFO L290 TraceCheckUtils]: 39: Hoare triple {3517#true} assume true; {3517#true} is VALID [2022-04-14 15:10:14,325 INFO L290 TraceCheckUtils]: 38: Hoare triple {3517#true} assume !(0 == ~cond); {3517#true} is VALID [2022-04-14 15:10:14,326 INFO L290 TraceCheckUtils]: 37: Hoare triple {3517#true} ~cond := #in~cond; {3517#true} is VALID [2022-04-14 15:10:14,326 INFO L272 TraceCheckUtils]: 36: Hoare triple {3697#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {3517#true} is VALID [2022-04-14 15:10:14,326 INFO L290 TraceCheckUtils]: 35: Hoare triple {3697#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} assume !!(#t~post5 < 2);havoc #t~post5; {3697#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} is VALID [2022-04-14 15:10:14,326 INFO L290 TraceCheckUtils]: 34: Hoare triple {3697#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3697#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} is VALID [2022-04-14 15:10:14,329 INFO L290 TraceCheckUtils]: 33: Hoare triple {3752#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {3697#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} is VALID [2022-04-14 15:10:14,330 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {3517#true} {3752#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} #67#return; {3752#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} is VALID [2022-04-14 15:10:14,330 INFO L290 TraceCheckUtils]: 31: Hoare triple {3517#true} assume true; {3517#true} is VALID [2022-04-14 15:10:14,330 INFO L290 TraceCheckUtils]: 30: Hoare triple {3517#true} assume !(0 == ~cond); {3517#true} is VALID [2022-04-14 15:10:14,330 INFO L290 TraceCheckUtils]: 29: Hoare triple {3517#true} ~cond := #in~cond; {3517#true} is VALID [2022-04-14 15:10:14,330 INFO L272 TraceCheckUtils]: 28: Hoare triple {3752#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {3517#true} is VALID [2022-04-14 15:10:14,331 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {3517#true} {3752#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} #65#return; {3752#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} is VALID [2022-04-14 15:10:14,331 INFO L290 TraceCheckUtils]: 26: Hoare triple {3517#true} assume true; {3517#true} is VALID [2022-04-14 15:10:14,331 INFO L290 TraceCheckUtils]: 25: Hoare triple {3517#true} assume !(0 == ~cond); {3517#true} is VALID [2022-04-14 15:10:14,331 INFO L290 TraceCheckUtils]: 24: Hoare triple {3517#true} ~cond := #in~cond; {3517#true} is VALID [2022-04-14 15:10:14,331 INFO L272 TraceCheckUtils]: 23: Hoare triple {3752#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {3517#true} is VALID [2022-04-14 15:10:14,331 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3517#true} {3752#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} #63#return; {3752#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} is VALID [2022-04-14 15:10:14,332 INFO L290 TraceCheckUtils]: 21: Hoare triple {3517#true} assume true; {3517#true} is VALID [2022-04-14 15:10:14,332 INFO L290 TraceCheckUtils]: 20: Hoare triple {3517#true} assume !(0 == ~cond); {3517#true} is VALID [2022-04-14 15:10:14,332 INFO L290 TraceCheckUtils]: 19: Hoare triple {3517#true} ~cond := #in~cond; {3517#true} is VALID [2022-04-14 15:10:14,332 INFO L272 TraceCheckUtils]: 18: Hoare triple {3752#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {3517#true} is VALID [2022-04-14 15:10:14,332 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {3517#true} {3752#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} #61#return; {3752#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} is VALID [2022-04-14 15:10:14,332 INFO L290 TraceCheckUtils]: 16: Hoare triple {3517#true} assume true; {3517#true} is VALID [2022-04-14 15:10:14,332 INFO L290 TraceCheckUtils]: 15: Hoare triple {3517#true} assume !(0 == ~cond); {3517#true} is VALID [2022-04-14 15:10:14,332 INFO L290 TraceCheckUtils]: 14: Hoare triple {3517#true} ~cond := #in~cond; {3517#true} is VALID [2022-04-14 15:10:14,333 INFO L272 TraceCheckUtils]: 13: Hoare triple {3752#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {3517#true} is VALID [2022-04-14 15:10:14,333 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {3517#true} {3752#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} #59#return; {3752#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} is VALID [2022-04-14 15:10:14,333 INFO L290 TraceCheckUtils]: 11: Hoare triple {3517#true} assume true; {3517#true} is VALID [2022-04-14 15:10:14,333 INFO L290 TraceCheckUtils]: 10: Hoare triple {3517#true} assume !(0 == ~cond); {3517#true} is VALID [2022-04-14 15:10:14,333 INFO L290 TraceCheckUtils]: 9: Hoare triple {3517#true} ~cond := #in~cond; {3517#true} is VALID [2022-04-14 15:10:14,333 INFO L272 TraceCheckUtils]: 8: Hoare triple {3752#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {3517#true} is VALID [2022-04-14 15:10:14,334 INFO L290 TraceCheckUtils]: 7: Hoare triple {3752#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} assume !!(#t~post5 < 2);havoc #t~post5; {3752#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} is VALID [2022-04-14 15:10:14,334 INFO L290 TraceCheckUtils]: 6: Hoare triple {3752#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3752#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} is VALID [2022-04-14 15:10:14,335 INFO L290 TraceCheckUtils]: 5: Hoare triple {3517#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {3752#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} is VALID [2022-04-14 15:10:14,335 INFO L272 TraceCheckUtils]: 4: Hoare triple {3517#true} call #t~ret6 := main(); {3517#true} is VALID [2022-04-14 15:10:14,335 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3517#true} {3517#true} #81#return; {3517#true} is VALID [2022-04-14 15:10:14,335 INFO L290 TraceCheckUtils]: 2: Hoare triple {3517#true} assume true; {3517#true} is VALID [2022-04-14 15:10:14,335 INFO L290 TraceCheckUtils]: 1: Hoare triple {3517#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3517#true} is VALID [2022-04-14 15:10:14,335 INFO L272 TraceCheckUtils]: 0: Hoare triple {3517#true} call ULTIMATE.init(); {3517#true} is VALID [2022-04-14 15:10:14,335 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 16 proven. 6 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-14 15:10:14,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:10:14,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576863994] [2022-04-14 15:10:14,336 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 15:10:14,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1970504913] [2022-04-14 15:10:14,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1970504913] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 15:10:14,336 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-14 15:10:14,336 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-04-14 15:10:14,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954373084] [2022-04-14 15:10:14,336 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-14 15:10:14,336 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, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) Word has length 55 [2022-04-14 15:10:14,337 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:10:14,337 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, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-14 15:10:14,391 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:10:14,391 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-14 15:10:14,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:10:14,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-14 15:10:14,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-14 15:10:14,392 INFO L87 Difference]: Start difference. First operand 71 states and 82 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, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-14 15:10:15,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:10:15,348 INFO L93 Difference]: Finished difference Result 90 states and 107 transitions. [2022-04-14 15:10:15,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-14 15:10:15,348 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, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) Word has length 55 [2022-04-14 15:10:15,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:10:15,349 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, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-14 15:10:15,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 80 transitions. [2022-04-14 15:10:15,350 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, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-14 15:10:15,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 80 transitions. [2022-04-14 15:10:15,351 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 80 transitions. [2022-04-14 15:10:15,438 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:10:15,439 INFO L225 Difference]: With dead ends: 90 [2022-04-14 15:10:15,439 INFO L226 Difference]: Without dead ends: 82 [2022-04-14 15:10:15,439 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-04-14 15:10:15,440 INFO L913 BasicCegarLoop]: 47 mSDtfsCounter, 12 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-14 15:10:15,440 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 124 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-14 15:10:15,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-04-14 15:10:15,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 76. [2022-04-14 15:10:15,461 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:10:15,461 INFO L82 GeneralOperation]: Start isEquivalent. First operand 82 states. Second operand has 76 states, 45 states have (on average 1.0666666666666667) internal successors, (48), 47 states have internal predecessors, (48), 18 states have call successors, (18), 13 states have call predecessors, (18), 12 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-14 15:10:15,462 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand has 76 states, 45 states have (on average 1.0666666666666667) internal successors, (48), 47 states have internal predecessors, (48), 18 states have call successors, (18), 13 states have call predecessors, (18), 12 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-14 15:10:15,462 INFO L87 Difference]: Start difference. First operand 82 states. Second operand has 76 states, 45 states have (on average 1.0666666666666667) internal successors, (48), 47 states have internal predecessors, (48), 18 states have call successors, (18), 13 states have call predecessors, (18), 12 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-14 15:10:15,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:10:15,463 INFO L93 Difference]: Finished difference Result 82 states and 93 transitions. [2022-04-14 15:10:15,463 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 93 transitions. [2022-04-14 15:10:15,463 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:10:15,463 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:10:15,464 INFO L74 IsIncluded]: Start isIncluded. First operand has 76 states, 45 states have (on average 1.0666666666666667) internal successors, (48), 47 states have internal predecessors, (48), 18 states have call successors, (18), 13 states have call predecessors, (18), 12 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) Second operand 82 states. [2022-04-14 15:10:15,464 INFO L87 Difference]: Start difference. First operand has 76 states, 45 states have (on average 1.0666666666666667) internal successors, (48), 47 states have internal predecessors, (48), 18 states have call successors, (18), 13 states have call predecessors, (18), 12 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) Second operand 82 states. [2022-04-14 15:10:15,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:10:15,465 INFO L93 Difference]: Finished difference Result 82 states and 93 transitions. [2022-04-14 15:10:15,465 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 93 transitions. [2022-04-14 15:10:15,465 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:10:15,465 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:10:15,465 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:10:15,465 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:10:15,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 45 states have (on average 1.0666666666666667) internal successors, (48), 47 states have internal predecessors, (48), 18 states have call successors, (18), 13 states have call predecessors, (18), 12 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-14 15:10:15,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 82 transitions. [2022-04-14 15:10:15,467 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 82 transitions. Word has length 55 [2022-04-14 15:10:15,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:10:15,467 INFO L478 AbstractCegarLoop]: Abstraction has 76 states and 82 transitions. [2022-04-14 15:10:15,467 INFO L479 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, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-14 15:10:15,467 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2022-04-14 15:10:15,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-04-14 15:10:15,467 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:10:15,468 INFO L499 BasicCegarLoop]: trace histogram [12, 11, 11, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 15:10:15,484 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-14 15:10:15,679 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:10:15,679 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:10:15,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:10:15,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1284663070, now seen corresponding path program 1 times [2022-04-14 15:10:15,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:10:15,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712549485] [2022-04-14 15:10:15,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:10:15,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:10:15,694 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 15:10:15,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1837199809] [2022-04-14 15:10:15,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:10:15,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:10:15,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:10:15,695 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 15:10:15,696 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-14 15:10:15,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:10:15,741 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-14 15:10:15,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:10:15,753 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 15:10:19,421 INFO L272 TraceCheckUtils]: 0: Hoare triple {4267#true} call ULTIMATE.init(); {4267#true} is VALID [2022-04-14 15:10:19,421 INFO L290 TraceCheckUtils]: 1: Hoare triple {4267#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {4267#true} is VALID [2022-04-14 15:10:19,421 INFO L290 TraceCheckUtils]: 2: Hoare triple {4267#true} assume true; {4267#true} is VALID [2022-04-14 15:10:19,421 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4267#true} {4267#true} #81#return; {4267#true} is VALID [2022-04-14 15:10:19,421 INFO L272 TraceCheckUtils]: 4: Hoare triple {4267#true} call #t~ret6 := main(); {4267#true} is VALID [2022-04-14 15:10:19,422 INFO L290 TraceCheckUtils]: 5: Hoare triple {4267#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {4287#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} is VALID [2022-04-14 15:10:19,423 INFO L290 TraceCheckUtils]: 6: Hoare triple {4287#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4287#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} is VALID [2022-04-14 15:10:19,429 INFO L290 TraceCheckUtils]: 7: Hoare triple {4287#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} assume !!(#t~post5 < 2);havoc #t~post5; {4287#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} is VALID [2022-04-14 15:10:19,430 INFO L272 TraceCheckUtils]: 8: Hoare triple {4287#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {4267#true} is VALID [2022-04-14 15:10:19,432 INFO L290 TraceCheckUtils]: 9: Hoare triple {4267#true} ~cond := #in~cond; {4267#true} is VALID [2022-04-14 15:10:19,432 INFO L290 TraceCheckUtils]: 10: Hoare triple {4267#true} assume !(0 == ~cond); {4267#true} is VALID [2022-04-14 15:10:19,432 INFO L290 TraceCheckUtils]: 11: Hoare triple {4267#true} assume true; {4267#true} is VALID [2022-04-14 15:10:19,433 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {4267#true} {4287#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} #59#return; {4287#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} is VALID [2022-04-14 15:10:19,433 INFO L272 TraceCheckUtils]: 13: Hoare triple {4287#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {4267#true} is VALID [2022-04-14 15:10:19,433 INFO L290 TraceCheckUtils]: 14: Hoare triple {4267#true} ~cond := #in~cond; {4267#true} is VALID [2022-04-14 15:10:19,433 INFO L290 TraceCheckUtils]: 15: Hoare triple {4267#true} assume !(0 == ~cond); {4267#true} is VALID [2022-04-14 15:10:19,434 INFO L290 TraceCheckUtils]: 16: Hoare triple {4267#true} assume true; {4267#true} is VALID [2022-04-14 15:10:19,434 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {4267#true} {4287#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} #61#return; {4287#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} is VALID [2022-04-14 15:10:19,435 INFO L272 TraceCheckUtils]: 18: Hoare triple {4287#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {4267#true} is VALID [2022-04-14 15:10:19,435 INFO L290 TraceCheckUtils]: 19: Hoare triple {4267#true} ~cond := #in~cond; {4267#true} is VALID [2022-04-14 15:10:19,435 INFO L290 TraceCheckUtils]: 20: Hoare triple {4267#true} assume !(0 == ~cond); {4267#true} is VALID [2022-04-14 15:10:19,435 INFO L290 TraceCheckUtils]: 21: Hoare triple {4267#true} assume true; {4267#true} is VALID [2022-04-14 15:10:19,438 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {4267#true} {4287#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} #63#return; {4287#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} is VALID [2022-04-14 15:10:19,438 INFO L272 TraceCheckUtils]: 23: Hoare triple {4287#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {4267#true} is VALID [2022-04-14 15:10:19,438 INFO L290 TraceCheckUtils]: 24: Hoare triple {4267#true} ~cond := #in~cond; {4267#true} is VALID [2022-04-14 15:10:19,438 INFO L290 TraceCheckUtils]: 25: Hoare triple {4267#true} assume !(0 == ~cond); {4267#true} is VALID [2022-04-14 15:10:19,438 INFO L290 TraceCheckUtils]: 26: Hoare triple {4267#true} assume true; {4267#true} is VALID [2022-04-14 15:10:19,438 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {4267#true} {4287#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} #65#return; {4287#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} is VALID [2022-04-14 15:10:19,438 INFO L272 TraceCheckUtils]: 28: Hoare triple {4287#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {4267#true} is VALID [2022-04-14 15:10:19,438 INFO L290 TraceCheckUtils]: 29: Hoare triple {4267#true} ~cond := #in~cond; {4267#true} is VALID [2022-04-14 15:10:19,439 INFO L290 TraceCheckUtils]: 30: Hoare triple {4267#true} assume !(0 == ~cond); {4267#true} is VALID [2022-04-14 15:10:19,439 INFO L290 TraceCheckUtils]: 31: Hoare triple {4267#true} assume true; {4267#true} is VALID [2022-04-14 15:10:19,441 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {4267#true} {4287#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} #67#return; {4287#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} is VALID [2022-04-14 15:10:19,441 INFO L290 TraceCheckUtils]: 33: Hoare triple {4287#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {4372#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} is VALID [2022-04-14 15:10:19,442 INFO L290 TraceCheckUtils]: 34: Hoare triple {4372#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4372#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} is VALID [2022-04-14 15:10:19,442 INFO L290 TraceCheckUtils]: 35: Hoare triple {4372#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} assume !!(#t~post5 < 2);havoc #t~post5; {4372#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} is VALID [2022-04-14 15:10:19,442 INFO L272 TraceCheckUtils]: 36: Hoare triple {4372#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {4267#true} is VALID [2022-04-14 15:10:19,442 INFO L290 TraceCheckUtils]: 37: Hoare triple {4267#true} ~cond := #in~cond; {4267#true} is VALID [2022-04-14 15:10:19,442 INFO L290 TraceCheckUtils]: 38: Hoare triple {4267#true} assume !(0 == ~cond); {4267#true} is VALID [2022-04-14 15:10:19,442 INFO L290 TraceCheckUtils]: 39: Hoare triple {4267#true} assume true; {4267#true} is VALID [2022-04-14 15:10:19,443 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {4267#true} {4372#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} #59#return; {4372#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} is VALID [2022-04-14 15:10:19,443 INFO L272 TraceCheckUtils]: 41: Hoare triple {4372#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {4267#true} is VALID [2022-04-14 15:10:19,443 INFO L290 TraceCheckUtils]: 42: Hoare triple {4267#true} ~cond := #in~cond; {4267#true} is VALID [2022-04-14 15:10:19,443 INFO L290 TraceCheckUtils]: 43: Hoare triple {4267#true} assume !(0 == ~cond); {4267#true} is VALID [2022-04-14 15:10:19,443 INFO L290 TraceCheckUtils]: 44: Hoare triple {4267#true} assume true; {4267#true} is VALID [2022-04-14 15:10:19,455 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {4267#true} {4372#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} #61#return; {4372#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} is VALID [2022-04-14 15:10:19,455 INFO L272 TraceCheckUtils]: 46: Hoare triple {4372#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {4267#true} is VALID [2022-04-14 15:10:19,455 INFO L290 TraceCheckUtils]: 47: Hoare triple {4267#true} ~cond := #in~cond; {4267#true} is VALID [2022-04-14 15:10:19,455 INFO L290 TraceCheckUtils]: 48: Hoare triple {4267#true} assume !(0 == ~cond); {4267#true} is VALID [2022-04-14 15:10:19,456 INFO L290 TraceCheckUtils]: 49: Hoare triple {4267#true} assume true; {4267#true} is VALID [2022-04-14 15:10:19,456 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4267#true} {4372#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} #63#return; {4372#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} is VALID [2022-04-14 15:10:19,456 INFO L272 TraceCheckUtils]: 51: Hoare triple {4372#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {4267#true} is VALID [2022-04-14 15:10:19,456 INFO L290 TraceCheckUtils]: 52: Hoare triple {4267#true} ~cond := #in~cond; {4267#true} is VALID [2022-04-14 15:10:19,456 INFO L290 TraceCheckUtils]: 53: Hoare triple {4267#true} assume !(0 == ~cond); {4267#true} is VALID [2022-04-14 15:10:19,456 INFO L290 TraceCheckUtils]: 54: Hoare triple {4267#true} assume true; {4267#true} is VALID [2022-04-14 15:10:19,456 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {4267#true} {4372#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} #65#return; {4372#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} is VALID [2022-04-14 15:10:19,456 INFO L272 TraceCheckUtils]: 56: Hoare triple {4372#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {4267#true} is VALID [2022-04-14 15:10:19,457 INFO L290 TraceCheckUtils]: 57: Hoare triple {4267#true} ~cond := #in~cond; {4267#true} is VALID [2022-04-14 15:10:19,457 INFO L290 TraceCheckUtils]: 58: Hoare triple {4267#true} assume !(0 == ~cond); {4267#true} is VALID [2022-04-14 15:10:19,457 INFO L290 TraceCheckUtils]: 59: Hoare triple {4267#true} assume true; {4267#true} is VALID [2022-04-14 15:10:19,457 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {4267#true} {4372#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} #67#return; {4372#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} is VALID [2022-04-14 15:10:19,458 INFO L290 TraceCheckUtils]: 61: Hoare triple {4372#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} assume !(~n~0 <= ~a~0); {4457#(and (= main_~z~0 12) (= main_~x~0 1) (<= 0 main_~a~0) (< main_~a~0 1))} is VALID [2022-04-14 15:10:19,458 INFO L272 TraceCheckUtils]: 62: Hoare triple {4457#(and (= main_~z~0 12) (= main_~x~0 1) (<= 0 main_~a~0) (< main_~a~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {4267#true} is VALID [2022-04-14 15:10:19,458 INFO L290 TraceCheckUtils]: 63: Hoare triple {4267#true} ~cond := #in~cond; {4267#true} is VALID [2022-04-14 15:10:19,458 INFO L290 TraceCheckUtils]: 64: Hoare triple {4267#true} assume !(0 == ~cond); {4267#true} is VALID [2022-04-14 15:10:19,458 INFO L290 TraceCheckUtils]: 65: Hoare triple {4267#true} assume true; {4267#true} is VALID [2022-04-14 15:10:19,458 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {4267#true} {4457#(and (= main_~z~0 12) (= main_~x~0 1) (<= 0 main_~a~0) (< main_~a~0 1))} #69#return; {4457#(and (= main_~z~0 12) (= main_~x~0 1) (<= 0 main_~a~0) (< main_~a~0 1))} is VALID [2022-04-14 15:10:19,459 INFO L272 TraceCheckUtils]: 67: Hoare triple {4457#(and (= main_~z~0 12) (= main_~x~0 1) (<= 0 main_~a~0) (< main_~a~0 1))} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {4476#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 15:10:19,459 INFO L290 TraceCheckUtils]: 68: Hoare triple {4476#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4480#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:10:19,459 INFO L290 TraceCheckUtils]: 69: Hoare triple {4480#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4268#false} is VALID [2022-04-14 15:10:19,459 INFO L290 TraceCheckUtils]: 70: Hoare triple {4268#false} assume !false; {4268#false} is VALID [2022-04-14 15:10:19,460 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 22 proven. 8 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-04-14 15:10:19,460 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 15:10:20,007 INFO L290 TraceCheckUtils]: 70: Hoare triple {4268#false} assume !false; {4268#false} is VALID [2022-04-14 15:10:20,007 INFO L290 TraceCheckUtils]: 69: Hoare triple {4480#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4268#false} is VALID [2022-04-14 15:10:20,007 INFO L290 TraceCheckUtils]: 68: Hoare triple {4476#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4480#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:10:20,008 INFO L272 TraceCheckUtils]: 67: Hoare triple {4496#(= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {4476#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 15:10:20,008 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {4267#true} {4496#(= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))} #69#return; {4496#(= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))} is VALID [2022-04-14 15:10:20,008 INFO L290 TraceCheckUtils]: 65: Hoare triple {4267#true} assume true; {4267#true} is VALID [2022-04-14 15:10:20,008 INFO L290 TraceCheckUtils]: 64: Hoare triple {4267#true} assume !(0 == ~cond); {4267#true} is VALID [2022-04-14 15:10:20,008 INFO L290 TraceCheckUtils]: 63: Hoare triple {4267#true} ~cond := #in~cond; {4267#true} is VALID [2022-04-14 15:10:20,008 INFO L272 TraceCheckUtils]: 62: Hoare triple {4496#(= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {4267#true} is VALID [2022-04-14 15:10:20,009 INFO L290 TraceCheckUtils]: 61: Hoare triple {4515#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} assume !(~n~0 <= ~a~0); {4496#(= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))} is VALID [2022-04-14 15:10:20,009 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {4267#true} {4515#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} #67#return; {4515#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} is VALID [2022-04-14 15:10:20,009 INFO L290 TraceCheckUtils]: 59: Hoare triple {4267#true} assume true; {4267#true} is VALID [2022-04-14 15:10:20,009 INFO L290 TraceCheckUtils]: 58: Hoare triple {4267#true} assume !(0 == ~cond); {4267#true} is VALID [2022-04-14 15:10:20,009 INFO L290 TraceCheckUtils]: 57: Hoare triple {4267#true} ~cond := #in~cond; {4267#true} is VALID [2022-04-14 15:10:20,009 INFO L272 TraceCheckUtils]: 56: Hoare triple {4515#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {4267#true} is VALID [2022-04-14 15:10:20,010 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {4267#true} {4515#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} #65#return; {4515#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} is VALID [2022-04-14 15:10:20,010 INFO L290 TraceCheckUtils]: 54: Hoare triple {4267#true} assume true; {4267#true} is VALID [2022-04-14 15:10:20,010 INFO L290 TraceCheckUtils]: 53: Hoare triple {4267#true} assume !(0 == ~cond); {4267#true} is VALID [2022-04-14 15:10:20,010 INFO L290 TraceCheckUtils]: 52: Hoare triple {4267#true} ~cond := #in~cond; {4267#true} is VALID [2022-04-14 15:10:20,010 INFO L272 TraceCheckUtils]: 51: Hoare triple {4515#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {4267#true} is VALID [2022-04-14 15:10:20,010 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4267#true} {4515#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} #63#return; {4515#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} is VALID [2022-04-14 15:10:20,010 INFO L290 TraceCheckUtils]: 49: Hoare triple {4267#true} assume true; {4267#true} is VALID [2022-04-14 15:10:20,010 INFO L290 TraceCheckUtils]: 48: Hoare triple {4267#true} assume !(0 == ~cond); {4267#true} is VALID [2022-04-14 15:10:20,010 INFO L290 TraceCheckUtils]: 47: Hoare triple {4267#true} ~cond := #in~cond; {4267#true} is VALID [2022-04-14 15:10:20,010 INFO L272 TraceCheckUtils]: 46: Hoare triple {4515#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {4267#true} is VALID [2022-04-14 15:10:20,011 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {4267#true} {4515#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} #61#return; {4515#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} is VALID [2022-04-14 15:10:20,011 INFO L290 TraceCheckUtils]: 44: Hoare triple {4267#true} assume true; {4267#true} is VALID [2022-04-14 15:10:20,011 INFO L290 TraceCheckUtils]: 43: Hoare triple {4267#true} assume !(0 == ~cond); {4267#true} is VALID [2022-04-14 15:10:20,011 INFO L290 TraceCheckUtils]: 42: Hoare triple {4267#true} ~cond := #in~cond; {4267#true} is VALID [2022-04-14 15:10:20,011 INFO L272 TraceCheckUtils]: 41: Hoare triple {4515#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {4267#true} is VALID [2022-04-14 15:10:20,012 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {4267#true} {4515#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} #59#return; {4515#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} is VALID [2022-04-14 15:10:20,012 INFO L290 TraceCheckUtils]: 39: Hoare triple {4267#true} assume true; {4267#true} is VALID [2022-04-14 15:10:20,012 INFO L290 TraceCheckUtils]: 38: Hoare triple {4267#true} assume !(0 == ~cond); {4267#true} is VALID [2022-04-14 15:10:20,012 INFO L290 TraceCheckUtils]: 37: Hoare triple {4267#true} ~cond := #in~cond; {4267#true} is VALID [2022-04-14 15:10:20,012 INFO L272 TraceCheckUtils]: 36: Hoare triple {4515#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {4267#true} is VALID [2022-04-14 15:10:20,012 INFO L290 TraceCheckUtils]: 35: Hoare triple {4515#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} assume !!(#t~post5 < 2);havoc #t~post5; {4515#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} is VALID [2022-04-14 15:10:20,013 INFO L290 TraceCheckUtils]: 34: Hoare triple {4515#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4515#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} is VALID [2022-04-14 15:10:20,015 INFO L290 TraceCheckUtils]: 33: Hoare triple {4600#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {4515#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} is VALID [2022-04-14 15:10:20,015 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {4267#true} {4600#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} #67#return; {4600#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} is VALID [2022-04-14 15:10:20,016 INFO L290 TraceCheckUtils]: 31: Hoare triple {4267#true} assume true; {4267#true} is VALID [2022-04-14 15:10:20,016 INFO L290 TraceCheckUtils]: 30: Hoare triple {4267#true} assume !(0 == ~cond); {4267#true} is VALID [2022-04-14 15:10:20,016 INFO L290 TraceCheckUtils]: 29: Hoare triple {4267#true} ~cond := #in~cond; {4267#true} is VALID [2022-04-14 15:10:20,016 INFO L272 TraceCheckUtils]: 28: Hoare triple {4600#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {4267#true} is VALID [2022-04-14 15:10:20,016 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {4267#true} {4600#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} #65#return; {4600#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} is VALID [2022-04-14 15:10:20,016 INFO L290 TraceCheckUtils]: 26: Hoare triple {4267#true} assume true; {4267#true} is VALID [2022-04-14 15:10:20,016 INFO L290 TraceCheckUtils]: 25: Hoare triple {4267#true} assume !(0 == ~cond); {4267#true} is VALID [2022-04-14 15:10:20,016 INFO L290 TraceCheckUtils]: 24: Hoare triple {4267#true} ~cond := #in~cond; {4267#true} is VALID [2022-04-14 15:10:20,016 INFO L272 TraceCheckUtils]: 23: Hoare triple {4600#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {4267#true} is VALID [2022-04-14 15:10:20,017 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {4267#true} {4600#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} #63#return; {4600#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} is VALID [2022-04-14 15:10:20,017 INFO L290 TraceCheckUtils]: 21: Hoare triple {4267#true} assume true; {4267#true} is VALID [2022-04-14 15:10:20,017 INFO L290 TraceCheckUtils]: 20: Hoare triple {4267#true} assume !(0 == ~cond); {4267#true} is VALID [2022-04-14 15:10:20,017 INFO L290 TraceCheckUtils]: 19: Hoare triple {4267#true} ~cond := #in~cond; {4267#true} is VALID [2022-04-14 15:10:20,017 INFO L272 TraceCheckUtils]: 18: Hoare triple {4600#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {4267#true} is VALID [2022-04-14 15:10:20,017 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {4267#true} {4600#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} #61#return; {4600#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} is VALID [2022-04-14 15:10:20,017 INFO L290 TraceCheckUtils]: 16: Hoare triple {4267#true} assume true; {4267#true} is VALID [2022-04-14 15:10:20,017 INFO L290 TraceCheckUtils]: 15: Hoare triple {4267#true} assume !(0 == ~cond); {4267#true} is VALID [2022-04-14 15:10:20,017 INFO L290 TraceCheckUtils]: 14: Hoare triple {4267#true} ~cond := #in~cond; {4267#true} is VALID [2022-04-14 15:10:20,017 INFO L272 TraceCheckUtils]: 13: Hoare triple {4600#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {4267#true} is VALID [2022-04-14 15:10:20,018 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {4267#true} {4600#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} #59#return; {4600#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} is VALID [2022-04-14 15:10:20,018 INFO L290 TraceCheckUtils]: 11: Hoare triple {4267#true} assume true; {4267#true} is VALID [2022-04-14 15:10:20,018 INFO L290 TraceCheckUtils]: 10: Hoare triple {4267#true} assume !(0 == ~cond); {4267#true} is VALID [2022-04-14 15:10:20,018 INFO L290 TraceCheckUtils]: 9: Hoare triple {4267#true} ~cond := #in~cond; {4267#true} is VALID [2022-04-14 15:10:20,018 INFO L272 TraceCheckUtils]: 8: Hoare triple {4600#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {4267#true} is VALID [2022-04-14 15:10:20,019 INFO L290 TraceCheckUtils]: 7: Hoare triple {4600#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} assume !!(#t~post5 < 2);havoc #t~post5; {4600#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} is VALID [2022-04-14 15:10:20,020 INFO L290 TraceCheckUtils]: 6: Hoare triple {4600#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4600#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} is VALID [2022-04-14 15:10:20,020 INFO L290 TraceCheckUtils]: 5: Hoare triple {4267#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {4600#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} is VALID [2022-04-14 15:10:20,020 INFO L272 TraceCheckUtils]: 4: Hoare triple {4267#true} call #t~ret6 := main(); {4267#true} is VALID [2022-04-14 15:10:20,020 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4267#true} {4267#true} #81#return; {4267#true} is VALID [2022-04-14 15:10:20,020 INFO L290 TraceCheckUtils]: 2: Hoare triple {4267#true} assume true; {4267#true} is VALID [2022-04-14 15:10:20,020 INFO L290 TraceCheckUtils]: 1: Hoare triple {4267#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {4267#true} is VALID [2022-04-14 15:10:20,020 INFO L272 TraceCheckUtils]: 0: Hoare triple {4267#true} call ULTIMATE.init(); {4267#true} is VALID [2022-04-14 15:10:20,021 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 22 proven. 8 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-04-14 15:10:20,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:10:20,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712549485] [2022-04-14 15:10:20,021 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 15:10:20,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1837199809] [2022-04-14 15:10:20,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1837199809] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 15:10:20,021 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-14 15:10:20,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2022-04-14 15:10:20,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124632601] [2022-04-14 15:10:20,022 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-14 15:10:20,022 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 7 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 7 states have call predecessors, (23), 7 states have call successors, (23) Word has length 71 [2022-04-14 15:10:20,024 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:10:20,024 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 7 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 7 states have call predecessors, (23), 7 states have call successors, (23) [2022-04-14 15:10:20,074 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:10:20,074 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-14 15:10:20,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:10:20,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-14 15:10:20,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-14 15:10:20,074 INFO L87 Difference]: Start difference. First operand 76 states and 82 transitions. Second operand has 10 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 7 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 7 states have call predecessors, (23), 7 states have call successors, (23) [2022-04-14 15:10:21,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:10:21,029 INFO L93 Difference]: Finished difference Result 109 states and 131 transitions. [2022-04-14 15:10:21,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-14 15:10:21,030 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 7 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 7 states have call predecessors, (23), 7 states have call successors, (23) Word has length 71 [2022-04-14 15:10:21,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:10:21,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 7 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 7 states have call predecessors, (23), 7 states have call successors, (23) [2022-04-14 15:10:21,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 98 transitions. [2022-04-14 15:10:21,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 7 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 7 states have call predecessors, (23), 7 states have call successors, (23) [2022-04-14 15:10:21,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 98 transitions. [2022-04-14 15:10:21,033 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 98 transitions. [2022-04-14 15:10:21,111 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:10:21,122 INFO L225 Difference]: With dead ends: 109 [2022-04-14 15:10:21,122 INFO L226 Difference]: Without dead ends: 107 [2022-04-14 15:10:21,123 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 132 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2022-04-14 15:10:21,123 INFO L913 BasicCegarLoop]: 51 mSDtfsCounter, 11 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-14 15:10:21,123 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 218 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-14 15:10:21,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-04-14 15:10:21,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 97. [2022-04-14 15:10:21,188 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:10:21,188 INFO L82 GeneralOperation]: Start isEquivalent. First operand 107 states. Second operand has 97 states, 55 states have (on average 1.1090909090909091) internal successors, (61), 57 states have internal predecessors, (61), 27 states have call successors, (27), 15 states have call predecessors, (27), 14 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-14 15:10:21,189 INFO L74 IsIncluded]: Start isIncluded. First operand 107 states. Second operand has 97 states, 55 states have (on average 1.1090909090909091) internal successors, (61), 57 states have internal predecessors, (61), 27 states have call successors, (27), 15 states have call predecessors, (27), 14 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-14 15:10:21,190 INFO L87 Difference]: Start difference. First operand 107 states. Second operand has 97 states, 55 states have (on average 1.1090909090909091) internal successors, (61), 57 states have internal predecessors, (61), 27 states have call successors, (27), 15 states have call predecessors, (27), 14 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-14 15:10:21,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:10:21,194 INFO L93 Difference]: Finished difference Result 107 states and 129 transitions. [2022-04-14 15:10:21,194 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 129 transitions. [2022-04-14 15:10:21,195 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:10:21,195 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:10:21,196 INFO L74 IsIncluded]: Start isIncluded. First operand has 97 states, 55 states have (on average 1.1090909090909091) internal successors, (61), 57 states have internal predecessors, (61), 27 states have call successors, (27), 15 states have call predecessors, (27), 14 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) Second operand 107 states. [2022-04-14 15:10:21,196 INFO L87 Difference]: Start difference. First operand has 97 states, 55 states have (on average 1.1090909090909091) internal successors, (61), 57 states have internal predecessors, (61), 27 states have call successors, (27), 15 states have call predecessors, (27), 14 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) Second operand 107 states. [2022-04-14 15:10:21,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:10:21,198 INFO L93 Difference]: Finished difference Result 107 states and 129 transitions. [2022-04-14 15:10:21,198 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 129 transitions. [2022-04-14 15:10:21,199 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:10:21,199 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:10:21,199 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:10:21,199 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:10:21,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 55 states have (on average 1.1090909090909091) internal successors, (61), 57 states have internal predecessors, (61), 27 states have call successors, (27), 15 states have call predecessors, (27), 14 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-14 15:10:21,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 113 transitions. [2022-04-14 15:10:21,202 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 113 transitions. Word has length 71 [2022-04-14 15:10:21,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:10:21,202 INFO L478 AbstractCegarLoop]: Abstraction has 97 states and 113 transitions. [2022-04-14 15:10:21,202 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 7 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 7 states have call predecessors, (23), 7 states have call successors, (23) [2022-04-14 15:10:21,202 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 113 transitions. [2022-04-14 15:10:21,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-04-14 15:10:21,203 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:10:21,203 INFO L499 BasicCegarLoop]: trace histogram [12, 11, 11, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 15:10:21,219 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-14 15:10:21,414 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-04-14 15:10:21,414 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:10:21,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:10:21,415 INFO L85 PathProgramCache]: Analyzing trace with hash -2139863911, now seen corresponding path program 2 times [2022-04-14 15:10:21,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:10:21,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682030945] [2022-04-14 15:10:21,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:10:21,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:10:21,426 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 15:10:21,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [701059204] [2022-04-14 15:10:21,426 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-14 15:10:21,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:10:21,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:10:21,434 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 15:10:21,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-14 15:10:21,484 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-14 15:10:21,485 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-04-14 15:10:21,485 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-14 15:10:21,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-14 15:10:21,546 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-14 15:10:21,546 INFO L618 BasicCegarLoop]: Counterexample is feasible [2022-04-14 15:10:21,546 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-14 15:10:21,569 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-14 15:10:21,767 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:10:21,769 INFO L719 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 15:10:21,771 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-14 15:10:21,799 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-14 15:10:21,799 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-14 15:10:21,799 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-14 15:10:21,799 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-14 15:10:21,799 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-14 15:10:21,799 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-14 15:10:21,799 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2022-04-14 15:10:21,799 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-14 15:10:21,799 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-14 15:10:21,799 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-14 15:10:21,799 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-14 15:10:21,799 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-14 15:10:21,799 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-14 15:10:21,799 WARN L170 areAnnotationChecker]: L33-3 has no Hoare annotation [2022-04-14 15:10:21,799 WARN L170 areAnnotationChecker]: L33-3 has no Hoare annotation [2022-04-14 15:10:21,799 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-14 15:10:21,799 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-14 15:10:21,799 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-14 15:10:21,799 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-14 15:10:21,799 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2022-04-14 15:10:21,799 WARN L170 areAnnotationChecker]: L33-4 has no Hoare annotation [2022-04-14 15:10:21,799 WARN L170 areAnnotationChecker]: L33-4 has no Hoare annotation [2022-04-14 15:10:21,799 WARN L170 areAnnotationChecker]: L33-1 has no Hoare annotation [2022-04-14 15:10:21,799 WARN L170 areAnnotationChecker]: L33-1 has no Hoare annotation [2022-04-14 15:10:21,799 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-14 15:10:21,799 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-14 15:10:21,800 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2022-04-14 15:10:21,800 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-04-14 15:10:21,800 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-04-14 15:10:21,800 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2022-04-14 15:10:21,800 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2022-04-14 15:10:21,800 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-14 15:10:21,800 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-14 15:10:21,800 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-14 15:10:21,800 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-14 15:10:21,800 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-14 15:10:21,800 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-14 15:10:21,800 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-14 15:10:21,800 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-14 15:10:21,800 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-14 15:10:21,800 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-14 15:10:21,800 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-14 15:10:21,800 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2022-04-14 15:10:21,800 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2022-04-14 15:10:21,800 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-04-14 15:10:21,800 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-04-14 15:10:21,800 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-14 15:10:21,800 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-14 15:10:21,800 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-04-14 15:10:21,800 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-04-14 15:10:21,800 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-14 15:10:21,800 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-14 15:10:21,800 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-04-14 15:10:21,800 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-04-14 15:10:21,800 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2022-04-14 15:10:21,800 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2022-04-14 15:10:21,800 WARN L170 areAnnotationChecker]: L51 has no Hoare annotation [2022-04-14 15:10:21,800 WARN L170 areAnnotationChecker]: L51 has no Hoare annotation [2022-04-14 15:10:21,800 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2022-04-14 15:10:21,800 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2022-04-14 15:10:21,800 WARN L170 areAnnotationChecker]: L53 has no Hoare annotation [2022-04-14 15:10:21,800 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-14 15:10:21,801 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-14 15:10:21,801 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-14 15:10:21,801 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 03:10:21 BoogieIcfgContainer [2022-04-14 15:10:21,801 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-14 15:10:21,802 INFO L158 Benchmark]: Toolchain (without parser) took 16847.71ms. Allocated memory was 230.7MB in the beginning and 343.9MB in the end (delta: 113.2MB). Free memory was 205.2MB in the beginning and 190.4MB in the end (delta: 14.8MB). Peak memory consumption was 127.9MB. Max. memory is 8.0GB. [2022-04-14 15:10:21,802 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 230.7MB. Free memory is still 192.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-14 15:10:21,802 INFO L158 Benchmark]: CACSL2BoogieTranslator took 289.33ms. Allocated memory is still 230.7MB. Free memory was 204.8MB in the beginning and 201.5MB in the end (delta: 3.3MB). Peak memory consumption was 7.3MB. Max. memory is 8.0GB. [2022-04-14 15:10:21,802 INFO L158 Benchmark]: Boogie Preprocessor took 23.07ms. Allocated memory is still 230.7MB. Free memory was 201.5MB in the beginning and 199.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-14 15:10:21,802 INFO L158 Benchmark]: RCFGBuilder took 222.87ms. Allocated memory is still 230.7MB. Free memory was 199.9MB in the beginning and 188.0MB in the end (delta: 11.8MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-14 15:10:21,802 INFO L158 Benchmark]: TraceAbstraction took 16308.86ms. Allocated memory was 230.7MB in the beginning and 343.9MB in the end (delta: 113.2MB). Free memory was 187.5MB in the beginning and 190.4MB in the end (delta: -2.8MB). Peak memory consumption was 110.7MB. Max. memory is 8.0GB. [2022-04-14 15:10:21,803 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 230.7MB. Free memory is still 192.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 289.33ms. Allocated memory is still 230.7MB. Free memory was 204.8MB in the beginning and 201.5MB in the end (delta: 3.3MB). Peak memory consumption was 7.3MB. Max. memory is 8.0GB. * Boogie Preprocessor took 23.07ms. Allocated memory is still 230.7MB. Free memory was 201.5MB in the beginning and 199.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 222.87ms. Allocated memory is still 230.7MB. Free memory was 199.9MB in the beginning and 188.0MB in the end (delta: 11.8MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 16308.86ms. Allocated memory was 230.7MB in the beginning and 343.9MB in the end (delta: 113.2MB). Free memory was 187.5MB in the beginning and 190.4MB in the end (delta: -2.8MB). Peak memory consumption was 110.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 17]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L22] int counter = 0; VAL [\old(counter)=5, counter=0] [L24] short a; [L25] long long n, x, y, z; [L26] a = __VERIFIER_nondet_ushort() [L28] n = 0 [L29] x = 0 [L30] y = 1 [L31] z = 6 VAL [\old(counter)=0, a=2, counter=0, n=0, x=0, y=1, z=6] [L33] EXPR counter++ VAL [\old(counter)=0, a=2, counter=1, counter++=0, n=0, x=0, y=1, z=6] [L33] COND TRUE counter++<2 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=2, counter=1, n=0, x=0, y=1, z=6] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=2, counter=1, n=0, x=0, y=1, z=6] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=2, counter=1, n=0, x=0, y=1, z=6] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=2, counter=1, n=0, x=0, y=1, z=6] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=2, counter=1, n=0, x=0, y=1, z=6] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=2, counter=1, n=1, x=1, y=7, z=12] [L33] EXPR counter++ VAL [\old(counter)=0, a=2, counter=2, counter++=1, n=1, x=1, y=7, z=12] [L33] COND TRUE counter++<2 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=2, counter=2, n=1, x=1, y=7, z=12] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=2, counter=2, n=1, x=1, y=7, z=12] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=2, counter=2, n=1, x=1, y=7, z=12] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=2, counter=2, n=1, x=1, y=7, z=12] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=2, counter=2, n=1, x=1, y=7, z=12] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=2, counter=2, n=2, x=8, y=19, z=18] [L33] EXPR counter++ VAL [\old(counter)=0, a=2, counter=3, counter++=2, n=2, x=8, y=19, z=18] [L33] COND FALSE !(counter++<2) [L48] CALL __VERIFIER_assert(z == 6*n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=3] [L48] RET __VERIFIER_assert(z == 6*n + 6) VAL [\old(counter)=0, a=2, counter=3, n=2, x=8, y=19, z=18] [L49] CALL __VERIFIER_assert(6*a*x - x*z + 12*x == 0) VAL [\old(cond)=0, \old(counter)=0, counter=3] [L15] COND TRUE !(cond) VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=3] [L17] reach_error() VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=3] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 38 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 16.2s, OverallIterations: 12, TraceHistogramMax: 12, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 6.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 142 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 89 mSDsluCounter, 1432 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 943 mSDsCounter, 165 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1141 IncrementalHoareTripleChecker+Invalid, 1306 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 165 mSolverCounterUnsat, 489 mSDtfsCounter, 1141 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 626 GetRequests, 556 SyntacticMatches, 5 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=97occurred in iteration=11, InterpolantAutomatonStates: 68, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 11 MinimizatonAttempts, 52 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 6.7s InterpolantComputationTime, 440 NumberOfCodeBlocks, 410 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 617 ConstructedInterpolants, 0 QuantifiedInterpolants, 2945 SizeOfPredicates, 12 NumberOfNonLiveVariables, 981 ConjunctsInSsa, 95 ConjunctsInUnsatCore, 16 InterpolantComputations, 6 PerfectInterpolantSequences, 1252/1302 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-04-14 15:10:21,838 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...