/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/prod4br-ll.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 11:54:30,043 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 11:54:30,044 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 11:54:30,064 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 11:54:30,065 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 11:54:30,065 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 11:54:30,066 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 11:54:30,067 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 11:54:30,069 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 11:54:30,069 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 11:54:30,070 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 11:54:30,070 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 11:54:30,071 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 11:54:30,075 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 11:54:30,076 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 11:54:30,077 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 11:54:30,077 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 11:54:30,078 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 11:54:30,079 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 11:54:30,080 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 11:54:30,081 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 11:54:30,089 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 11:54:30,091 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 11:54:30,092 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 11:54:30,095 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 11:54:30,099 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 11:54:30,099 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 11:54:30,099 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 11:54:30,100 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 11:54:30,100 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 11:54:30,101 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 11:54:30,101 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 11:54:30,101 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 11:54:30,102 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 11:54:30,102 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 11:54:30,103 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 11:54:30,103 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 11:54:30,103 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 11:54:30,103 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 11:54:30,103 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 11:54:30,104 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 11:54:30,110 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 11:54:30,111 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 11:54:30,132 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 11:54:30,133 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 11:54:30,133 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 11:54:30,133 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 11:54:30,133 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 11:54:30,134 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 11:54:30,134 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 11:54:30,134 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 11:54:30,134 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 11:54:30,134 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 11:54:30,134 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 11:54:30,134 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 11:54:30,134 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 11:54:30,135 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 11:54:30,135 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 11:54:30,135 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 11:54:30,135 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 11:54:30,135 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 11:54:30,135 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 11:54:30,135 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 11:54:30,135 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 11:54:30,135 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 11:54:30,135 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 11:54:30,135 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 11:54:30,135 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 11:54:30,136 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 11:54:30,136 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 11:54:30,136 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 11:54:30,136 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 11:54:30,136 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 11:54:30,136 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 11:54:30,136 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 11:54:30,136 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 11:54:30,136 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 11:54:30,334 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 11:54:30,354 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 11:54:30,356 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 11:54:30,357 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 11:54:30,363 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 11:54:30,364 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench/prod4br-ll.c [2022-04-27 11:54:30,411 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2dcc6324/90e083615ee04ba2a89fdcb104c4f3cd/FLAGf1cc92971 [2022-04-27 11:54:30,767 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 11:54:30,767 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/prod4br-ll.c [2022-04-27 11:54:30,772 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2dcc6324/90e083615ee04ba2a89fdcb104c4f3cd/FLAGf1cc92971 [2022-04-27 11:54:30,780 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2dcc6324/90e083615ee04ba2a89fdcb104c4f3cd [2022-04-27 11:54:30,782 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 11:54:30,783 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 11:54:30,785 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 11:54:30,785 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 11:54:30,788 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 11:54:30,789 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 11:54:30" (1/1) ... [2022-04-27 11:54:30,790 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25bbc0d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:54:30, skipping insertion in model container [2022-04-27 11:54:30,790 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 11:54:30" (1/1) ... [2022-04-27 11:54:30,797 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 11:54:30,807 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 11:54:30,920 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/prod4br-ll.c[524,537] [2022-04-27 11:54:30,935 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 11:54:30,941 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 11:54:30,949 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/prod4br-ll.c[524,537] [2022-04-27 11:54:30,957 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 11:54:30,966 INFO L208 MainTranslator]: Completed translation [2022-04-27 11:54:30,966 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:54:30 WrapperNode [2022-04-27 11:54:30,967 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 11:54:30,967 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 11:54:30,967 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 11:54:30,967 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 11:54:30,974 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:54:30" (1/1) ... [2022-04-27 11:54:30,974 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:54:30" (1/1) ... [2022-04-27 11:54:30,987 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:54:30" (1/1) ... [2022-04-27 11:54:30,987 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:54:30" (1/1) ... [2022-04-27 11:54:30,992 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:54:30" (1/1) ... [2022-04-27 11:54:30,999 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:54:30" (1/1) ... [2022-04-27 11:54:30,999 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:54:30" (1/1) ... [2022-04-27 11:54:31,001 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 11:54:31,001 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 11:54:31,001 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 11:54:31,001 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 11:54:31,003 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:54:30" (1/1) ... [2022-04-27 11:54:31,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 11:54:31,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:54:31,027 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 11:54:31,035 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 11:54:31,051 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 11:54:31,051 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 11:54:31,052 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 11:54:31,052 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 11:54:31,052 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 11:54:31,052 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 11:54:31,052 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 11:54:31,052 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 11:54:31,052 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 11:54:31,052 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 11:54:31,052 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 11:54:31,052 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 11:54:31,052 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 11:54:31,053 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 11:54:31,053 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 11:54:31,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 11:54:31,053 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 11:54:31,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 11:54:31,053 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 11:54:31,053 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 11:54:31,099 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 11:54:31,101 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 11:54:31,298 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 11:54:31,305 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 11:54:31,305 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 11:54:31,306 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 11:54:31 BoogieIcfgContainer [2022-04-27 11:54:31,306 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 11:54:31,308 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 11:54:31,308 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 11:54:31,312 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 11:54:31,312 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 11:54:30" (1/3) ... [2022-04-27 11:54:31,313 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ca05733 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 11:54:31, skipping insertion in model container [2022-04-27 11:54:31,313 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:54:30" (2/3) ... [2022-04-27 11:54:31,313 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ca05733 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 11:54:31, skipping insertion in model container [2022-04-27 11:54:31,313 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 11:54:31" (3/3) ... [2022-04-27 11:54:31,315 INFO L111 eAbstractionObserver]: Analyzing ICFG prod4br-ll.c [2022-04-27 11:54:31,327 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 11:54:31,328 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 11:54:31,375 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 11:54:31,382 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@6afe8638, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@29449670 [2022-04-27 11:54:31,382 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 11:54:31,392 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 20 states have internal predecessors, (28), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 11:54:31,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 11:54:31,397 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:54:31,398 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:54:31,399 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:54:31,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:54:31,405 INFO L85 PathProgramCache]: Analyzing trace with hash 1051010973, now seen corresponding path program 1 times [2022-04-27 11:54:31,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:54:31,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482319012] [2022-04-27 11:54:31,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:54:31,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:54:31,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:54:31,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:54:31,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:54:31,567 INFO L290 TraceCheckUtils]: 0: Hoare triple {43#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {34#true} is VALID [2022-04-27 11:54:31,568 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#true} assume true; {34#true} is VALID [2022-04-27 11:54:31,569 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34#true} {34#true} #76#return; {34#true} is VALID [2022-04-27 11:54:31,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 11:54:31,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:54:31,597 INFO L290 TraceCheckUtils]: 0: Hoare triple {34#true} ~cond := #in~cond; {34#true} is VALID [2022-04-27 11:54:31,598 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#true} assume 0 == ~cond;assume false; {35#false} is VALID [2022-04-27 11:54:31,598 INFO L290 TraceCheckUtils]: 2: Hoare triple {35#false} assume true; {35#false} is VALID [2022-04-27 11:54:31,598 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35#false} {34#true} #68#return; {35#false} is VALID [2022-04-27 11:54:31,599 INFO L272 TraceCheckUtils]: 0: Hoare triple {34#true} call ULTIMATE.init(); {43#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:54:31,599 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {34#true} is VALID [2022-04-27 11:54:31,599 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#true} assume true; {34#true} is VALID [2022-04-27 11:54:31,599 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34#true} {34#true} #76#return; {34#true} is VALID [2022-04-27 11:54:31,599 INFO L272 TraceCheckUtils]: 4: Hoare triple {34#true} call #t~ret6 := main(); {34#true} is VALID [2022-04-27 11:54:31,600 INFO L290 TraceCheckUtils]: 5: Hoare triple {34#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {34#true} is VALID [2022-04-27 11:54:31,600 INFO L272 TraceCheckUtils]: 6: Hoare triple {34#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {34#true} is VALID [2022-04-27 11:54:31,600 INFO L290 TraceCheckUtils]: 7: Hoare triple {34#true} ~cond := #in~cond; {34#true} is VALID [2022-04-27 11:54:31,600 INFO L290 TraceCheckUtils]: 8: Hoare triple {34#true} assume 0 == ~cond;assume false; {35#false} is VALID [2022-04-27 11:54:31,601 INFO L290 TraceCheckUtils]: 9: Hoare triple {35#false} assume true; {35#false} is VALID [2022-04-27 11:54:31,601 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {35#false} {34#true} #68#return; {35#false} is VALID [2022-04-27 11:54:31,601 INFO L290 TraceCheckUtils]: 11: Hoare triple {35#false} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {35#false} is VALID [2022-04-27 11:54:31,601 INFO L290 TraceCheckUtils]: 12: Hoare triple {35#false} assume false; {35#false} is VALID [2022-04-27 11:54:31,601 INFO L272 TraceCheckUtils]: 13: Hoare triple {35#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {35#false} is VALID [2022-04-27 11:54:31,601 INFO L290 TraceCheckUtils]: 14: Hoare triple {35#false} ~cond := #in~cond; {35#false} is VALID [2022-04-27 11:54:31,601 INFO L290 TraceCheckUtils]: 15: Hoare triple {35#false} assume 0 == ~cond; {35#false} is VALID [2022-04-27 11:54:31,602 INFO L290 TraceCheckUtils]: 16: Hoare triple {35#false} assume !false; {35#false} is VALID [2022-04-27 11:54:31,602 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 11:54:31,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:54:31,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482319012] [2022-04-27 11:54:31,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482319012] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 11:54:31,603 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 11:54:31,603 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 11:54:31,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074480228] [2022-04-27 11:54:31,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 11:54:31,608 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-27 11:54:31,609 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:54:31,611 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 11:54:31,642 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:54:31,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 11:54:31,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:54:31,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 11:54:31,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 11:54:31,667 INFO L87 Difference]: Start difference. First operand has 31 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 20 states have internal predecessors, (28), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 11:54:31,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:54:31,790 INFO L93 Difference]: Finished difference Result 53 states and 73 transitions. [2022-04-27 11:54:31,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 11:54:31,791 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-27 11:54:31,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:54:31,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 11:54:31,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2022-04-27 11:54:31,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 11:54:31,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2022-04-27 11:54:31,803 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 73 transitions. [2022-04-27 11:54:31,880 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:54:31,888 INFO L225 Difference]: With dead ends: 53 [2022-04-27 11:54:31,888 INFO L226 Difference]: Without dead ends: 26 [2022-04-27 11:54:31,891 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 11:54:31,894 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 21 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 11:54:31,895 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 35 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 11:54:31,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-27 11:54:31,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-04-27 11:54:31,926 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:54:31,927 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 26 states, 16 states have (on average 1.3125) internal successors, (21), 17 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 11:54:31,928 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 26 states, 16 states have (on average 1.3125) internal successors, (21), 17 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 11:54:31,928 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 26 states, 16 states have (on average 1.3125) internal successors, (21), 17 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 11:54:31,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:54:31,937 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2022-04-27 11:54:31,937 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2022-04-27 11:54:31,938 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:54:31,939 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:54:31,939 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 16 states have (on average 1.3125) internal successors, (21), 17 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 26 states. [2022-04-27 11:54:31,940 INFO L87 Difference]: Start difference. First operand has 26 states, 16 states have (on average 1.3125) internal successors, (21), 17 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 26 states. [2022-04-27 11:54:31,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:54:31,943 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2022-04-27 11:54:31,943 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2022-04-27 11:54:31,943 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:54:31,943 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:54:31,943 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:54:31,944 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:54:31,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 16 states have (on average 1.3125) internal successors, (21), 17 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 11:54:31,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2022-04-27 11:54:31,947 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 17 [2022-04-27 11:54:31,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:54:31,947 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2022-04-27 11:54:31,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 11:54:31,948 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2022-04-27 11:54:31,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 11:54:31,948 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:54:31,948 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:54:31,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 11:54:31,949 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:54:31,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:54:31,949 INFO L85 PathProgramCache]: Analyzing trace with hash 1732856803, now seen corresponding path program 1 times [2022-04-27 11:54:31,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:54:31,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179827636] [2022-04-27 11:54:31,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:54:31,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:54:31,969 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 11:54:31,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1430858013] [2022-04-27 11:54:31,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:54:31,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:54:31,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:54:31,972 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 11:54:31,977 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 11:54:32,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:54:32,066 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-27 11:54:32,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:54:32,084 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:54:32,237 INFO L272 TraceCheckUtils]: 0: Hoare triple {204#true} call ULTIMATE.init(); {204#true} is VALID [2022-04-27 11:54:32,237 INFO L290 TraceCheckUtils]: 1: Hoare triple {204#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {204#true} is VALID [2022-04-27 11:54:32,238 INFO L290 TraceCheckUtils]: 2: Hoare triple {204#true} assume true; {204#true} is VALID [2022-04-27 11:54:32,238 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {204#true} {204#true} #76#return; {204#true} is VALID [2022-04-27 11:54:32,238 INFO L272 TraceCheckUtils]: 4: Hoare triple {204#true} call #t~ret6 := main(); {204#true} is VALID [2022-04-27 11:54:32,238 INFO L290 TraceCheckUtils]: 5: Hoare triple {204#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {204#true} is VALID [2022-04-27 11:54:32,238 INFO L272 TraceCheckUtils]: 6: Hoare triple {204#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {204#true} is VALID [2022-04-27 11:54:32,238 INFO L290 TraceCheckUtils]: 7: Hoare triple {204#true} ~cond := #in~cond; {204#true} is VALID [2022-04-27 11:54:32,239 INFO L290 TraceCheckUtils]: 8: Hoare triple {204#true} assume !(0 == ~cond); {204#true} is VALID [2022-04-27 11:54:32,239 INFO L290 TraceCheckUtils]: 9: Hoare triple {204#true} assume true; {204#true} is VALID [2022-04-27 11:54:32,239 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {204#true} {204#true} #68#return; {204#true} is VALID [2022-04-27 11:54:32,240 INFO L290 TraceCheckUtils]: 11: Hoare triple {204#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {242#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 11:54:32,240 INFO L290 TraceCheckUtils]: 12: Hoare triple {242#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {242#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 11:54:32,241 INFO L272 TraceCheckUtils]: 13: Hoare triple {242#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {249#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:54:32,242 INFO L290 TraceCheckUtils]: 14: Hoare triple {249#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {253#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:54:32,242 INFO L290 TraceCheckUtils]: 15: Hoare triple {253#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {205#false} is VALID [2022-04-27 11:54:32,242 INFO L290 TraceCheckUtils]: 16: Hoare triple {205#false} assume !false; {205#false} is VALID [2022-04-27 11:54:32,242 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 11:54:32,242 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 11:54:32,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:54:32,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179827636] [2022-04-27 11:54:32,243 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 11:54:32,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1430858013] [2022-04-27 11:54:32,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1430858013] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 11:54:32,243 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 11:54:32,243 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 11:54:32,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020673396] [2022-04-27 11:54:32,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 11:54:32,245 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-27 11:54:32,245 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:54:32,245 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 11:54:32,257 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:54:32,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 11:54:32,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:54:32,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 11:54:32,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 11:54:32,258 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 11:54:32,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:54:32,435 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2022-04-27 11:54:32,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 11:54:32,435 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-27 11:54:32,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:54:32,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 11:54:32,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2022-04-27 11:54:32,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 11:54:32,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2022-04-27 11:54:32,454 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 50 transitions. [2022-04-27 11:54:32,489 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 11:54:32,490 INFO L225 Difference]: With dead ends: 40 [2022-04-27 11:54:32,490 INFO L226 Difference]: Without dead ends: 38 [2022-04-27 11:54:32,491 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 11:54:32,492 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 9 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 11:54:32,492 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 75 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 11:54:32,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-27 11:54:32,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 32. [2022-04-27 11:54:32,497 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:54:32,497 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 32 states, 20 states have (on average 1.25) internal successors, (25), 22 states have internal predecessors, (25), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 11:54:32,498 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 32 states, 20 states have (on average 1.25) internal successors, (25), 22 states have internal predecessors, (25), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 11:54:32,498 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 32 states, 20 states have (on average 1.25) internal successors, (25), 22 states have internal predecessors, (25), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 11:54:32,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:54:32,500 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2022-04-27 11:54:32,500 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 48 transitions. [2022-04-27 11:54:32,501 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:54:32,501 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:54:32,501 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 20 states have (on average 1.25) internal successors, (25), 22 states have internal predecessors, (25), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 38 states. [2022-04-27 11:54:32,502 INFO L87 Difference]: Start difference. First operand has 32 states, 20 states have (on average 1.25) internal successors, (25), 22 states have internal predecessors, (25), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 38 states. [2022-04-27 11:54:32,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:54:32,504 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2022-04-27 11:54:32,504 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 48 transitions. [2022-04-27 11:54:32,504 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:54:32,504 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:54:32,505 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:54:32,505 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:54:32,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 20 states have (on average 1.25) internal successors, (25), 22 states have internal predecessors, (25), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 11:54:32,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2022-04-27 11:54:32,507 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 17 [2022-04-27 11:54:32,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:54:32,507 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2022-04-27 11:54:32,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 11:54:32,507 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2022-04-27 11:54:32,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-27 11:54:32,508 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:54:32,508 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:54:32,527 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-27 11:54:32,722 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 11:54:32,722 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:54:32,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:54:32,723 INFO L85 PathProgramCache]: Analyzing trace with hash -253409975, now seen corresponding path program 1 times [2022-04-27 11:54:32,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:54:32,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251453685] [2022-04-27 11:54:32,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:54:32,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:54:32,734 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 11:54:32,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [913263085] [2022-04-27 11:54:32,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:54:32,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:54:32,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:54:32,736 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 11:54:32,737 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 11:54:32,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:54:32,767 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-27 11:54:32,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:54:32,776 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:54:43,241 INFO L272 TraceCheckUtils]: 0: Hoare triple {439#true} call ULTIMATE.init(); {439#true} is VALID [2022-04-27 11:54:43,242 INFO L290 TraceCheckUtils]: 1: Hoare triple {439#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {439#true} is VALID [2022-04-27 11:54:43,242 INFO L290 TraceCheckUtils]: 2: Hoare triple {439#true} assume true; {439#true} is VALID [2022-04-27 11:54:43,242 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {439#true} {439#true} #76#return; {439#true} is VALID [2022-04-27 11:54:43,242 INFO L272 TraceCheckUtils]: 4: Hoare triple {439#true} call #t~ret6 := main(); {439#true} is VALID [2022-04-27 11:54:43,242 INFO L290 TraceCheckUtils]: 5: Hoare triple {439#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {439#true} is VALID [2022-04-27 11:54:43,242 INFO L272 TraceCheckUtils]: 6: Hoare triple {439#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {439#true} is VALID [2022-04-27 11:54:43,243 INFO L290 TraceCheckUtils]: 7: Hoare triple {439#true} ~cond := #in~cond; {465#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 11:54:43,243 INFO L290 TraceCheckUtils]: 8: Hoare triple {465#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {469#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 11:54:43,244 INFO L290 TraceCheckUtils]: 9: Hoare triple {469#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {469#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 11:54:43,244 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {469#(not (= |assume_abort_if_not_#in~cond| 0))} {439#true} #68#return; {476#(<= 1 main_~y~0)} is VALID [2022-04-27 11:54:43,245 INFO L290 TraceCheckUtils]: 11: Hoare triple {476#(<= 1 main_~y~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {480#(and (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} is VALID [2022-04-27 11:54:43,245 INFO L290 TraceCheckUtils]: 12: Hoare triple {480#(and (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} assume !false; {480#(and (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} is VALID [2022-04-27 11:54:43,245 INFO L272 TraceCheckUtils]: 13: Hoare triple {480#(and (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {439#true} is VALID [2022-04-27 11:54:43,246 INFO L290 TraceCheckUtils]: 14: Hoare triple {439#true} ~cond := #in~cond; {490#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:54:43,246 INFO L290 TraceCheckUtils]: 15: Hoare triple {490#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {494#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:54:43,246 INFO L290 TraceCheckUtils]: 16: Hoare triple {494#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {494#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:54:45,253 WARN L284 TraceCheckUtils]: 17: Hoare quadruple {494#(not (= |__VERIFIER_assert_#in~cond| 0))} {480#(and (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} #70#return; {501#(and (or (and (= (mod (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) (* main_~b~0 main_~a~0)) 0) (not (= main_~a~0 0))) (= (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) 0)) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} is UNKNOWN [2022-04-27 11:54:45,254 INFO L290 TraceCheckUtils]: 18: Hoare triple {501#(and (or (and (= (mod (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) (* main_~b~0 main_~a~0)) 0) (not (= main_~a~0 0))) (= (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) 0)) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} assume !(0 != ~a~0 && 0 != ~b~0); {505#(and (= main_~q~0 (* main_~y~0 main_~x~0)) (<= 1 main_~y~0))} is VALID [2022-04-27 11:54:45,255 INFO L272 TraceCheckUtils]: 19: Hoare triple {505#(and (= main_~q~0 (* main_~y~0 main_~x~0)) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {509#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:54:45,256 INFO L290 TraceCheckUtils]: 20: Hoare triple {509#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {513#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:54:45,257 INFO L290 TraceCheckUtils]: 21: Hoare triple {513#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {440#false} is VALID [2022-04-27 11:54:45,257 INFO L290 TraceCheckUtils]: 22: Hoare triple {440#false} assume !false; {440#false} is VALID [2022-04-27 11:54:45,257 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:54:45,257 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:55:16,198 INFO L290 TraceCheckUtils]: 22: Hoare triple {440#false} assume !false; {440#false} is VALID [2022-04-27 11:55:16,198 INFO L290 TraceCheckUtils]: 21: Hoare triple {513#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {440#false} is VALID [2022-04-27 11:55:16,198 INFO L290 TraceCheckUtils]: 20: Hoare triple {509#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {513#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:55:16,199 INFO L272 TraceCheckUtils]: 19: Hoare triple {529#(= main_~q~0 (* main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {509#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:55:16,200 INFO L290 TraceCheckUtils]: 18: Hoare triple {533#(or (= main_~q~0 (* main_~y~0 main_~x~0)) (and (not (= main_~b~0 0)) (not (= main_~a~0 0))))} assume !(0 != ~a~0 && 0 != ~b~0); {529#(= main_~q~0 (* main_~y~0 main_~x~0))} is VALID [2022-04-27 11:55:16,202 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {494#(not (= |__VERIFIER_assert_#in~cond| 0))} {439#true} #70#return; {533#(or (= main_~q~0 (* main_~y~0 main_~x~0)) (and (not (= main_~b~0 0)) (not (= main_~a~0 0))))} is VALID [2022-04-27 11:55:16,202 INFO L290 TraceCheckUtils]: 16: Hoare triple {494#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {494#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:55:16,202 INFO L290 TraceCheckUtils]: 15: Hoare triple {546#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {494#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:55:16,203 INFO L290 TraceCheckUtils]: 14: Hoare triple {439#true} ~cond := #in~cond; {546#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 11:55:16,203 INFO L272 TraceCheckUtils]: 13: Hoare triple {439#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {439#true} is VALID [2022-04-27 11:55:16,203 INFO L290 TraceCheckUtils]: 12: Hoare triple {439#true} assume !false; {439#true} is VALID [2022-04-27 11:55:16,203 INFO L290 TraceCheckUtils]: 11: Hoare triple {439#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {439#true} is VALID [2022-04-27 11:55:16,204 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {439#true} {439#true} #68#return; {439#true} is VALID [2022-04-27 11:55:16,204 INFO L290 TraceCheckUtils]: 9: Hoare triple {439#true} assume true; {439#true} is VALID [2022-04-27 11:55:16,204 INFO L290 TraceCheckUtils]: 8: Hoare triple {439#true} assume !(0 == ~cond); {439#true} is VALID [2022-04-27 11:55:16,204 INFO L290 TraceCheckUtils]: 7: Hoare triple {439#true} ~cond := #in~cond; {439#true} is VALID [2022-04-27 11:55:16,204 INFO L272 TraceCheckUtils]: 6: Hoare triple {439#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {439#true} is VALID [2022-04-27 11:55:16,204 INFO L290 TraceCheckUtils]: 5: Hoare triple {439#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {439#true} is VALID [2022-04-27 11:55:16,204 INFO L272 TraceCheckUtils]: 4: Hoare triple {439#true} call #t~ret6 := main(); {439#true} is VALID [2022-04-27 11:55:16,204 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {439#true} {439#true} #76#return; {439#true} is VALID [2022-04-27 11:55:16,204 INFO L290 TraceCheckUtils]: 2: Hoare triple {439#true} assume true; {439#true} is VALID [2022-04-27 11:55:16,205 INFO L290 TraceCheckUtils]: 1: Hoare triple {439#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {439#true} is VALID [2022-04-27 11:55:16,205 INFO L272 TraceCheckUtils]: 0: Hoare triple {439#true} call ULTIMATE.init(); {439#true} is VALID [2022-04-27 11:55:16,205 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:55:16,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:55:16,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251453685] [2022-04-27 11:55:16,206 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 11:55:16,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [913263085] [2022-04-27 11:55:16,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [913263085] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:55:16,207 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 11:55:16,207 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 15 [2022-04-27 11:55:16,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827341247] [2022-04-27 11:55:16,207 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 11:55:16,208 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 11 states have internal predecessors, (23), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 23 [2022-04-27 11:55:16,208 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:55:16,208 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 11 states have internal predecessors, (23), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 11:55:18,240 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 34 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-27 11:55:18,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-27 11:55:18,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:55:18,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-27 11:55:18,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-04-27 11:55:18,242 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand has 15 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 11 states have internal predecessors, (23), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 11:55:20,869 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 11:55:26,442 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 11:55:28,647 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 11:55:28,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:55:28,873 INFO L93 Difference]: Finished difference Result 58 states and 76 transitions. [2022-04-27 11:55:28,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-27 11:55:28,873 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 11 states have internal predecessors, (23), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 23 [2022-04-27 11:55:28,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:55:28,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 11 states have internal predecessors, (23), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 11:55:28,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 73 transitions. [2022-04-27 11:55:28,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 11 states have internal predecessors, (23), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 11:55:28,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 73 transitions. [2022-04-27 11:55:28,879 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 73 transitions. [2022-04-27 11:55:30,943 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 72 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-27 11:55:30,945 INFO L225 Difference]: With dead ends: 58 [2022-04-27 11:55:30,945 INFO L226 Difference]: Without dead ends: 56 [2022-04-27 11:55:30,949 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2022-04-27 11:55:30,952 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 27 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 19 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.0s IncrementalHoareTripleChecker+Time [2022-04-27 11:55:30,955 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 147 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 292 Invalid, 3 Unknown, 0 Unchecked, 8.0s Time] [2022-04-27 11:55:30,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-04-27 11:55:30,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 36. [2022-04-27 11:55:30,968 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:55:30,968 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand has 36 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 25 states have internal predecessors, (28), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 11:55:30,969 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand has 36 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 25 states have internal predecessors, (28), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 11:55:30,969 INFO L87 Difference]: Start difference. First operand 56 states. Second operand has 36 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 25 states have internal predecessors, (28), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 11:55:30,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:55:30,971 INFO L93 Difference]: Finished difference Result 56 states and 74 transitions. [2022-04-27 11:55:30,972 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 74 transitions. [2022-04-27 11:55:30,972 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:55:30,972 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:55:30,973 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 25 states have internal predecessors, (28), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 56 states. [2022-04-27 11:55:30,973 INFO L87 Difference]: Start difference. First operand has 36 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 25 states have internal predecessors, (28), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 56 states. [2022-04-27 11:55:30,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:55:30,975 INFO L93 Difference]: Finished difference Result 56 states and 74 transitions. [2022-04-27 11:55:30,975 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 74 transitions. [2022-04-27 11:55:30,976 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:55:30,976 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:55:30,976 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:55:30,976 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:55:30,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 25 states have internal predecessors, (28), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 11:55:30,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2022-04-27 11:55:30,977 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 23 [2022-04-27 11:55:30,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:55:30,977 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2022-04-27 11:55:30,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 11 states have internal predecessors, (23), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 11:55:30,978 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2022-04-27 11:55:30,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-27 11:55:30,978 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:55:30,978 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:55:30,997 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 11:55:31,179 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 11:55:31,179 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:55:31,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:55:31,180 INFO L85 PathProgramCache]: Analyzing trace with hash 1855333828, now seen corresponding path program 1 times [2022-04-27 11:55:31,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:55:31,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345309145] [2022-04-27 11:55:31,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:55:31,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:55:31,192 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 11:55:31,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2121119380] [2022-04-27 11:55:31,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:55:31,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:55:31,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:55:31,194 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 11:55:31,195 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 11:55:31,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:55:31,240 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 34 conjunts are in the unsatisfiable core [2022-04-27 11:55:31,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:55:31,254 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:55:32,718 INFO L272 TraceCheckUtils]: 0: Hoare triple {850#true} call ULTIMATE.init(); {850#true} is VALID [2022-04-27 11:55:32,719 INFO L290 TraceCheckUtils]: 1: Hoare triple {850#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {850#true} is VALID [2022-04-27 11:55:32,719 INFO L290 TraceCheckUtils]: 2: Hoare triple {850#true} assume true; {850#true} is VALID [2022-04-27 11:55:32,719 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {850#true} {850#true} #76#return; {850#true} is VALID [2022-04-27 11:55:32,719 INFO L272 TraceCheckUtils]: 4: Hoare triple {850#true} call #t~ret6 := main(); {850#true} is VALID [2022-04-27 11:55:32,719 INFO L290 TraceCheckUtils]: 5: Hoare triple {850#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {850#true} is VALID [2022-04-27 11:55:32,719 INFO L272 TraceCheckUtils]: 6: Hoare triple {850#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {850#true} is VALID [2022-04-27 11:55:32,720 INFO L290 TraceCheckUtils]: 7: Hoare triple {850#true} ~cond := #in~cond; {876#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 11:55:32,720 INFO L290 TraceCheckUtils]: 8: Hoare triple {876#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {880#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 11:55:32,721 INFO L290 TraceCheckUtils]: 9: Hoare triple {880#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {880#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 11:55:32,721 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {880#(not (= |assume_abort_if_not_#in~cond| 0))} {850#true} #68#return; {887#(<= 1 main_~y~0)} is VALID [2022-04-27 11:55:32,722 INFO L290 TraceCheckUtils]: 11: Hoare triple {887#(<= 1 main_~y~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {891#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 11:55:32,722 INFO L290 TraceCheckUtils]: 12: Hoare triple {891#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {891#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 11:55:32,722 INFO L272 TraceCheckUtils]: 13: Hoare triple {891#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {850#true} is VALID [2022-04-27 11:55:32,723 INFO L290 TraceCheckUtils]: 14: Hoare triple {850#true} ~cond := #in~cond; {901#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:55:32,723 INFO L290 TraceCheckUtils]: 15: Hoare triple {901#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {905#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:55:32,725 INFO L290 TraceCheckUtils]: 16: Hoare triple {905#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {905#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:55:32,726 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {905#(not (= |__VERIFIER_assert_#in~cond| 0))} {891#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #70#return; {891#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 11:55:32,726 INFO L290 TraceCheckUtils]: 18: Hoare triple {891#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(0 != ~a~0 && 0 != ~b~0); {891#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 11:55:32,728 INFO L290 TraceCheckUtils]: 19: Hoare triple {891#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {918#(and (= (div main_~y~0 2) main_~b~0) (<= (mod main_~y~0 2) 0) (= main_~q~0 0) (= main_~p~0 4) (= (div main_~x~0 2) main_~a~0) (<= 1 main_~y~0) (= (mod main_~x~0 2) 0))} is VALID [2022-04-27 11:55:32,728 INFO L290 TraceCheckUtils]: 20: Hoare triple {918#(and (= (div main_~y~0 2) main_~b~0) (<= (mod main_~y~0 2) 0) (= main_~q~0 0) (= main_~p~0 4) (= (div main_~x~0 2) main_~a~0) (<= 1 main_~y~0) (= (mod main_~x~0 2) 0))} assume !false; {918#(and (= (div main_~y~0 2) main_~b~0) (<= (mod main_~y~0 2) 0) (= main_~q~0 0) (= main_~p~0 4) (= (div main_~x~0 2) main_~a~0) (<= 1 main_~y~0) (= (mod main_~x~0 2) 0))} is VALID [2022-04-27 11:55:32,731 INFO L272 TraceCheckUtils]: 21: Hoare triple {918#(and (= (div main_~y~0 2) main_~b~0) (<= (mod main_~y~0 2) 0) (= main_~q~0 0) (= main_~p~0 4) (= (div main_~x~0 2) main_~a~0) (<= 1 main_~y~0) (= (mod main_~x~0 2) 0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {925#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:55:32,731 INFO L290 TraceCheckUtils]: 22: Hoare triple {925#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {929#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:55:32,732 INFO L290 TraceCheckUtils]: 23: Hoare triple {929#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {851#false} is VALID [2022-04-27 11:55:32,732 INFO L290 TraceCheckUtils]: 24: Hoare triple {851#false} assume !false; {851#false} is VALID [2022-04-27 11:55:32,732 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:55:32,732 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:56:40,531 INFO L290 TraceCheckUtils]: 24: Hoare triple {851#false} assume !false; {851#false} is VALID [2022-04-27 11:56:40,533 INFO L290 TraceCheckUtils]: 23: Hoare triple {929#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {851#false} is VALID [2022-04-27 11:56:40,534 INFO L290 TraceCheckUtils]: 22: Hoare triple {925#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {929#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:56:40,535 INFO L272 TraceCheckUtils]: 21: Hoare triple {945#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {925#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:56:40,536 INFO L290 TraceCheckUtils]: 20: Hoare triple {945#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} assume !false; {945#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-27 11:56:40,541 INFO L290 TraceCheckUtils]: 19: Hoare triple {952#(or (and (or (not (= (mod main_~b~0 2) 0)) (= (+ (* (div main_~b~0 2) (* main_~p~0 4) (div main_~a~0 2)) main_~q~0) (* main_~y~0 main_~x~0))) (or (= (mod main_~b~0 2) 0) (= (+ main_~q~0 (* (+ (div main_~b~0 2) 1) (* main_~p~0 4) (div main_~a~0 2))) (* main_~y~0 main_~x~0)))) (not (= (mod main_~a~0 2) 0)) (and (not (< main_~b~0 0)) (not (<= (mod main_~b~0 2) 0))))} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {945#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-27 11:56:40,542 INFO L290 TraceCheckUtils]: 18: Hoare triple {952#(or (and (or (not (= (mod main_~b~0 2) 0)) (= (+ (* (div main_~b~0 2) (* main_~p~0 4) (div main_~a~0 2)) main_~q~0) (* main_~y~0 main_~x~0))) (or (= (mod main_~b~0 2) 0) (= (+ main_~q~0 (* (+ (div main_~b~0 2) 1) (* main_~p~0 4) (div main_~a~0 2))) (* main_~y~0 main_~x~0)))) (not (= (mod main_~a~0 2) 0)) (and (not (< main_~b~0 0)) (not (<= (mod main_~b~0 2) 0))))} assume !!(0 != ~a~0 && 0 != ~b~0); {952#(or (and (or (not (= (mod main_~b~0 2) 0)) (= (+ (* (div main_~b~0 2) (* main_~p~0 4) (div main_~a~0 2)) main_~q~0) (* main_~y~0 main_~x~0))) (or (= (mod main_~b~0 2) 0) (= (+ main_~q~0 (* (+ (div main_~b~0 2) 1) (* main_~p~0 4) (div main_~a~0 2))) (* main_~y~0 main_~x~0)))) (not (= (mod main_~a~0 2) 0)) (and (not (< main_~b~0 0)) (not (<= (mod main_~b~0 2) 0))))} is VALID [2022-04-27 11:56:40,550 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {905#(not (= |__VERIFIER_assert_#in~cond| 0))} {959#(or (not (= (mod main_~a~0 2) 0)) (= (mod main_~b~0 2) 0) (not (< main_~b~0 0)) (not (= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))) (= (+ main_~q~0 (* (+ (div main_~b~0 2) 1) (* main_~p~0 4) (div main_~a~0 2))) (* main_~y~0 main_~x~0)))} #70#return; {952#(or (and (or (not (= (mod main_~b~0 2) 0)) (= (+ (* (div main_~b~0 2) (* main_~p~0 4) (div main_~a~0 2)) main_~q~0) (* main_~y~0 main_~x~0))) (or (= (mod main_~b~0 2) 0) (= (+ main_~q~0 (* (+ (div main_~b~0 2) 1) (* main_~p~0 4) (div main_~a~0 2))) (* main_~y~0 main_~x~0)))) (not (= (mod main_~a~0 2) 0)) (and (not (< main_~b~0 0)) (not (<= (mod main_~b~0 2) 0))))} is VALID [2022-04-27 11:56:40,561 INFO L290 TraceCheckUtils]: 16: Hoare triple {905#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {905#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:56:40,564 INFO L290 TraceCheckUtils]: 15: Hoare triple {969#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {905#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:56:40,565 INFO L290 TraceCheckUtils]: 14: Hoare triple {850#true} ~cond := #in~cond; {969#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 11:56:40,565 INFO L272 TraceCheckUtils]: 13: Hoare triple {959#(or (not (= (mod main_~a~0 2) 0)) (= (mod main_~b~0 2) 0) (not (< main_~b~0 0)) (not (= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))) (= (+ main_~q~0 (* (+ (div main_~b~0 2) 1) (* main_~p~0 4) (div main_~a~0 2))) (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {850#true} is VALID [2022-04-27 11:56:40,566 INFO L290 TraceCheckUtils]: 12: Hoare triple {959#(or (not (= (mod main_~a~0 2) 0)) (= (mod main_~b~0 2) 0) (not (< main_~b~0 0)) (not (= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))) (= (+ main_~q~0 (* (+ (div main_~b~0 2) 1) (* main_~p~0 4) (div main_~a~0 2))) (* main_~y~0 main_~x~0)))} assume !false; {959#(or (not (= (mod main_~a~0 2) 0)) (= (mod main_~b~0 2) 0) (not (< main_~b~0 0)) (not (= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))) (= (+ main_~q~0 (* (+ (div main_~b~0 2) 1) (* main_~p~0 4) (div main_~a~0 2))) (* main_~y~0 main_~x~0)))} is VALID [2022-04-27 11:56:40,567 INFO L290 TraceCheckUtils]: 11: Hoare triple {979#(or (not (< main_~y~0 0)) (= (mod main_~y~0 2) 0) (= (* (div main_~x~0 2) (+ (div main_~y~0 2) 1) 4) (* main_~y~0 main_~x~0)) (not (= (mod main_~x~0 2) 0)))} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {959#(or (not (= (mod main_~a~0 2) 0)) (= (mod main_~b~0 2) 0) (not (< main_~b~0 0)) (not (= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))) (= (+ main_~q~0 (* (+ (div main_~b~0 2) 1) (* main_~p~0 4) (div main_~a~0 2))) (* main_~y~0 main_~x~0)))} is VALID [2022-04-27 11:56:40,572 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {880#(not (= |assume_abort_if_not_#in~cond| 0))} {850#true} #68#return; {979#(or (not (< main_~y~0 0)) (= (mod main_~y~0 2) 0) (= (* (div main_~x~0 2) (+ (div main_~y~0 2) 1) 4) (* main_~y~0 main_~x~0)) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-27 11:56:40,572 INFO L290 TraceCheckUtils]: 9: Hoare triple {880#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {880#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 11:56:40,573 INFO L290 TraceCheckUtils]: 8: Hoare triple {992#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {880#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 11:56:40,573 INFO L290 TraceCheckUtils]: 7: Hoare triple {850#true} ~cond := #in~cond; {992#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-27 11:56:40,573 INFO L272 TraceCheckUtils]: 6: Hoare triple {850#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {850#true} is VALID [2022-04-27 11:56:40,573 INFO L290 TraceCheckUtils]: 5: Hoare triple {850#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {850#true} is VALID [2022-04-27 11:56:40,574 INFO L272 TraceCheckUtils]: 4: Hoare triple {850#true} call #t~ret6 := main(); {850#true} is VALID [2022-04-27 11:56:40,574 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {850#true} {850#true} #76#return; {850#true} is VALID [2022-04-27 11:56:40,574 INFO L290 TraceCheckUtils]: 2: Hoare triple {850#true} assume true; {850#true} is VALID [2022-04-27 11:56:40,574 INFO L290 TraceCheckUtils]: 1: Hoare triple {850#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {850#true} is VALID [2022-04-27 11:56:40,574 INFO L272 TraceCheckUtils]: 0: Hoare triple {850#true} call ULTIMATE.init(); {850#true} is VALID [2022-04-27 11:56:40,574 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:56:40,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:56:40,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345309145] [2022-04-27 11:56:40,574 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 11:56:40,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2121119380] [2022-04-27 11:56:40,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2121119380] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:56:40,575 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 11:56:40,575 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 17 [2022-04-27 11:56:40,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877918310] [2022-04-27 11:56:40,575 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 11:56:40,576 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 14 states have internal predecessors, (26), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 25 [2022-04-27 11:56:40,576 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:56:40,576 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 14 states have internal predecessors, (26), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-27 11:56:40,624 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:56:40,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-27 11:56:40,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:56:40,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-27 11:56:40,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2022-04-27 11:56:40,625 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand has 17 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 14 states have internal predecessors, (26), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-27 11:56:44,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:56:44,133 INFO L93 Difference]: Finished difference Result 62 states and 81 transitions. [2022-04-27 11:56:44,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-27 11:56:44,133 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 14 states have internal predecessors, (26), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 25 [2022-04-27 11:56:44,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:56:44,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 14 states have internal predecessors, (26), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-27 11:56:44,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 75 transitions. [2022-04-27 11:56:44,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 14 states have internal predecessors, (26), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-27 11:56:44,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 75 transitions. [2022-04-27 11:56:44,137 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 75 transitions. [2022-04-27 11:56:44,314 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:56:44,315 INFO L225 Difference]: With dead ends: 62 [2022-04-27 11:56:44,316 INFO L226 Difference]: Without dead ends: 58 [2022-04-27 11:56:44,316 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2022-04-27 11:56:44,317 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 84 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-04-27 11:56:44,317 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 117 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-04-27 11:56:44,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-04-27 11:56:44,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 32. [2022-04-27 11:56:44,333 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:56:44,333 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand has 32 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 11:56:44,333 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand has 32 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 11:56:44,334 INFO L87 Difference]: Start difference. First operand 58 states. Second operand has 32 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 11:56:44,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:56:44,336 INFO L93 Difference]: Finished difference Result 58 states and 77 transitions. [2022-04-27 11:56:44,336 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 77 transitions. [2022-04-27 11:56:44,336 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:56:44,336 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:56:44,336 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 58 states. [2022-04-27 11:56:44,336 INFO L87 Difference]: Start difference. First operand has 32 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 58 states. [2022-04-27 11:56:44,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:56:44,338 INFO L93 Difference]: Finished difference Result 58 states and 77 transitions. [2022-04-27 11:56:44,338 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 77 transitions. [2022-04-27 11:56:44,339 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:56:44,339 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:56:44,339 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:56:44,339 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:56:44,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 11:56:44,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2022-04-27 11:56:44,340 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 25 [2022-04-27 11:56:44,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:56:44,340 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2022-04-27 11:56:44,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 14 states have internal predecessors, (26), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-27 11:56:44,341 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-04-27 11:56:44,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-27 11:56:44,341 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:56:44,341 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:56:44,362 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 11:56:44,562 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 11:56:44,563 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:56:44,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:56:44,563 INFO L85 PathProgramCache]: Analyzing trace with hash 642754736, now seen corresponding path program 1 times [2022-04-27 11:56:44,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:56:44,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011966707] [2022-04-27 11:56:44,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:56:44,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:56:44,571 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 11:56:44,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [394188226] [2022-04-27 11:56:44,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:56:44,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:56:44,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:56:44,573 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 11:56:44,573 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 11:56:44,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:56:44,605 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-27 11:56:44,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:56:44,619 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:56:44,755 INFO L272 TraceCheckUtils]: 0: Hoare triple {1273#true} call ULTIMATE.init(); {1273#true} is VALID [2022-04-27 11:56:44,755 INFO L290 TraceCheckUtils]: 1: Hoare triple {1273#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {1273#true} is VALID [2022-04-27 11:56:44,755 INFO L290 TraceCheckUtils]: 2: Hoare triple {1273#true} assume true; {1273#true} is VALID [2022-04-27 11:56:44,755 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1273#true} {1273#true} #76#return; {1273#true} is VALID [2022-04-27 11:56:44,755 INFO L272 TraceCheckUtils]: 4: Hoare triple {1273#true} call #t~ret6 := main(); {1273#true} is VALID [2022-04-27 11:56:44,755 INFO L290 TraceCheckUtils]: 5: Hoare triple {1273#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1273#true} is VALID [2022-04-27 11:56:44,756 INFO L272 TraceCheckUtils]: 6: Hoare triple {1273#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1273#true} is VALID [2022-04-27 11:56:44,756 INFO L290 TraceCheckUtils]: 7: Hoare triple {1273#true} ~cond := #in~cond; {1299#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 11:56:44,756 INFO L290 TraceCheckUtils]: 8: Hoare triple {1299#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1303#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 11:56:44,757 INFO L290 TraceCheckUtils]: 9: Hoare triple {1303#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1303#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 11:56:44,757 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1303#(not (= |assume_abort_if_not_#in~cond| 0))} {1273#true} #68#return; {1310#(<= 1 main_~y~0)} is VALID [2022-04-27 11:56:44,758 INFO L290 TraceCheckUtils]: 11: Hoare triple {1310#(<= 1 main_~y~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {1314#(<= 1 main_~b~0)} is VALID [2022-04-27 11:56:44,758 INFO L290 TraceCheckUtils]: 12: Hoare triple {1314#(<= 1 main_~b~0)} assume !false; {1314#(<= 1 main_~b~0)} is VALID [2022-04-27 11:56:44,758 INFO L272 TraceCheckUtils]: 13: Hoare triple {1314#(<= 1 main_~b~0)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {1273#true} is VALID [2022-04-27 11:56:44,758 INFO L290 TraceCheckUtils]: 14: Hoare triple {1273#true} ~cond := #in~cond; {1273#true} is VALID [2022-04-27 11:56:44,758 INFO L290 TraceCheckUtils]: 15: Hoare triple {1273#true} assume !(0 == ~cond); {1273#true} is VALID [2022-04-27 11:56:44,758 INFO L290 TraceCheckUtils]: 16: Hoare triple {1273#true} assume true; {1273#true} is VALID [2022-04-27 11:56:44,759 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1273#true} {1314#(<= 1 main_~b~0)} #70#return; {1314#(<= 1 main_~b~0)} is VALID [2022-04-27 11:56:44,760 INFO L290 TraceCheckUtils]: 18: Hoare triple {1314#(<= 1 main_~b~0)} assume !(0 != ~a~0 && 0 != ~b~0); {1336#(and (= main_~a~0 0) (<= 1 main_~b~0))} is VALID [2022-04-27 11:56:44,760 INFO L272 TraceCheckUtils]: 19: Hoare triple {1336#(and (= main_~a~0 0) (<= 1 main_~b~0))} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {1273#true} is VALID [2022-04-27 11:56:44,760 INFO L290 TraceCheckUtils]: 20: Hoare triple {1273#true} ~cond := #in~cond; {1273#true} is VALID [2022-04-27 11:56:44,760 INFO L290 TraceCheckUtils]: 21: Hoare triple {1273#true} assume !(0 == ~cond); {1273#true} is VALID [2022-04-27 11:56:44,760 INFO L290 TraceCheckUtils]: 22: Hoare triple {1273#true} assume true; {1273#true} is VALID [2022-04-27 11:56:44,761 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1273#true} {1336#(and (= main_~a~0 0) (<= 1 main_~b~0))} #72#return; {1336#(and (= main_~a~0 0) (<= 1 main_~b~0))} is VALID [2022-04-27 11:56:44,761 INFO L272 TraceCheckUtils]: 24: Hoare triple {1336#(and (= main_~a~0 0) (<= 1 main_~b~0))} call __VERIFIER_assert((if 0 == ~a~0 * ~b~0 then 1 else 0)); {1355#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:56:44,762 INFO L290 TraceCheckUtils]: 25: Hoare triple {1355#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1359#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:56:44,762 INFO L290 TraceCheckUtils]: 26: Hoare triple {1359#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1274#false} is VALID [2022-04-27 11:56:44,762 INFO L290 TraceCheckUtils]: 27: Hoare triple {1274#false} assume !false; {1274#false} is VALID [2022-04-27 11:56:44,762 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 11:56:44,762 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 11:56:44,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:56:44,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011966707] [2022-04-27 11:56:44,763 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 11:56:44,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [394188226] [2022-04-27 11:56:44,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [394188226] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 11:56:44,763 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 11:56:44,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-27 11:56:44,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185350265] [2022-04-27 11:56:44,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 11:56:44,764 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 28 [2022-04-27 11:56:44,765 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:56:44,765 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 11:56:44,785 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 11:56:44,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-27 11:56:44,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:56:44,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-27 11:56:44,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-04-27 11:56:44,786 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand has 9 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 11:56:45,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:56:45,103 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2022-04-27 11:56:45,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 11:56:45,104 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 28 [2022-04-27 11:56:45,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:56:45,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 11:56:45,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 48 transitions. [2022-04-27 11:56:45,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 11:56:45,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 48 transitions. [2022-04-27 11:56:45,106 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 48 transitions. [2022-04-27 11:56:45,153 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:56:45,154 INFO L225 Difference]: With dead ends: 44 [2022-04-27 11:56:45,154 INFO L226 Difference]: Without dead ends: 38 [2022-04-27 11:56:45,154 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2022-04-27 11:56:45,154 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 24 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 11:56:45,155 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 132 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 11:56:45,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-27 11:56:45,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2022-04-27 11:56:45,175 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:56:45,175 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 37 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 11:56:45,175 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 37 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 11:56:45,176 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 37 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 11:56:45,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:56:45,177 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2022-04-27 11:56:45,177 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2022-04-27 11:56:45,177 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:56:45,177 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:56:45,177 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 38 states. [2022-04-27 11:56:45,177 INFO L87 Difference]: Start difference. First operand has 37 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 38 states. [2022-04-27 11:56:45,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:56:45,178 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2022-04-27 11:56:45,178 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2022-04-27 11:56:45,179 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:56:45,179 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:56:45,179 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:56:45,179 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:56:45,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 11:56:45,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2022-04-27 11:56:45,180 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 28 [2022-04-27 11:56:45,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:56:45,180 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2022-04-27 11:56:45,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 11:56:45,180 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2022-04-27 11:56:45,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-27 11:56:45,181 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:56:45,181 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:56:45,198 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 11:56:45,383 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 11:56:45,383 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:56:45,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:56:45,384 INFO L85 PathProgramCache]: Analyzing trace with hash 694423764, now seen corresponding path program 1 times [2022-04-27 11:56:45,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:56:45,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672771905] [2022-04-27 11:56:45,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:56:45,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:56:45,404 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 11:56:45,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [76611747] [2022-04-27 11:56:45,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:56:45,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:56:45,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:56:45,406 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 11:56:45,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-27 11:56:45,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:56:45,443 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-27 11:56:45,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:56:45,456 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:56:45,569 INFO L272 TraceCheckUtils]: 0: Hoare triple {1563#true} call ULTIMATE.init(); {1563#true} is VALID [2022-04-27 11:56:45,569 INFO L290 TraceCheckUtils]: 1: Hoare triple {1563#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {1563#true} is VALID [2022-04-27 11:56:45,570 INFO L290 TraceCheckUtils]: 2: Hoare triple {1563#true} assume true; {1563#true} is VALID [2022-04-27 11:56:45,570 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1563#true} {1563#true} #76#return; {1563#true} is VALID [2022-04-27 11:56:45,570 INFO L272 TraceCheckUtils]: 4: Hoare triple {1563#true} call #t~ret6 := main(); {1563#true} is VALID [2022-04-27 11:56:45,570 INFO L290 TraceCheckUtils]: 5: Hoare triple {1563#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1563#true} is VALID [2022-04-27 11:56:45,570 INFO L272 TraceCheckUtils]: 6: Hoare triple {1563#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1563#true} is VALID [2022-04-27 11:56:45,570 INFO L290 TraceCheckUtils]: 7: Hoare triple {1563#true} ~cond := #in~cond; {1563#true} is VALID [2022-04-27 11:56:45,570 INFO L290 TraceCheckUtils]: 8: Hoare triple {1563#true} assume !(0 == ~cond); {1563#true} is VALID [2022-04-27 11:56:45,570 INFO L290 TraceCheckUtils]: 9: Hoare triple {1563#true} assume true; {1563#true} is VALID [2022-04-27 11:56:45,570 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1563#true} {1563#true} #68#return; {1563#true} is VALID [2022-04-27 11:56:45,570 INFO L290 TraceCheckUtils]: 11: Hoare triple {1563#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {1563#true} is VALID [2022-04-27 11:56:45,570 INFO L290 TraceCheckUtils]: 12: Hoare triple {1563#true} assume !false; {1563#true} is VALID [2022-04-27 11:56:45,570 INFO L272 TraceCheckUtils]: 13: Hoare triple {1563#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {1563#true} is VALID [2022-04-27 11:56:45,571 INFO L290 TraceCheckUtils]: 14: Hoare triple {1563#true} ~cond := #in~cond; {1563#true} is VALID [2022-04-27 11:56:45,571 INFO L290 TraceCheckUtils]: 15: Hoare triple {1563#true} assume !(0 == ~cond); {1563#true} is VALID [2022-04-27 11:56:45,571 INFO L290 TraceCheckUtils]: 16: Hoare triple {1563#true} assume true; {1563#true} is VALID [2022-04-27 11:56:45,571 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1563#true} {1563#true} #70#return; {1563#true} is VALID [2022-04-27 11:56:45,571 INFO L290 TraceCheckUtils]: 18: Hoare triple {1563#true} assume !!(0 != ~a~0 && 0 != ~b~0); {1622#(not (= main_~a~0 0))} is VALID [2022-04-27 11:56:45,571 INFO L290 TraceCheckUtils]: 19: Hoare triple {1622#(not (= main_~a~0 0))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {1622#(not (= main_~a~0 0))} is VALID [2022-04-27 11:56:45,572 INFO L290 TraceCheckUtils]: 20: Hoare triple {1622#(not (= main_~a~0 0))} assume !(1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {1622#(not (= main_~a~0 0))} is VALID [2022-04-27 11:56:45,577 INFO L290 TraceCheckUtils]: 21: Hoare triple {1622#(not (= main_~a~0 0))} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 1 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~b~0 := ~b~0 - 1;~q~0 := ~q~0 + ~a~0 * ~p~0; {1622#(not (= main_~a~0 0))} is VALID [2022-04-27 11:56:45,577 INFO L290 TraceCheckUtils]: 22: Hoare triple {1622#(not (= main_~a~0 0))} assume !false; {1622#(not (= main_~a~0 0))} is VALID [2022-04-27 11:56:45,577 INFO L272 TraceCheckUtils]: 23: Hoare triple {1622#(not (= main_~a~0 0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {1563#true} is VALID [2022-04-27 11:56:45,577 INFO L290 TraceCheckUtils]: 24: Hoare triple {1563#true} ~cond := #in~cond; {1563#true} is VALID [2022-04-27 11:56:45,577 INFO L290 TraceCheckUtils]: 25: Hoare triple {1563#true} assume !(0 == ~cond); {1563#true} is VALID [2022-04-27 11:56:45,577 INFO L290 TraceCheckUtils]: 26: Hoare triple {1563#true} assume true; {1563#true} is VALID [2022-04-27 11:56:45,578 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1563#true} {1622#(not (= main_~a~0 0))} #70#return; {1622#(not (= main_~a~0 0))} is VALID [2022-04-27 11:56:45,579 INFO L290 TraceCheckUtils]: 28: Hoare triple {1622#(not (= main_~a~0 0))} assume !(0 != ~a~0 && 0 != ~b~0); {1653#(and (= main_~b~0 0) (not (= main_~a~0 0)))} is VALID [2022-04-27 11:56:45,579 INFO L272 TraceCheckUtils]: 29: Hoare triple {1653#(and (= main_~b~0 0) (not (= main_~a~0 0)))} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {1563#true} is VALID [2022-04-27 11:56:45,579 INFO L290 TraceCheckUtils]: 30: Hoare triple {1563#true} ~cond := #in~cond; {1563#true} is VALID [2022-04-27 11:56:45,579 INFO L290 TraceCheckUtils]: 31: Hoare triple {1563#true} assume !(0 == ~cond); {1563#true} is VALID [2022-04-27 11:56:45,579 INFO L290 TraceCheckUtils]: 32: Hoare triple {1563#true} assume true; {1563#true} is VALID [2022-04-27 11:56:45,580 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {1563#true} {1653#(and (= main_~b~0 0) (not (= main_~a~0 0)))} #72#return; {1653#(and (= main_~b~0 0) (not (= main_~a~0 0)))} is VALID [2022-04-27 11:56:45,584 INFO L272 TraceCheckUtils]: 34: Hoare triple {1653#(and (= main_~b~0 0) (not (= main_~a~0 0)))} call __VERIFIER_assert((if 0 == ~a~0 * ~b~0 then 1 else 0)); {1672#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:56:45,584 INFO L290 TraceCheckUtils]: 35: Hoare triple {1672#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1676#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:56:45,584 INFO L290 TraceCheckUtils]: 36: Hoare triple {1676#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1564#false} is VALID [2022-04-27 11:56:45,584 INFO L290 TraceCheckUtils]: 37: Hoare triple {1564#false} assume !false; {1564#false} is VALID [2022-04-27 11:56:45,585 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-27 11:56:45,585 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 11:56:45,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:56:45,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672771905] [2022-04-27 11:56:45,585 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 11:56:45,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [76611747] [2022-04-27 11:56:45,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [76611747] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 11:56:45,585 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 11:56:45,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 11:56:45,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111947185] [2022-04-27 11:56:45,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 11:56:45,586 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 38 [2022-04-27 11:56:45,586 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:56:45,586 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-27 11:56:45,617 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:56:45,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 11:56:45,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:56:45,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 11:56:45,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-27 11:56:45,619 INFO L87 Difference]: Start difference. First operand 37 states and 43 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-27 11:56:45,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:56:45,790 INFO L93 Difference]: Finished difference Result 49 states and 58 transitions. [2022-04-27 11:56:45,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 11:56:45,790 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 38 [2022-04-27 11:56:45,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:56:45,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-27 11:56:45,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 42 transitions. [2022-04-27 11:56:45,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-27 11:56:45,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 42 transitions. [2022-04-27 11:56:45,792 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 42 transitions. [2022-04-27 11:56:45,825 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:56:45,826 INFO L225 Difference]: With dead ends: 49 [2022-04-27 11:56:45,826 INFO L226 Difference]: Without dead ends: 43 [2022-04-27 11:56:45,826 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-04-27 11:56:45,827 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 2 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 11:56:45,827 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 100 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 11:56:45,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-27 11:56:45,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 40. [2022-04-27 11:56:45,854 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:56:45,854 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 40 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 11:56:45,854 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 40 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 11:56:45,854 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 40 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 11:56:45,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:56:45,855 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2022-04-27 11:56:45,856 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2022-04-27 11:56:45,856 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:56:45,856 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:56:45,856 INFO L74 IsIncluded]: Start isIncluded. First operand has 40 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 43 states. [2022-04-27 11:56:45,856 INFO L87 Difference]: Start difference. First operand has 40 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 43 states. [2022-04-27 11:56:45,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:56:45,857 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2022-04-27 11:56:45,857 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2022-04-27 11:56:45,857 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:56:45,857 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:56:45,857 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:56:45,858 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:56:45,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 11:56:45,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 47 transitions. [2022-04-27 11:56:45,859 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 47 transitions. Word has length 38 [2022-04-27 11:56:45,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:56:45,859 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 47 transitions. [2022-04-27 11:56:45,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-27 11:56:45,859 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2022-04-27 11:56:45,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-27 11:56:45,859 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:56:45,860 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:56:45,876 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-04-27 11:56:46,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:56:46,068 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:56:46,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:56:46,068 INFO L85 PathProgramCache]: Analyzing trace with hash -893924138, now seen corresponding path program 1 times [2022-04-27 11:56:46,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:56:46,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368083573] [2022-04-27 11:56:46,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:56:46,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:56:46,085 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 11:56:46,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [625582261] [2022-04-27 11:56:46,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:56:46,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:56:46,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:56:46,092 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 11:56:46,092 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-27 11:56:46,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:56:46,125 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-27 11:56:46,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:56:46,136 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:56:46,345 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-27 11:56:46,379 INFO L272 TraceCheckUtils]: 0: Hoare triple {1898#true} call ULTIMATE.init(); {1898#true} is VALID [2022-04-27 11:56:46,379 INFO L290 TraceCheckUtils]: 1: Hoare triple {1898#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {1898#true} is VALID [2022-04-27 11:56:46,379 INFO L290 TraceCheckUtils]: 2: Hoare triple {1898#true} assume true; {1898#true} is VALID [2022-04-27 11:56:46,379 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1898#true} {1898#true} #76#return; {1898#true} is VALID [2022-04-27 11:56:46,379 INFO L272 TraceCheckUtils]: 4: Hoare triple {1898#true} call #t~ret6 := main(); {1898#true} is VALID [2022-04-27 11:56:46,379 INFO L290 TraceCheckUtils]: 5: Hoare triple {1898#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1898#true} is VALID [2022-04-27 11:56:46,380 INFO L272 TraceCheckUtils]: 6: Hoare triple {1898#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1898#true} is VALID [2022-04-27 11:56:46,380 INFO L290 TraceCheckUtils]: 7: Hoare triple {1898#true} ~cond := #in~cond; {1924#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 11:56:46,380 INFO L290 TraceCheckUtils]: 8: Hoare triple {1924#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1928#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 11:56:46,381 INFO L290 TraceCheckUtils]: 9: Hoare triple {1928#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1928#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 11:56:46,381 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1928#(not (= |assume_abort_if_not_#in~cond| 0))} {1898#true} #68#return; {1935#(<= 1 main_~y~0)} is VALID [2022-04-27 11:56:46,382 INFO L290 TraceCheckUtils]: 11: Hoare triple {1935#(<= 1 main_~y~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {1939#(<= 1 main_~b~0)} is VALID [2022-04-27 11:56:46,382 INFO L290 TraceCheckUtils]: 12: Hoare triple {1939#(<= 1 main_~b~0)} assume !false; {1939#(<= 1 main_~b~0)} is VALID [2022-04-27 11:56:46,382 INFO L272 TraceCheckUtils]: 13: Hoare triple {1939#(<= 1 main_~b~0)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {1898#true} is VALID [2022-04-27 11:56:46,382 INFO L290 TraceCheckUtils]: 14: Hoare triple {1898#true} ~cond := #in~cond; {1898#true} is VALID [2022-04-27 11:56:46,382 INFO L290 TraceCheckUtils]: 15: Hoare triple {1898#true} assume !(0 == ~cond); {1898#true} is VALID [2022-04-27 11:56:46,383 INFO L290 TraceCheckUtils]: 16: Hoare triple {1898#true} assume true; {1898#true} is VALID [2022-04-27 11:56:46,384 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1898#true} {1939#(<= 1 main_~b~0)} #70#return; {1939#(<= 1 main_~b~0)} is VALID [2022-04-27 11:56:46,384 INFO L290 TraceCheckUtils]: 18: Hoare triple {1939#(<= 1 main_~b~0)} assume !!(0 != ~a~0 && 0 != ~b~0); {1939#(<= 1 main_~b~0)} is VALID [2022-04-27 11:56:46,384 INFO L290 TraceCheckUtils]: 19: Hoare triple {1939#(<= 1 main_~b~0)} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {1939#(<= 1 main_~b~0)} is VALID [2022-04-27 11:56:46,384 INFO L290 TraceCheckUtils]: 20: Hoare triple {1939#(<= 1 main_~b~0)} assume !(1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {1939#(<= 1 main_~b~0)} is VALID [2022-04-27 11:56:46,385 INFO L290 TraceCheckUtils]: 21: Hoare triple {1939#(<= 1 main_~b~0)} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 1 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2));~a~0 := ~a~0 - 1;~b~0 := ~b~0 - 1;~q~0 := ~q~0 + (1 + (~a~0 + ~b~0)) * ~p~0; {1970#(<= 0 main_~b~0)} is VALID [2022-04-27 11:56:46,386 INFO L290 TraceCheckUtils]: 22: Hoare triple {1970#(<= 0 main_~b~0)} assume !false; {1970#(<= 0 main_~b~0)} is VALID [2022-04-27 11:56:46,386 INFO L272 TraceCheckUtils]: 23: Hoare triple {1970#(<= 0 main_~b~0)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {1898#true} is VALID [2022-04-27 11:56:46,386 INFO L290 TraceCheckUtils]: 24: Hoare triple {1898#true} ~cond := #in~cond; {1898#true} is VALID [2022-04-27 11:56:46,386 INFO L290 TraceCheckUtils]: 25: Hoare triple {1898#true} assume !(0 == ~cond); {1898#true} is VALID [2022-04-27 11:56:46,386 INFO L290 TraceCheckUtils]: 26: Hoare triple {1898#true} assume true; {1898#true} is VALID [2022-04-27 11:56:46,387 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1898#true} {1970#(<= 0 main_~b~0)} #70#return; {1970#(<= 0 main_~b~0)} is VALID [2022-04-27 11:56:46,387 INFO L290 TraceCheckUtils]: 28: Hoare triple {1970#(<= 0 main_~b~0)} assume !(0 != ~a~0 && 0 != ~b~0); {1992#(and (or (= main_~a~0 0) (= main_~b~0 0)) (<= 0 main_~b~0))} is VALID [2022-04-27 11:56:46,388 INFO L272 TraceCheckUtils]: 29: Hoare triple {1992#(and (or (= main_~a~0 0) (= main_~b~0 0)) (<= 0 main_~b~0))} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {1898#true} is VALID [2022-04-27 11:56:46,388 INFO L290 TraceCheckUtils]: 30: Hoare triple {1898#true} ~cond := #in~cond; {1898#true} is VALID [2022-04-27 11:56:46,388 INFO L290 TraceCheckUtils]: 31: Hoare triple {1898#true} assume !(0 == ~cond); {1898#true} is VALID [2022-04-27 11:56:46,388 INFO L290 TraceCheckUtils]: 32: Hoare triple {1898#true} assume true; {1898#true} is VALID [2022-04-27 11:56:46,388 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {1898#true} {1992#(and (or (= main_~a~0 0) (= main_~b~0 0)) (<= 0 main_~b~0))} #72#return; {1992#(and (or (= main_~a~0 0) (= main_~b~0 0)) (<= 0 main_~b~0))} is VALID [2022-04-27 11:56:46,390 INFO L272 TraceCheckUtils]: 34: Hoare triple {1992#(and (or (= main_~a~0 0) (= main_~b~0 0)) (<= 0 main_~b~0))} call __VERIFIER_assert((if 0 == ~a~0 * ~b~0 then 1 else 0)); {2011#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:56:46,390 INFO L290 TraceCheckUtils]: 35: Hoare triple {2011#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2015#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:56:46,392 INFO L290 TraceCheckUtils]: 36: Hoare triple {2015#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1899#false} is VALID [2022-04-27 11:56:46,392 INFO L290 TraceCheckUtils]: 37: Hoare triple {1899#false} assume !false; {1899#false} is VALID [2022-04-27 11:56:46,393 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-27 11:56:46,393 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:56:46,615 INFO L290 TraceCheckUtils]: 37: Hoare triple {1899#false} assume !false; {1899#false} is VALID [2022-04-27 11:56:46,615 INFO L290 TraceCheckUtils]: 36: Hoare triple {2015#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1899#false} is VALID [2022-04-27 11:56:46,623 INFO L290 TraceCheckUtils]: 35: Hoare triple {2011#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2015#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:56:46,625 INFO L272 TraceCheckUtils]: 34: Hoare triple {2031#(= (* main_~b~0 main_~a~0) 0)} call __VERIFIER_assert((if 0 == ~a~0 * ~b~0 then 1 else 0)); {2011#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:56:46,626 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {1898#true} {2031#(= (* main_~b~0 main_~a~0) 0)} #72#return; {2031#(= (* main_~b~0 main_~a~0) 0)} is VALID [2022-04-27 11:56:46,628 INFO L290 TraceCheckUtils]: 32: Hoare triple {1898#true} assume true; {1898#true} is VALID [2022-04-27 11:56:46,629 INFO L290 TraceCheckUtils]: 31: Hoare triple {1898#true} assume !(0 == ~cond); {1898#true} is VALID [2022-04-27 11:56:46,629 INFO L290 TraceCheckUtils]: 30: Hoare triple {1898#true} ~cond := #in~cond; {1898#true} is VALID [2022-04-27 11:56:46,629 INFO L272 TraceCheckUtils]: 29: Hoare triple {2031#(= (* main_~b~0 main_~a~0) 0)} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {1898#true} is VALID [2022-04-27 11:56:46,630 INFO L290 TraceCheckUtils]: 28: Hoare triple {1898#true} assume !(0 != ~a~0 && 0 != ~b~0); {2031#(= (* main_~b~0 main_~a~0) 0)} is VALID [2022-04-27 11:56:46,631 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1898#true} {1898#true} #70#return; {1898#true} is VALID [2022-04-27 11:56:46,631 INFO L290 TraceCheckUtils]: 26: Hoare triple {1898#true} assume true; {1898#true} is VALID [2022-04-27 11:56:46,632 INFO L290 TraceCheckUtils]: 25: Hoare triple {1898#true} assume !(0 == ~cond); {1898#true} is VALID [2022-04-27 11:56:46,632 INFO L290 TraceCheckUtils]: 24: Hoare triple {1898#true} ~cond := #in~cond; {1898#true} is VALID [2022-04-27 11:56:46,632 INFO L272 TraceCheckUtils]: 23: Hoare triple {1898#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {1898#true} is VALID [2022-04-27 11:56:46,632 INFO L290 TraceCheckUtils]: 22: Hoare triple {1898#true} assume !false; {1898#true} is VALID [2022-04-27 11:56:46,632 INFO L290 TraceCheckUtils]: 21: Hoare triple {1898#true} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 1 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2));~a~0 := ~a~0 - 1;~b~0 := ~b~0 - 1;~q~0 := ~q~0 + (1 + (~a~0 + ~b~0)) * ~p~0; {1898#true} is VALID [2022-04-27 11:56:46,632 INFO L290 TraceCheckUtils]: 20: Hoare triple {1898#true} assume !(1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {1898#true} is VALID [2022-04-27 11:56:46,632 INFO L290 TraceCheckUtils]: 19: Hoare triple {1898#true} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {1898#true} is VALID [2022-04-27 11:56:46,632 INFO L290 TraceCheckUtils]: 18: Hoare triple {1898#true} assume !!(0 != ~a~0 && 0 != ~b~0); {1898#true} is VALID [2022-04-27 11:56:46,632 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1898#true} {1898#true} #70#return; {1898#true} is VALID [2022-04-27 11:56:46,632 INFO L290 TraceCheckUtils]: 16: Hoare triple {1898#true} assume true; {1898#true} is VALID [2022-04-27 11:56:46,632 INFO L290 TraceCheckUtils]: 15: Hoare triple {1898#true} assume !(0 == ~cond); {1898#true} is VALID [2022-04-27 11:56:46,632 INFO L290 TraceCheckUtils]: 14: Hoare triple {1898#true} ~cond := #in~cond; {1898#true} is VALID [2022-04-27 11:56:46,633 INFO L272 TraceCheckUtils]: 13: Hoare triple {1898#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {1898#true} is VALID [2022-04-27 11:56:46,633 INFO L290 TraceCheckUtils]: 12: Hoare triple {1898#true} assume !false; {1898#true} is VALID [2022-04-27 11:56:46,633 INFO L290 TraceCheckUtils]: 11: Hoare triple {1898#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {1898#true} is VALID [2022-04-27 11:56:46,633 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1898#true} {1898#true} #68#return; {1898#true} is VALID [2022-04-27 11:56:46,633 INFO L290 TraceCheckUtils]: 9: Hoare triple {1898#true} assume true; {1898#true} is VALID [2022-04-27 11:56:46,633 INFO L290 TraceCheckUtils]: 8: Hoare triple {1898#true} assume !(0 == ~cond); {1898#true} is VALID [2022-04-27 11:56:46,633 INFO L290 TraceCheckUtils]: 7: Hoare triple {1898#true} ~cond := #in~cond; {1898#true} is VALID [2022-04-27 11:56:46,633 INFO L272 TraceCheckUtils]: 6: Hoare triple {1898#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1898#true} is VALID [2022-04-27 11:56:46,633 INFO L290 TraceCheckUtils]: 5: Hoare triple {1898#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1898#true} is VALID [2022-04-27 11:56:46,633 INFO L272 TraceCheckUtils]: 4: Hoare triple {1898#true} call #t~ret6 := main(); {1898#true} is VALID [2022-04-27 11:56:46,633 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1898#true} {1898#true} #76#return; {1898#true} is VALID [2022-04-27 11:56:46,633 INFO L290 TraceCheckUtils]: 2: Hoare triple {1898#true} assume true; {1898#true} is VALID [2022-04-27 11:56:46,633 INFO L290 TraceCheckUtils]: 1: Hoare triple {1898#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {1898#true} is VALID [2022-04-27 11:56:46,634 INFO L272 TraceCheckUtils]: 0: Hoare triple {1898#true} call ULTIMATE.init(); {1898#true} is VALID [2022-04-27 11:56:46,634 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-27 11:56:46,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:56:46,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368083573] [2022-04-27 11:56:46,634 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 11:56:46,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [625582261] [2022-04-27 11:56:46,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [625582261] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 11:56:46,634 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 11:56:46,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 11 [2022-04-27 11:56:46,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975040735] [2022-04-27 11:56:46,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 11:56:46,635 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 38 [2022-04-27 11:56:46,635 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:56:46,635 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 11:56:46,655 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:56:46,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 11:56:46,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:56:46,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 11:56:46,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-04-27 11:56:46,656 INFO L87 Difference]: Start difference. First operand 40 states and 47 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 11:56:46,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:56:46,973 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2022-04-27 11:56:46,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 11:56:46,973 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 38 [2022-04-27 11:56:46,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:56:46,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 11:56:46,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-27 11:56:46,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 11:56:46,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-27 11:56:46,975 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 32 transitions. [2022-04-27 11:56:46,997 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:56:46,998 INFO L225 Difference]: With dead ends: 40 [2022-04-27 11:56:46,998 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 11:56:46,998 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-04-27 11:56:46,999 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 1 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 11:56:46,999 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 96 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 11:56:46,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 11:56:46,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 11:56:46,999 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:56:46,999 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 11:56:47,000 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 11:56:47,000 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 11:56:47,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:56:47,000 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 11:56:47,000 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 11:56:47,000 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:56:47,000 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:56:47,000 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 11:56:47,000 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 11:56:47,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:56:47,000 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 11:56:47,000 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 11:56:47,000 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:56:47,000 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:56:47,000 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:56:47,000 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:56:47,001 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 11:56:47,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 11:56:47,001 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 38 [2022-04-27 11:56:47,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:56:47,001 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 11:56:47,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 11:56:47,001 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 11:56:47,001 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:56:47,003 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 11:56:47,042 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-27 11:56:47,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:56:47,205 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-27 11:57:00,192 WARN L232 SmtUtils]: Spent 12.62s on a formula simplification. DAG size of input: 66 DAG size of output: 13 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-27 11:57:08,361 WARN L232 SmtUtils]: Spent 8.16s on a formula simplification. DAG size of input: 66 DAG size of output: 13 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-27 11:57:08,365 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 5) no Hoare annotation was computed. [2022-04-27 11:57:08,365 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 5) no Hoare annotation was computed. [2022-04-27 11:57:08,365 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 5) no Hoare annotation was computed. [2022-04-27 11:57:08,365 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 8 10) the Hoare annotation is: true [2022-04-27 11:57:08,365 INFO L899 garLoopResultBuilder]: For program point L9(line 9) no Hoare annotation was computed. [2022-04-27 11:57:08,365 INFO L899 garLoopResultBuilder]: For program point L9-2(lines 8 10) no Hoare annotation was computed. [2022-04-27 11:57:08,365 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 8 10) no Hoare annotation was computed. [2022-04-27 11:57:08,365 INFO L895 garLoopResultBuilder]: At program point L33(line 33) the Hoare annotation is: (and (= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0)) (<= 1 main_~y~0)) [2022-04-27 11:57:08,365 INFO L899 garLoopResultBuilder]: For program point L33-1(lines 32 53) no Hoare annotation was computed. [2022-04-27 11:57:08,366 INFO L902 garLoopResultBuilder]: At program point L25(line 25) the Hoare annotation is: true [2022-04-27 11:57:08,366 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 19 58) no Hoare annotation was computed. [2022-04-27 11:57:08,366 INFO L899 garLoopResultBuilder]: For program point L25-1(line 25) no Hoare annotation was computed. [2022-04-27 11:57:08,366 INFO L899 garLoopResultBuilder]: For program point L56(line 56) no Hoare annotation was computed. [2022-04-27 11:57:08,366 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 19 58) no Hoare annotation was computed. [2022-04-27 11:57:08,366 INFO L899 garLoopResultBuilder]: For program point L42(lines 42 52) no Hoare annotation was computed. [2022-04-27 11:57:08,366 INFO L899 garLoopResultBuilder]: For program point L38(lines 38 52) no Hoare annotation was computed. [2022-04-27 11:57:08,366 INFO L895 garLoopResultBuilder]: At program point L32-2(lines 32 53) the Hoare annotation is: (and (= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0)) (<= 1 main_~y~0) (= (* main_~b~0 main_~a~0) 0)) [2022-04-27 11:57:08,366 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 19 58) the Hoare annotation is: true [2022-04-27 11:57:08,366 INFO L895 garLoopResultBuilder]: At program point L55(line 55) the Hoare annotation is: (and (= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0)) (<= 1 main_~y~0) (= (* main_~b~0 main_~a~0) 0)) [2022-04-27 11:57:08,366 INFO L899 garLoopResultBuilder]: For program point L45(lines 45 52) no Hoare annotation was computed. [2022-04-27 11:57:08,366 INFO L895 garLoopResultBuilder]: At program point L45-2(lines 32 53) the Hoare annotation is: (and (= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0)) (<= 1 main_~y~0)) [2022-04-27 11:57:08,366 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-27 11:57:08,366 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-27 11:57:08,366 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-27 11:57:08,366 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-27 11:57:08,366 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-27 11:57:08,366 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-27 11:57:08,366 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-27 11:57:08,367 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 11 17) the Hoare annotation is: true [2022-04-27 11:57:08,367 INFO L899 garLoopResultBuilder]: For program point L13(lines 13 14) no Hoare annotation was computed. [2022-04-27 11:57:08,367 INFO L899 garLoopResultBuilder]: For program point L12(lines 12 15) no Hoare annotation was computed. [2022-04-27 11:57:08,367 INFO L899 garLoopResultBuilder]: For program point L12-2(lines 11 17) no Hoare annotation was computed. [2022-04-27 11:57:08,367 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 11 17) no Hoare annotation was computed. [2022-04-27 11:57:08,367 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 14) no Hoare annotation was computed. [2022-04-27 11:57:08,369 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:57:08,370 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 11:57:08,373 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 11:57:08,373 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 11:57:08,374 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-27 11:57:08,374 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-27 11:57:08,374 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-27 11:57:08,374 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 11:57:08,374 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 11:57:08,374 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-27 11:57:08,374 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-27 11:57:08,374 WARN L170 areAnnotationChecker]: L25-1 has no Hoare annotation [2022-04-27 11:57:08,374 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-27 11:57:08,374 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-27 11:57:08,374 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 11:57:08,374 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 11:57:08,374 WARN L170 areAnnotationChecker]: L9-2 has no Hoare annotation [2022-04-27 11:57:08,374 WARN L170 areAnnotationChecker]: L25-1 has no Hoare annotation [2022-04-27 11:57:08,374 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-27 11:57:08,374 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-27 11:57:08,374 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2022-04-27 11:57:08,374 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-27 11:57:08,376 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 11:57:08,377 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 11:57:08,377 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 11:57:08,377 WARN L170 areAnnotationChecker]: L33-1 has no Hoare annotation [2022-04-27 11:57:08,377 WARN L170 areAnnotationChecker]: L33-1 has no Hoare annotation [2022-04-27 11:57:08,377 WARN L170 areAnnotationChecker]: L33-1 has no Hoare annotation [2022-04-27 11:57:08,377 WARN L170 areAnnotationChecker]: L56 has no Hoare annotation [2022-04-27 11:57:08,377 WARN L170 areAnnotationChecker]: L56 has no Hoare annotation [2022-04-27 11:57:08,377 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-04-27 11:57:08,377 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-04-27 11:57:08,377 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 11:57:08,377 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2022-04-27 11:57:08,377 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2022-04-27 11:57:08,377 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 11:57:08,377 WARN L170 areAnnotationChecker]: L45 has no Hoare annotation [2022-04-27 11:57:08,377 WARN L170 areAnnotationChecker]: L45 has no Hoare annotation [2022-04-27 11:57:08,377 INFO L163 areAnnotationChecker]: CFG has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 11:57:08,385 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 11:57:08 BoogieIcfgContainer [2022-04-27 11:57:08,385 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 11:57:08,386 INFO L158 Benchmark]: Toolchain (without parser) took 157603.34ms. Allocated memory was 181.4MB in the beginning and 218.1MB in the end (delta: 36.7MB). Free memory was 128.5MB in the beginning and 115.0MB in the end (delta: 13.5MB). Peak memory consumption was 94.9MB. Max. memory is 8.0GB. [2022-04-27 11:57:08,387 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 181.4MB. Free memory was 145.0MB in the beginning and 144.9MB in the end (delta: 151.8kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 11:57:08,387 INFO L158 Benchmark]: CACSL2BoogieTranslator took 181.62ms. Allocated memory is still 181.4MB. Free memory was 128.2MB in the beginning and 155.2MB in the end (delta: -27.0MB). Peak memory consumption was 12.5MB. Max. memory is 8.0GB. [2022-04-27 11:57:08,387 INFO L158 Benchmark]: Boogie Preprocessor took 33.43ms. Allocated memory is still 181.4MB. Free memory was 155.2MB in the beginning and 153.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 11:57:08,387 INFO L158 Benchmark]: RCFGBuilder took 305.36ms. Allocated memory is still 181.4MB. Free memory was 153.5MB in the beginning and 141.4MB in the end (delta: 12.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-27 11:57:08,387 INFO L158 Benchmark]: TraceAbstraction took 157077.94ms. Allocated memory was 181.4MB in the beginning and 218.1MB in the end (delta: 36.7MB). Free memory was 140.5MB in the beginning and 115.6MB in the end (delta: 25.0MB). Peak memory consumption was 107.6MB. Max. memory is 8.0GB. [2022-04-27 11:57:08,389 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.11ms. Allocated memory is still 181.4MB. Free memory was 145.0MB in the beginning and 144.9MB in the end (delta: 151.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 181.62ms. Allocated memory is still 181.4MB. Free memory was 128.2MB in the beginning and 155.2MB in the end (delta: -27.0MB). Peak memory consumption was 12.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 33.43ms. Allocated memory is still 181.4MB. Free memory was 155.2MB in the beginning and 153.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 305.36ms. Allocated memory is still 181.4MB. Free memory was 153.5MB in the beginning and 141.4MB in the end (delta: 12.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 157077.94ms. Allocated memory was 181.4MB in the beginning and 218.1MB in the end (delta: 36.7MB). Free memory was 140.5MB in the beginning and 115.6MB in the end (delta: 25.0MB). Peak memory consumption was 107.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 14]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 34 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 157.0s, OverallIterations: 7, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 17.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 21.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 3 mSolverCounterUnknown, 183 SdHoareTripleChecker+Valid, 10.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 168 mSDsluCounter, 702 SdHoareTripleChecker+Invalid, 10.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 531 mSDsCounter, 118 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 829 IncrementalHoareTripleChecker+Invalid, 950 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 118 mSolverCounterUnsat, 171 mSDtfsCounter, 829 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 274 GetRequests, 202 SyntacticMatches, 3 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=40occurred in iteration=6, InterpolantAutomatonStates: 57, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 56 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 11 LocationsWithAnnotation, 22 PreInvPairs, 34 NumberOfFragments, 79 HoareAnnotationTreeSize, 22 FomulaSimplifications, 56 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 11 FomulaSimplificationsInter, 2248 FormulaSimplificationTreeSizeReductionInter, 21.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 113.9s InterpolantComputationTime, 186 NumberOfCodeBlocks, 186 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 262 ConstructedInterpolants, 0 QuantifiedInterpolants, 974 SizeOfPredicates, 22 NumberOfNonLiveVariables, 576 ConjunctsInSsa, 91 ConjunctsInUnsatCore, 10 InterpolantComputations, 5 PerfectInterpolantSequences, 72/83 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: 32]: Loop Invariant Derived loop invariant: q + b * a * p == y * x && 1 <= y RESULT: Ultimate proved your program to be correct! [2022-04-27 11:57:08,433 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...