/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/ps2-ll_unwindbound2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 14:29:40,941 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 14:29:40,954 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 14:29:41,021 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 14:29:41,021 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 14:29:41,022 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 14:29:41,025 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 14:29:41,029 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 14:29:41,030 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 14:29:41,031 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 14:29:41,032 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 14:29:41,033 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 14:29:41,033 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 14:29:41,037 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 14:29:41,037 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 14:29:41,038 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 14:29:41,039 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 14:29:41,039 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 14:29:41,041 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 14:29:41,046 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 14:29:41,046 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 14:29:41,048 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 14:29:41,049 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 14:29:41,050 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 14:29:41,051 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 14:29:41,057 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 14:29:41,057 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 14:29:41,057 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 14:29:41,058 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 14:29:41,058 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 14:29:41,059 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 14:29:41,059 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 14:29:41,060 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 14:29:41,060 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 14:29:41,061 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 14:29:41,061 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 14:29:41,062 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 14:29:41,062 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 14:29:41,062 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 14:29:41,062 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 14:29:41,063 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 14:29:41,067 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 14:29:41,067 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-27 14:29:41,096 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 14:29:41,097 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 14:29:41,097 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 14:29:41,097 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 14:29:41,098 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 14:29:41,098 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 14:29:41,098 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 14:29:41,098 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 14:29:41,099 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 14:29:41,099 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 14:29:41,099 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 14:29:41,100 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 14:29:41,100 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 14:29:41,100 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 14:29:41,100 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 14:29:41,100 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 14:29:41,100 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 14:29:41,101 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 14:29:41,101 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 14:29:41,101 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 14:29:41,101 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 14:29:41,102 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 14:29:41,102 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 14:29:41,102 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 14:29:41,102 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 14:29:41,102 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 14:29:41,102 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 14:29:41,102 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 14:29:41,102 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 14:29:41,103 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 14:29:41,103 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 14:29:41,103 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 14:29:41,103 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 14:29:41,103 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 14:29:41,300 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 14:29:41,317 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 14:29:41,320 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 14:29:41,321 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 14:29:41,322 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 14:29:41,323 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/ps2-ll_unwindbound2.c [2022-04-27 14:29:41,381 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81fa68d90/222ef29b6fc743a09a215c15582d5949/FLAG4f53352e5 [2022-04-27 14:29:41,723 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 14:29:41,723 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps2-ll_unwindbound2.c [2022-04-27 14:29:41,727 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81fa68d90/222ef29b6fc743a09a215c15582d5949/FLAG4f53352e5 [2022-04-27 14:29:41,735 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81fa68d90/222ef29b6fc743a09a215c15582d5949 [2022-04-27 14:29:41,737 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 14:29:41,738 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 14:29:41,747 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 14:29:41,747 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 14:29:41,750 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 14:29:41,751 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 02:29:41" (1/1) ... [2022-04-27 14:29:41,751 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@414f718f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:29:41, skipping insertion in model container [2022-04-27 14:29:41,752 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 02:29:41" (1/1) ... [2022-04-27 14:29:41,757 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 14:29:41,770 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 14:29:41,898 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/ps2-ll_unwindbound2.c[454,467] [2022-04-27 14:29:41,914 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 14:29:41,921 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 14:29:41,931 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/ps2-ll_unwindbound2.c[454,467] [2022-04-27 14:29:41,935 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 14:29:41,944 INFO L208 MainTranslator]: Completed translation [2022-04-27 14:29:41,945 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:29:41 WrapperNode [2022-04-27 14:29:41,945 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 14:29:41,946 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 14:29:41,946 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 14:29:41,946 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 14:29:41,953 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:29:41" (1/1) ... [2022-04-27 14:29:41,953 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:29:41" (1/1) ... [2022-04-27 14:29:41,957 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:29:41" (1/1) ... [2022-04-27 14:29:41,957 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:29:41" (1/1) ... [2022-04-27 14:29:41,962 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:29:41" (1/1) ... [2022-04-27 14:29:41,965 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:29:41" (1/1) ... [2022-04-27 14:29:41,966 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:29:41" (1/1) ... [2022-04-27 14:29:41,967 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 14:29:41,968 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 14:29:41,968 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 14:29:41,968 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 14:29:41,969 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:29:41" (1/1) ... [2022-04-27 14:29:41,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 14:29:41,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:29:41,996 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-27 14:29:42,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-27 14:29:42,027 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 14:29:42,027 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 14:29:42,027 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 14:29:42,027 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 14:29:42,027 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 14:29:42,027 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 14:29:42,027 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 14:29:42,027 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 14:29:42,028 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 14:29:42,028 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 14:29:42,028 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 14:29:42,028 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 14:29:42,028 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 14:29:42,028 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 14:29:42,028 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 14:29:42,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 14:29:42,028 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 14:29:42,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 14:29:42,029 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 14:29:42,029 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 14:29:42,072 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 14:29:42,073 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 14:29:42,188 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 14:29:42,193 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 14:29:42,193 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 14:29:42,195 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 02:29:42 BoogieIcfgContainer [2022-04-27 14:29:42,195 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 14:29:42,196 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 14:29:42,196 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 14:29:42,199 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 14:29:42,199 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 02:29:41" (1/3) ... [2022-04-27 14:29:42,200 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13b2ed88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 02:29:42, skipping insertion in model container [2022-04-27 14:29:42,200 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:29:41" (2/3) ... [2022-04-27 14:29:42,200 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13b2ed88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 02:29:42, skipping insertion in model container [2022-04-27 14:29:42,200 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 02:29:42" (3/3) ... [2022-04-27 14:29:42,201 INFO L111 eAbstractionObserver]: Analyzing ICFG ps2-ll_unwindbound2.c [2022-04-27 14:29:42,211 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 14:29:42,212 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 14:29:42,245 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 14:29:42,251 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5c0d204c, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@482b4f25 [2022-04-27 14:29:42,251 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 14:29:42,258 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 14:29:42,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-27 14:29:42,264 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:29:42,265 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:29:42,265 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:29:42,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:29:42,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1665267581, now seen corresponding path program 1 times [2022-04-27 14:29:42,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:29:42,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471343221] [2022-04-27 14:29:42,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:29:42,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:29:42,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:29:42,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 14:29:42,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:29:42,458 INFO L290 TraceCheckUtils]: 0: Hoare triple {30#(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(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {25#true} is VALID [2022-04-27 14:29:42,459 INFO L290 TraceCheckUtils]: 1: Hoare triple {25#true} assume true; {25#true} is VALID [2022-04-27 14:29:42,459 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25#true} {25#true} #54#return; {25#true} is VALID [2022-04-27 14:29:42,462 INFO L272 TraceCheckUtils]: 0: Hoare triple {25#true} call ULTIMATE.init(); {30#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 14:29:42,463 INFO L290 TraceCheckUtils]: 1: Hoare triple {30#(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(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {25#true} is VALID [2022-04-27 14:29:42,463 INFO L290 TraceCheckUtils]: 2: Hoare triple {25#true} assume true; {25#true} is VALID [2022-04-27 14:29:42,464 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25#true} {25#true} #54#return; {25#true} is VALID [2022-04-27 14:29:42,464 INFO L272 TraceCheckUtils]: 4: Hoare triple {25#true} call #t~ret6 := main(); {25#true} is VALID [2022-04-27 14:29:42,464 INFO L290 TraceCheckUtils]: 5: Hoare triple {25#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {25#true} is VALID [2022-04-27 14:29:42,465 INFO L290 TraceCheckUtils]: 6: Hoare triple {25#true} assume !true; {26#false} is VALID [2022-04-27 14:29:42,466 INFO L272 TraceCheckUtils]: 7: Hoare triple {26#false} call __VERIFIER_assert((if 0 == ~y~0 * ~y~0 - 2 * ~x~0 + ~y~0 then 1 else 0)); {26#false} is VALID [2022-04-27 14:29:42,466 INFO L290 TraceCheckUtils]: 8: Hoare triple {26#false} ~cond := #in~cond; {26#false} is VALID [2022-04-27 14:29:42,467 INFO L290 TraceCheckUtils]: 9: Hoare triple {26#false} assume 0 == ~cond; {26#false} is VALID [2022-04-27 14:29:42,467 INFO L290 TraceCheckUtils]: 10: Hoare triple {26#false} assume !false; {26#false} is VALID [2022-04-27 14:29:42,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 14:29:42,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:29:42,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471343221] [2022-04-27 14:29:42,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471343221] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 14:29:42,471 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 14:29:42,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 14:29:42,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677820169] [2022-04-27 14:29:42,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:29:42,476 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-27 14:29:42,478 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:29:42,482 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 14:29:42,507 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:29:42,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 14:29:42,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:29:42,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 14:29:42,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 14:29:42,538 INFO L87 Difference]: Start difference. First operand has 22 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 14:29:42,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:29:42,674 INFO L93 Difference]: Finished difference Result 39 states and 50 transitions. [2022-04-27 14:29:42,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 14:29:42,675 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-27 14:29:42,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:29:42,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 14:29:42,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2022-04-27 14:29:42,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 14:29:42,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2022-04-27 14:29:42,690 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 50 transitions. [2022-04-27 14:29:42,759 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:29:42,769 INFO L225 Difference]: With dead ends: 39 [2022-04-27 14:29:42,769 INFO L226 Difference]: Without dead ends: 18 [2022-04-27 14:29:42,772 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 14:29:42,776 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 6 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 14:29:42,777 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 27 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 14:29:42,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-04-27 14:29:42,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2022-04-27 14:29:42,806 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:29:42,807 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 14:29:42,807 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 14:29:42,808 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 14:29:42,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:29:42,812 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2022-04-27 14:29:42,812 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-27 14:29:42,812 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:29:42,812 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:29:42,813 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 18 states. [2022-04-27 14:29:42,813 INFO L87 Difference]: Start difference. First operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 18 states. [2022-04-27 14:29:42,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:29:42,820 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2022-04-27 14:29:42,820 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-27 14:29:42,820 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:29:42,820 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:29:42,821 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:29:42,821 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:29:42,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 14:29:42,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-04-27 14:29:42,825 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 11 [2022-04-27 14:29:42,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:29:42,826 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-04-27 14:29:42,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 14:29:42,827 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-27 14:29:42,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 14:29:42,831 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:29:42,831 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:29:42,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 14:29:42,836 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:29:42,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:29:42,840 INFO L85 PathProgramCache]: Analyzing trace with hash -318583316, now seen corresponding path program 1 times [2022-04-27 14:29:42,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:29:42,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056841922] [2022-04-27 14:29:42,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:29:42,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:29:42,868 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:29:42,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1404702102] [2022-04-27 14:29:42,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:29:42,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:29:42,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:29:42,876 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 14:29:42,882 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-27 14:29:42,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:29:42,922 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-27 14:29:42,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:29:42,934 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:29:43,039 INFO L272 TraceCheckUtils]: 0: Hoare triple {146#true} call ULTIMATE.init(); {146#true} is VALID [2022-04-27 14:29:43,040 INFO L290 TraceCheckUtils]: 1: Hoare triple {146#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(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {154#(<= ~counter~0 0)} is VALID [2022-04-27 14:29:43,041 INFO L290 TraceCheckUtils]: 2: Hoare triple {154#(<= ~counter~0 0)} assume true; {154#(<= ~counter~0 0)} is VALID [2022-04-27 14:29:43,041 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {154#(<= ~counter~0 0)} {146#true} #54#return; {154#(<= ~counter~0 0)} is VALID [2022-04-27 14:29:43,042 INFO L272 TraceCheckUtils]: 4: Hoare triple {154#(<= ~counter~0 0)} call #t~ret6 := main(); {154#(<= ~counter~0 0)} is VALID [2022-04-27 14:29:43,042 INFO L290 TraceCheckUtils]: 5: Hoare triple {154#(<= ~counter~0 0)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {154#(<= ~counter~0 0)} is VALID [2022-04-27 14:29:43,043 INFO L290 TraceCheckUtils]: 6: Hoare triple {154#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {170#(<= |main_#t~post5| 0)} is VALID [2022-04-27 14:29:43,043 INFO L290 TraceCheckUtils]: 7: Hoare triple {170#(<= |main_#t~post5| 0)} assume !(#t~post5 < 2);havoc #t~post5; {147#false} is VALID [2022-04-27 14:29:43,044 INFO L272 TraceCheckUtils]: 8: Hoare triple {147#false} call __VERIFIER_assert((if 0 == ~y~0 * ~y~0 - 2 * ~x~0 + ~y~0 then 1 else 0)); {147#false} is VALID [2022-04-27 14:29:43,044 INFO L290 TraceCheckUtils]: 9: Hoare triple {147#false} ~cond := #in~cond; {147#false} is VALID [2022-04-27 14:29:43,044 INFO L290 TraceCheckUtils]: 10: Hoare triple {147#false} assume 0 == ~cond; {147#false} is VALID [2022-04-27 14:29:43,044 INFO L290 TraceCheckUtils]: 11: Hoare triple {147#false} assume !false; {147#false} is VALID [2022-04-27 14:29:43,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 14:29:43,045 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 14:29:43,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:29:43,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056841922] [2022-04-27 14:29:43,045 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:29:43,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1404702102] [2022-04-27 14:29:43,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1404702102] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 14:29:43,046 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 14:29:43,046 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 14:29:43,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133331193] [2022-04-27 14:29:43,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:29:43,048 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 14:29:43,048 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:29:43,048 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 14:29:43,060 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:29:43,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 14:29:43,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:29:43,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 14:29:43,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 14:29:43,062 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 14:29:43,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:29:43,101 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2022-04-27 14:29:43,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 14:29:43,101 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 14:29:43,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:29:43,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 14:29:43,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2022-04-27 14:29:43,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 14:29:43,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2022-04-27 14:29:43,105 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 28 transitions. [2022-04-27 14:29:43,139 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:29:43,140 INFO L225 Difference]: With dead ends: 26 [2022-04-27 14:29:43,141 INFO L226 Difference]: Without dead ends: 19 [2022-04-27 14:29:43,141 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 14:29:43,142 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 0 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 14:29:43,143 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 14:29:43,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-27 14:29:43,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-04-27 14:29:43,148 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:29:43,148 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 19 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 14:29:43,148 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 19 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 14:29:43,149 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 19 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 14:29:43,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:29:43,150 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-04-27 14:29:43,150 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-27 14:29:43,151 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:29:43,151 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:29:43,151 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 19 states. [2022-04-27 14:29:43,151 INFO L87 Difference]: Start difference. First operand has 19 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 19 states. [2022-04-27 14:29:43,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:29:43,153 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-04-27 14:29:43,153 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-27 14:29:43,153 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:29:43,153 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:29:43,154 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:29:43,154 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:29:43,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 14:29:43,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2022-04-27 14:29:43,155 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 12 [2022-04-27 14:29:43,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:29:43,155 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2022-04-27 14:29:43,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 14:29:43,156 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-27 14:29:43,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 14:29:43,156 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:29:43,156 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:29:43,179 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-27 14:29:43,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:29:43,376 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:29:43,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:29:43,376 INFO L85 PathProgramCache]: Analyzing trace with hash -316795856, now seen corresponding path program 1 times [2022-04-27 14:29:43,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:29:43,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982613667] [2022-04-27 14:29:43,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:29:43,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:29:43,396 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:29:43,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1109630430] [2022-04-27 14:29:43,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:29:43,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:29:43,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:29:43,398 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 14:29:43,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-27 14:29:43,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:29:43,447 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 14:29:43,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:29:43,454 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:29:43,559 INFO L272 TraceCheckUtils]: 0: Hoare triple {288#true} call ULTIMATE.init(); {288#true} is VALID [2022-04-27 14:29:43,559 INFO L290 TraceCheckUtils]: 1: Hoare triple {288#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(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {288#true} is VALID [2022-04-27 14:29:43,559 INFO L290 TraceCheckUtils]: 2: Hoare triple {288#true} assume true; {288#true} is VALID [2022-04-27 14:29:43,560 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {288#true} {288#true} #54#return; {288#true} is VALID [2022-04-27 14:29:43,560 INFO L272 TraceCheckUtils]: 4: Hoare triple {288#true} call #t~ret6 := main(); {288#true} is VALID [2022-04-27 14:29:43,561 INFO L290 TraceCheckUtils]: 5: Hoare triple {288#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {308#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:29:43,561 INFO L290 TraceCheckUtils]: 6: Hoare triple {308#(and (= main_~x~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {308#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:29:43,563 INFO L290 TraceCheckUtils]: 7: Hoare triple {308#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 2);havoc #t~post5; {308#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:29:43,566 INFO L272 TraceCheckUtils]: 8: Hoare triple {308#(and (= main_~x~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == ~y~0 * ~y~0 - 2 * ~x~0 + ~y~0 then 1 else 0)); {318#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:29:43,567 INFO L290 TraceCheckUtils]: 9: Hoare triple {318#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {322#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:29:43,568 INFO L290 TraceCheckUtils]: 10: Hoare triple {322#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {289#false} is VALID [2022-04-27 14:29:43,569 INFO L290 TraceCheckUtils]: 11: Hoare triple {289#false} assume !false; {289#false} is VALID [2022-04-27 14:29:43,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 14:29:43,569 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 14:29:43,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:29:43,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982613667] [2022-04-27 14:29:43,570 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:29:43,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1109630430] [2022-04-27 14:29:43,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1109630430] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 14:29:43,571 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 14:29:43,571 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 14:29:43,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838336052] [2022-04-27 14:29:43,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:29:43,572 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 14:29:43,572 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:29:43,572 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 14:29:43,582 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:29:43,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 14:29:43,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:29:43,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 14:29:43,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 14:29:43,584 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 14:29:43,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:29:43,674 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2022-04-27 14:29:43,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 14:29:43,675 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 14:29:43,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:29:43,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 14:29:43,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2022-04-27 14:29:43,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 14:29:43,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2022-04-27 14:29:43,683 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 31 transitions. [2022-04-27 14:29:43,708 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:29:43,710 INFO L225 Difference]: With dead ends: 28 [2022-04-27 14:29:43,710 INFO L226 Difference]: Without dead ends: 25 [2022-04-27 14:29:43,711 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 14:29:43,714 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 6 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 14:29:43,715 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 57 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 14:29:43,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-27 14:29:43,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-04-27 14:29:43,724 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:29:43,724 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 25 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 14:29:43,726 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 25 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 14:29:43,727 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 25 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 14:29:43,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:29:43,729 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2022-04-27 14:29:43,729 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-27 14:29:43,729 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:29:43,730 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:29:43,730 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 25 states. [2022-04-27 14:29:43,730 INFO L87 Difference]: Start difference. First operand has 25 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 25 states. [2022-04-27 14:29:43,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:29:43,735 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2022-04-27 14:29:43,735 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-27 14:29:43,736 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:29:43,736 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:29:43,736 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:29:43,736 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:29:43,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 14:29:43,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2022-04-27 14:29:43,739 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 12 [2022-04-27 14:29:43,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:29:43,740 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2022-04-27 14:29:43,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 14:29:43,740 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-27 14:29:43,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-27 14:29:43,742 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:29:43,742 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:29:43,772 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-27 14:29:43,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-27 14:29:43,964 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:29:43,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:29:43,964 INFO L85 PathProgramCache]: Analyzing trace with hash -2089867248, now seen corresponding path program 1 times [2022-04-27 14:29:43,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:29:43,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774041745] [2022-04-27 14:29:43,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:29:43,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:29:43,980 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:29:43,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [541273917] [2022-04-27 14:29:43,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:29:43,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:29:43,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:29:43,982 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 14:29:44,011 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-27 14:29:44,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:29:44,024 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 14:29:44,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:29:44,038 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:29:44,206 INFO L272 TraceCheckUtils]: 0: Hoare triple {456#true} call ULTIMATE.init(); {456#true} is VALID [2022-04-27 14:29:44,207 INFO L290 TraceCheckUtils]: 1: Hoare triple {456#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(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {464#(<= ~counter~0 0)} is VALID [2022-04-27 14:29:44,208 INFO L290 TraceCheckUtils]: 2: Hoare triple {464#(<= ~counter~0 0)} assume true; {464#(<= ~counter~0 0)} is VALID [2022-04-27 14:29:44,208 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {464#(<= ~counter~0 0)} {456#true} #54#return; {464#(<= ~counter~0 0)} is VALID [2022-04-27 14:29:44,209 INFO L272 TraceCheckUtils]: 4: Hoare triple {464#(<= ~counter~0 0)} call #t~ret6 := main(); {464#(<= ~counter~0 0)} is VALID [2022-04-27 14:29:44,210 INFO L290 TraceCheckUtils]: 5: Hoare triple {464#(<= ~counter~0 0)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {464#(<= ~counter~0 0)} is VALID [2022-04-27 14:29:44,210 INFO L290 TraceCheckUtils]: 6: Hoare triple {464#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {480#(<= ~counter~0 1)} is VALID [2022-04-27 14:29:44,211 INFO L290 TraceCheckUtils]: 7: Hoare triple {480#(<= ~counter~0 1)} assume !!(#t~post5 < 2);havoc #t~post5; {480#(<= ~counter~0 1)} is VALID [2022-04-27 14:29:44,211 INFO L272 TraceCheckUtils]: 8: Hoare triple {480#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~y~0 * ~y~0 - 2 * ~x~0 + ~y~0 then 1 else 0)); {480#(<= ~counter~0 1)} is VALID [2022-04-27 14:29:44,212 INFO L290 TraceCheckUtils]: 9: Hoare triple {480#(<= ~counter~0 1)} ~cond := #in~cond; {480#(<= ~counter~0 1)} is VALID [2022-04-27 14:29:44,212 INFO L290 TraceCheckUtils]: 10: Hoare triple {480#(<= ~counter~0 1)} assume !(0 == ~cond); {480#(<= ~counter~0 1)} is VALID [2022-04-27 14:29:44,216 INFO L290 TraceCheckUtils]: 11: Hoare triple {480#(<= ~counter~0 1)} assume true; {480#(<= ~counter~0 1)} is VALID [2022-04-27 14:29:44,216 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {480#(<= ~counter~0 1)} {480#(<= ~counter~0 1)} #50#return; {480#(<= ~counter~0 1)} is VALID [2022-04-27 14:29:44,217 INFO L290 TraceCheckUtils]: 13: Hoare triple {480#(<= ~counter~0 1)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 + ~x~0; {480#(<= ~counter~0 1)} is VALID [2022-04-27 14:29:44,217 INFO L290 TraceCheckUtils]: 14: Hoare triple {480#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {505#(<= |main_#t~post5| 1)} is VALID [2022-04-27 14:29:44,218 INFO L290 TraceCheckUtils]: 15: Hoare triple {505#(<= |main_#t~post5| 1)} assume !(#t~post5 < 2);havoc #t~post5; {457#false} is VALID [2022-04-27 14:29:44,219 INFO L272 TraceCheckUtils]: 16: Hoare triple {457#false} call __VERIFIER_assert((if 0 == ~y~0 * ~y~0 - 2 * ~x~0 + ~y~0 then 1 else 0)); {457#false} is VALID [2022-04-27 14:29:44,220 INFO L290 TraceCheckUtils]: 17: Hoare triple {457#false} ~cond := #in~cond; {457#false} is VALID [2022-04-27 14:29:44,220 INFO L290 TraceCheckUtils]: 18: Hoare triple {457#false} assume 0 == ~cond; {457#false} is VALID [2022-04-27 14:29:44,220 INFO L290 TraceCheckUtils]: 19: Hoare triple {457#false} assume !false; {457#false} is VALID [2022-04-27 14:29:44,221 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 14:29:44,221 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:29:44,376 INFO L290 TraceCheckUtils]: 19: Hoare triple {457#false} assume !false; {457#false} is VALID [2022-04-27 14:29:44,377 INFO L290 TraceCheckUtils]: 18: Hoare triple {457#false} assume 0 == ~cond; {457#false} is VALID [2022-04-27 14:29:44,377 INFO L290 TraceCheckUtils]: 17: Hoare triple {457#false} ~cond := #in~cond; {457#false} is VALID [2022-04-27 14:29:44,377 INFO L272 TraceCheckUtils]: 16: Hoare triple {457#false} call __VERIFIER_assert((if 0 == ~y~0 * ~y~0 - 2 * ~x~0 + ~y~0 then 1 else 0)); {457#false} is VALID [2022-04-27 14:29:44,377 INFO L290 TraceCheckUtils]: 15: Hoare triple {505#(<= |main_#t~post5| 1)} assume !(#t~post5 < 2);havoc #t~post5; {457#false} is VALID [2022-04-27 14:29:44,378 INFO L290 TraceCheckUtils]: 14: Hoare triple {480#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {505#(<= |main_#t~post5| 1)} is VALID [2022-04-27 14:29:44,378 INFO L290 TraceCheckUtils]: 13: Hoare triple {480#(<= ~counter~0 1)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 + ~x~0; {480#(<= ~counter~0 1)} is VALID [2022-04-27 14:29:44,379 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {456#true} {480#(<= ~counter~0 1)} #50#return; {480#(<= ~counter~0 1)} is VALID [2022-04-27 14:29:44,379 INFO L290 TraceCheckUtils]: 11: Hoare triple {456#true} assume true; {456#true} is VALID [2022-04-27 14:29:44,379 INFO L290 TraceCheckUtils]: 10: Hoare triple {456#true} assume !(0 == ~cond); {456#true} is VALID [2022-04-27 14:29:44,379 INFO L290 TraceCheckUtils]: 9: Hoare triple {456#true} ~cond := #in~cond; {456#true} is VALID [2022-04-27 14:29:44,380 INFO L272 TraceCheckUtils]: 8: Hoare triple {480#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~y~0 * ~y~0 - 2 * ~x~0 + ~y~0 then 1 else 0)); {456#true} is VALID [2022-04-27 14:29:44,380 INFO L290 TraceCheckUtils]: 7: Hoare triple {480#(<= ~counter~0 1)} assume !!(#t~post5 < 2);havoc #t~post5; {480#(<= ~counter~0 1)} is VALID [2022-04-27 14:29:44,381 INFO L290 TraceCheckUtils]: 6: Hoare triple {464#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {480#(<= ~counter~0 1)} is VALID [2022-04-27 14:29:44,381 INFO L290 TraceCheckUtils]: 5: Hoare triple {464#(<= ~counter~0 0)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {464#(<= ~counter~0 0)} is VALID [2022-04-27 14:29:44,382 INFO L272 TraceCheckUtils]: 4: Hoare triple {464#(<= ~counter~0 0)} call #t~ret6 := main(); {464#(<= ~counter~0 0)} is VALID [2022-04-27 14:29:44,382 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {464#(<= ~counter~0 0)} {456#true} #54#return; {464#(<= ~counter~0 0)} is VALID [2022-04-27 14:29:44,383 INFO L290 TraceCheckUtils]: 2: Hoare triple {464#(<= ~counter~0 0)} assume true; {464#(<= ~counter~0 0)} is VALID [2022-04-27 14:29:44,383 INFO L290 TraceCheckUtils]: 1: Hoare triple {456#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(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {464#(<= ~counter~0 0)} is VALID [2022-04-27 14:29:44,383 INFO L272 TraceCheckUtils]: 0: Hoare triple {456#true} call ULTIMATE.init(); {456#true} is VALID [2022-04-27 14:29:44,384 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 14:29:44,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:29:44,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774041745] [2022-04-27 14:29:44,384 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:29:44,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [541273917] [2022-04-27 14:29:44,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [541273917] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 14:29:44,384 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 14:29:44,385 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2022-04-27 14:29:44,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265741580] [2022-04-27 14:29:44,385 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 14:29:44,385 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 4 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 20 [2022-04-27 14:29:44,386 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:29:44,386 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 4 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 14:29:44,404 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:29:44,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 14:29:44,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:29:44,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 14:29:44,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-27 14:29:44,406 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 4 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 14:29:44,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:29:44,468 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2022-04-27 14:29:44,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 14:29:44,468 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 4 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 20 [2022-04-27 14:29:44,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:29:44,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 4 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 14:29:44,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 36 transitions. [2022-04-27 14:29:44,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 4 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 14:29:44,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 36 transitions. [2022-04-27 14:29:44,472 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 36 transitions. [2022-04-27 14:29:44,504 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:29:44,508 INFO L225 Difference]: With dead ends: 34 [2022-04-27 14:29:44,508 INFO L226 Difference]: Without dead ends: 27 [2022-04-27 14:29:44,509 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-27 14:29:44,511 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 2 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 14:29:44,515 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 51 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 14:29:44,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-27 14:29:44,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-04-27 14:29:44,526 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:29:44,528 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 27 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 14:29:44,528 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 27 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 14:29:44,529 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 27 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 14:29:44,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:29:44,533 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2022-04-27 14:29:44,533 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-04-27 14:29:44,537 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:29:44,537 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:29:44,537 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 27 states. [2022-04-27 14:29:44,538 INFO L87 Difference]: Start difference. First operand has 27 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 27 states. [2022-04-27 14:29:44,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:29:44,539 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2022-04-27 14:29:44,539 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-04-27 14:29:44,539 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:29:44,539 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:29:44,539 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:29:44,540 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:29:44,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 14:29:44,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2022-04-27 14:29:44,541 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 20 [2022-04-27 14:29:44,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:29:44,541 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2022-04-27 14:29:44,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 4 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 14:29:44,542 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-04-27 14:29:44,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-27 14:29:44,542 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:29:44,542 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:29:44,571 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-27 14:29:44,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:29:44,764 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:29:44,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:29:44,764 INFO L85 PathProgramCache]: Analyzing trace with hash -2088079788, now seen corresponding path program 1 times [2022-04-27 14:29:44,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:29:44,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395376647] [2022-04-27 14:29:44,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:29:44,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:29:44,777 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:29:44,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1328452851] [2022-04-27 14:29:44,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:29:44,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:29:44,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:29:44,782 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 14:29:44,787 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-27 14:29:44,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:29:44,819 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-27 14:29:44,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:29:44,827 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:29:44,935 INFO L272 TraceCheckUtils]: 0: Hoare triple {723#true} call ULTIMATE.init(); {723#true} is VALID [2022-04-27 14:29:44,935 INFO L290 TraceCheckUtils]: 1: Hoare triple {723#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(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {723#true} is VALID [2022-04-27 14:29:44,936 INFO L290 TraceCheckUtils]: 2: Hoare triple {723#true} assume true; {723#true} is VALID [2022-04-27 14:29:44,936 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {723#true} {723#true} #54#return; {723#true} is VALID [2022-04-27 14:29:44,936 INFO L272 TraceCheckUtils]: 4: Hoare triple {723#true} call #t~ret6 := main(); {723#true} is VALID [2022-04-27 14:29:44,937 INFO L290 TraceCheckUtils]: 5: Hoare triple {723#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {743#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:29:44,937 INFO L290 TraceCheckUtils]: 6: Hoare triple {743#(and (= main_~x~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {743#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:29:44,938 INFO L290 TraceCheckUtils]: 7: Hoare triple {743#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 2);havoc #t~post5; {743#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:29:44,938 INFO L272 TraceCheckUtils]: 8: Hoare triple {743#(and (= main_~x~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == ~y~0 * ~y~0 - 2 * ~x~0 + ~y~0 then 1 else 0)); {723#true} is VALID [2022-04-27 14:29:44,938 INFO L290 TraceCheckUtils]: 9: Hoare triple {723#true} ~cond := #in~cond; {723#true} is VALID [2022-04-27 14:29:44,938 INFO L290 TraceCheckUtils]: 10: Hoare triple {723#true} assume !(0 == ~cond); {723#true} is VALID [2022-04-27 14:29:44,938 INFO L290 TraceCheckUtils]: 11: Hoare triple {723#true} assume true; {723#true} is VALID [2022-04-27 14:29:44,939 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {723#true} {743#(and (= main_~x~0 0) (= main_~y~0 0))} #50#return; {743#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 14:29:44,939 INFO L290 TraceCheckUtils]: 13: Hoare triple {743#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 + ~x~0; {768#(and (= main_~y~0 1) (= (+ main_~x~0 (* (- 1) main_~y~0)) 0))} is VALID [2022-04-27 14:29:44,940 INFO L290 TraceCheckUtils]: 14: Hoare triple {768#(and (= main_~y~0 1) (= (+ main_~x~0 (* (- 1) main_~y~0)) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {768#(and (= main_~y~0 1) (= (+ main_~x~0 (* (- 1) main_~y~0)) 0))} is VALID [2022-04-27 14:29:44,941 INFO L290 TraceCheckUtils]: 15: Hoare triple {768#(and (= main_~y~0 1) (= (+ main_~x~0 (* (- 1) main_~y~0)) 0))} assume !!(#t~post5 < 2);havoc #t~post5; {768#(and (= main_~y~0 1) (= (+ main_~x~0 (* (- 1) main_~y~0)) 0))} is VALID [2022-04-27 14:29:44,941 INFO L272 TraceCheckUtils]: 16: Hoare triple {768#(and (= main_~y~0 1) (= (+ main_~x~0 (* (- 1) main_~y~0)) 0))} call __VERIFIER_assert((if 0 == ~y~0 * ~y~0 - 2 * ~x~0 + ~y~0 then 1 else 0)); {778#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:29:44,942 INFO L290 TraceCheckUtils]: 17: Hoare triple {778#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {782#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:29:44,942 INFO L290 TraceCheckUtils]: 18: Hoare triple {782#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {724#false} is VALID [2022-04-27 14:29:44,942 INFO L290 TraceCheckUtils]: 19: Hoare triple {724#false} assume !false; {724#false} is VALID [2022-04-27 14:29:44,943 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 14:29:44,943 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:29:45,085 INFO L290 TraceCheckUtils]: 19: Hoare triple {724#false} assume !false; {724#false} is VALID [2022-04-27 14:29:45,086 INFO L290 TraceCheckUtils]: 18: Hoare triple {782#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {724#false} is VALID [2022-04-27 14:29:45,087 INFO L290 TraceCheckUtils]: 17: Hoare triple {778#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {782#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:29:45,087 INFO L272 TraceCheckUtils]: 16: Hoare triple {798#(= (* main_~x~0 2) (+ main_~y~0 (* main_~y~0 main_~y~0)))} call __VERIFIER_assert((if 0 == ~y~0 * ~y~0 - 2 * ~x~0 + ~y~0 then 1 else 0)); {778#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:29:45,088 INFO L290 TraceCheckUtils]: 15: Hoare triple {798#(= (* main_~x~0 2) (+ main_~y~0 (* main_~y~0 main_~y~0)))} assume !!(#t~post5 < 2);havoc #t~post5; {798#(= (* main_~x~0 2) (+ main_~y~0 (* main_~y~0 main_~y~0)))} is VALID [2022-04-27 14:29:45,089 INFO L290 TraceCheckUtils]: 14: Hoare triple {798#(= (* main_~x~0 2) (+ main_~y~0 (* main_~y~0 main_~y~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {798#(= (* main_~x~0 2) (+ main_~y~0 (* main_~y~0 main_~y~0)))} is VALID [2022-04-27 14:29:45,140 INFO L290 TraceCheckUtils]: 13: Hoare triple {798#(= (* main_~x~0 2) (+ main_~y~0 (* main_~y~0 main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 + ~x~0; {798#(= (* main_~x~0 2) (+ main_~y~0 (* main_~y~0 main_~y~0)))} is VALID [2022-04-27 14:29:45,141 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {723#true} {798#(= (* main_~x~0 2) (+ main_~y~0 (* main_~y~0 main_~y~0)))} #50#return; {798#(= (* main_~x~0 2) (+ main_~y~0 (* main_~y~0 main_~y~0)))} is VALID [2022-04-27 14:29:45,141 INFO L290 TraceCheckUtils]: 11: Hoare triple {723#true} assume true; {723#true} is VALID [2022-04-27 14:29:45,141 INFO L290 TraceCheckUtils]: 10: Hoare triple {723#true} assume !(0 == ~cond); {723#true} is VALID [2022-04-27 14:29:45,141 INFO L290 TraceCheckUtils]: 9: Hoare triple {723#true} ~cond := #in~cond; {723#true} is VALID [2022-04-27 14:29:45,141 INFO L272 TraceCheckUtils]: 8: Hoare triple {798#(= (* main_~x~0 2) (+ main_~y~0 (* main_~y~0 main_~y~0)))} call __VERIFIER_assert((if 0 == ~y~0 * ~y~0 - 2 * ~x~0 + ~y~0 then 1 else 0)); {723#true} is VALID [2022-04-27 14:29:45,142 INFO L290 TraceCheckUtils]: 7: Hoare triple {798#(= (* main_~x~0 2) (+ main_~y~0 (* main_~y~0 main_~y~0)))} assume !!(#t~post5 < 2);havoc #t~post5; {798#(= (* main_~x~0 2) (+ main_~y~0 (* main_~y~0 main_~y~0)))} is VALID [2022-04-27 14:29:45,142 INFO L290 TraceCheckUtils]: 6: Hoare triple {798#(= (* main_~x~0 2) (+ main_~y~0 (* main_~y~0 main_~y~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {798#(= (* main_~x~0 2) (+ main_~y~0 (* main_~y~0 main_~y~0)))} is VALID [2022-04-27 14:29:45,143 INFO L290 TraceCheckUtils]: 5: Hoare triple {723#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {798#(= (* main_~x~0 2) (+ main_~y~0 (* main_~y~0 main_~y~0)))} is VALID [2022-04-27 14:29:45,143 INFO L272 TraceCheckUtils]: 4: Hoare triple {723#true} call #t~ret6 := main(); {723#true} is VALID [2022-04-27 14:29:45,143 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {723#true} {723#true} #54#return; {723#true} is VALID [2022-04-27 14:29:45,144 INFO L290 TraceCheckUtils]: 2: Hoare triple {723#true} assume true; {723#true} is VALID [2022-04-27 14:29:45,144 INFO L290 TraceCheckUtils]: 1: Hoare triple {723#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(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {723#true} is VALID [2022-04-27 14:29:45,144 INFO L272 TraceCheckUtils]: 0: Hoare triple {723#true} call ULTIMATE.init(); {723#true} is VALID [2022-04-27 14:29:45,144 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-27 14:29:45,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:29:45,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395376647] [2022-04-27 14:29:45,145 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:29:45,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1328452851] [2022-04-27 14:29:45,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1328452851] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 14:29:45,145 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:29:45,145 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-27 14:29:45,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282366829] [2022-04-27 14:29:45,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:29:45,146 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (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 20 [2022-04-27 14:29:45,146 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:29:45,146 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 14:29:45,167 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:29:45,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 14:29:45,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:29:45,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 14:29:45,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-27 14:29:45,168 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 14:29:45,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:29:45,247 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2022-04-27 14:29:45,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 14:29:45,247 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (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 20 [2022-04-27 14:29:45,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:29:45,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 14:29:45,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2022-04-27 14:29:45,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 14:29:45,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2022-04-27 14:29:45,250 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 19 transitions. [2022-04-27 14:29:45,270 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:29:45,271 INFO L225 Difference]: With dead ends: 27 [2022-04-27 14:29:45,271 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 14:29:45,271 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-27 14:29:45,272 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 7 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 14:29:45,272 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 39 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 14:29:45,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 14:29:45,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 14:29:45,273 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:29:45,273 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 14:29:45,273 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 14:29:45,274 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 14:29:45,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:29:45,274 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 14:29:45,274 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 14:29:45,274 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:29:45,274 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:29:45,274 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 14:29:45,274 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 14:29:45,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:29:45,275 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 14:29:45,275 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 14:29:45,275 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:29:45,275 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:29:45,275 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:29:45,275 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:29:45,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 14:29:45,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 14:29:45,275 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 20 [2022-04-27 14:29:45,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:29:45,276 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 14:29:45,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 14:29:45,276 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 14:29:45,276 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:29:45,278 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 14:29:45,303 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-27 14:29:45,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:29:45,502 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-27 14:29:45,554 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-04-27 14:29:45,554 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-04-27 14:29:45,554 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-04-27 14:29:45,554 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 6 8) no Hoare annotation was computed. [2022-04-27 14:29:45,554 INFO L899 garLoopResultBuilder]: For program point L7(line 7) no Hoare annotation was computed. [2022-04-27 14:29:45,554 INFO L899 garLoopResultBuilder]: For program point L7-2(lines 6 8) no Hoare annotation was computed. [2022-04-27 14:29:45,554 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 6 8) no Hoare annotation was computed. [2022-04-27 14:29:45,555 INFO L895 garLoopResultBuilder]: At program point mainENTRY(lines 18 40) the Hoare annotation is: (or (= ~counter~0 |old(~counter~0)|) (not (<= |old(~counter~0)| 0))) [2022-04-27 14:29:45,555 INFO L895 garLoopResultBuilder]: At program point L28(line 28) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (= (* main_~x~0 2) (+ main_~y~0 (* main_~y~0 main_~y~0)))) [2022-04-27 14:29:45,555 INFO L899 garLoopResultBuilder]: For program point L28-1(lines 27 36) no Hoare annotation was computed. [2022-04-27 14:29:45,555 INFO L899 garLoopResultBuilder]: For program point L27-1(lines 27 36) no Hoare annotation was computed. [2022-04-27 14:29:45,555 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 18 40) no Hoare annotation was computed. [2022-04-27 14:29:45,555 INFO L895 garLoopResultBuilder]: At program point L27-3(lines 27 36) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (= (* main_~x~0 2) (+ main_~y~0 (* main_~y~0 main_~y~0)))) [2022-04-27 14:29:45,555 INFO L895 garLoopResultBuilder]: At program point L27-4(lines 27 36) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (= (* main_~x~0 2) (+ main_~y~0 (* main_~y~0 main_~y~0)))) [2022-04-27 14:29:45,555 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 18 40) no Hoare annotation was computed. [2022-04-27 14:29:45,555 INFO L899 garLoopResultBuilder]: For program point L37(line 37) no Hoare annotation was computed. [2022-04-27 14:29:45,555 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-27 14:29:45,556 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-27 14:29:45,556 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-27 14:29:45,556 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-27 14:29:45,556 INFO L895 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: (<= ~counter~0 0) [2022-04-27 14:29:45,556 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-27 14:29:45,556 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-27 14:29:45,556 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 9 15) the Hoare annotation is: true [2022-04-27 14:29:45,556 INFO L899 garLoopResultBuilder]: For program point L11(lines 11 12) no Hoare annotation was computed. [2022-04-27 14:29:45,556 INFO L899 garLoopResultBuilder]: For program point L10(lines 10 13) no Hoare annotation was computed. [2022-04-27 14:29:45,556 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 9 15) no Hoare annotation was computed. [2022-04-27 14:29:45,556 INFO L899 garLoopResultBuilder]: For program point L10-2(lines 9 15) no Hoare annotation was computed. [2022-04-27 14:29:45,557 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2022-04-27 14:29:45,559 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2022-04-27 14:29:45,561 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 14:29:45,563 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 14:29:45,563 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 14:29:45,565 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-27 14:29:45,569 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2022-04-27 14:29:45,570 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-27 14:29:45,570 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 14:29:45,570 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 14:29:45,570 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-27 14:29:45,570 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-27 14:29:45,572 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2022-04-27 14:29:45,572 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2022-04-27 14:29:45,572 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2022-04-27 14:29:45,572 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 14:29:45,572 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 14:29:45,572 WARN L170 areAnnotationChecker]: L7-2 has no Hoare annotation [2022-04-27 14:29:45,572 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-27 14:29:45,572 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2022-04-27 14:29:45,572 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2022-04-27 14:29:45,572 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-04-27 14:29:45,573 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-04-27 14:29:45,573 WARN L170 areAnnotationChecker]: L10-2 has no Hoare annotation [2022-04-27 14:29:45,573 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-27 14:29:45,573 WARN L170 areAnnotationChecker]: L28-1 has no Hoare annotation [2022-04-27 14:29:45,573 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 14:29:45,573 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 14:29:45,573 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 14:29:45,573 WARN L170 areAnnotationChecker]: L28-1 has no Hoare annotation [2022-04-27 14:29:45,573 WARN L170 areAnnotationChecker]: L28-1 has no Hoare annotation [2022-04-27 14:29:45,573 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 14:29:45,573 INFO L163 areAnnotationChecker]: CFG has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 14:29:45,585 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 02:29:45 BoogieIcfgContainer [2022-04-27 14:29:45,585 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 14:29:45,586 INFO L158 Benchmark]: Toolchain (without parser) took 3847.48ms. Allocated memory was 213.9MB in the beginning and 323.0MB in the end (delta: 109.1MB). Free memory was 156.6MB in the beginning and 175.1MB in the end (delta: -18.5MB). Peak memory consumption was 91.6MB. Max. memory is 8.0GB. [2022-04-27 14:29:45,586 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 213.9MB. Free memory is still 173.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 14:29:45,586 INFO L158 Benchmark]: CACSL2BoogieTranslator took 197.97ms. Allocated memory is still 213.9MB. Free memory was 156.4MB in the beginning and 180.9MB in the end (delta: -24.4MB). Peak memory consumption was 13.0MB. Max. memory is 8.0GB. [2022-04-27 14:29:45,587 INFO L158 Benchmark]: Boogie Preprocessor took 21.48ms. Allocated memory is still 213.9MB. Free memory was 180.9MB in the beginning and 179.4MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 14:29:45,587 INFO L158 Benchmark]: RCFGBuilder took 227.49ms. Allocated memory is still 213.9MB. Free memory was 179.4MB in the beginning and 168.9MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-27 14:29:45,587 INFO L158 Benchmark]: TraceAbstraction took 3388.58ms. Allocated memory was 213.9MB in the beginning and 323.0MB in the end (delta: 109.1MB). Free memory was 168.7MB in the beginning and 175.6MB in the end (delta: -6.9MB). Peak memory consumption was 103.7MB. Max. memory is 8.0GB. [2022-04-27 14:29:45,589 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.28ms. Allocated memory is still 213.9MB. Free memory is still 173.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 197.97ms. Allocated memory is still 213.9MB. Free memory was 156.4MB in the beginning and 180.9MB in the end (delta: -24.4MB). Peak memory consumption was 13.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 21.48ms. Allocated memory is still 213.9MB. Free memory was 180.9MB in the beginning and 179.4MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 227.49ms. Allocated memory is still 213.9MB. Free memory was 179.4MB in the beginning and 168.9MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 3388.58ms. Allocated memory was 213.9MB in the beginning and 323.0MB in the end (delta: 109.1MB). Free memory was 168.7MB in the beginning and 175.6MB in the end (delta: -6.9MB). Peak memory consumption was 103.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 - PositiveResult [Line: 12]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 29 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.3s, OverallIterations: 5, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 22 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 21 mSDsluCounter, 219 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 132 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 64 IncrementalHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 87 mSDtfsCounter, 64 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 107 GetRequests, 87 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=27occurred in iteration=4, InterpolantAutomatonStates: 23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 15 PreInvPairs, 22 NumberOfFragments, 65 HoareAnnotationTreeSize, 15 FomulaSimplifications, 53 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 26 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 75 NumberOfCodeBlocks, 75 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 108 ConstructedInterpolants, 0 QuantifiedInterpolants, 317 SizeOfPredicates, 5 NumberOfNonLiveVariables, 326 ConjunctsInSsa, 30 ConjunctsInUnsatCore, 7 InterpolantComputations, 4 PerfectInterpolantSequences, 11/18 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: !(\old(counter) <= 0) || x * 2 == y + y * y RESULT: Ultimate proved your program to be correct! [2022-04-27 14:29:45,625 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...