/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/prodbin-ll_valuebound100.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 14:27:37,844 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 14:27:37,845 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 14:27:37,882 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 14:27:37,883 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 14:27:37,884 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 14:27:37,886 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 14:27:37,890 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 14:27:37,891 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 14:27:37,892 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 14:27:37,893 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 14:27:37,893 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 14:27:37,894 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 14:27:37,894 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 14:27:37,895 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 14:27:37,895 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 14:27:37,896 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 14:27:37,896 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 14:27:37,897 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 14:27:37,898 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 14:27:37,899 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 14:27:37,902 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 14:27:37,903 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 14:27:37,904 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 14:27:37,904 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 14:27:37,906 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 14:27:37,906 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 14:27:37,906 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 14:27:37,907 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 14:27:37,907 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 14:27:37,908 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 14:27:37,908 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 14:27:37,908 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 14:27:37,909 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 14:27:37,909 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 14:27:37,910 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 14:27:37,910 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 14:27:37,910 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 14:27:37,910 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 14:27:37,911 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 14:27:37,911 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 14:27:37,916 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 14:27:37,916 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-27 14:27:37,930 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 14:27:37,930 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 14:27:37,931 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 14:27:37,931 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 14:27:37,935 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 14:27:37,935 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 14:27:37,936 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 14:27:37,936 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 14:27:37,936 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 14:27:37,937 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 14:27:37,937 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 14:27:37,937 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 14:27:37,937 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 14:27:37,937 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 14:27:37,937 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 14:27:37,937 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 14:27:37,938 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 14:27:37,938 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 14:27:37,938 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 14:27:37,938 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 14:27:37,938 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 14:27:37,938 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 14:27:37,938 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 14:27:37,938 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 14:27:37,939 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 14:27:37,939 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 14:27:37,939 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 14:27:37,939 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 14:27:37,939 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 14:27:37,939 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 14:27:37,939 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 14:27:37,940 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 14:27:37,940 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 14:27:37,940 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 14:27:38,114 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 14:27:38,134 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 14:27:38,136 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 14:27:38,136 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 14:27:38,137 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 14:27:38,138 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/prodbin-ll_valuebound100.c [2022-04-27 14:27:38,188 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f3aeb3b6/5799bed46c0c4e74b11ef1ac97f1516e/FLAGafb50fbf8 [2022-04-27 14:27:38,545 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 14:27:38,545 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/prodbin-ll_valuebound100.c [2022-04-27 14:27:38,556 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f3aeb3b6/5799bed46c0c4e74b11ef1ac97f1516e/FLAGafb50fbf8 [2022-04-27 14:27:38,569 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f3aeb3b6/5799bed46c0c4e74b11ef1ac97f1516e [2022-04-27 14:27:38,571 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 14:27:38,573 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 14:27:38,576 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 14:27:38,576 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 14:27:38,578 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 14:27:38,579 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 02:27:38" (1/1) ... [2022-04-27 14:27:38,579 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ade164e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:27:38, skipping insertion in model container [2022-04-27 14:27:38,579 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 02:27:38" (1/1) ... [2022-04-27 14:27:38,584 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 14:27:38,595 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 14:27:38,749 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/prodbin-ll_valuebound100.c[537,550] [2022-04-27 14:27:38,770 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 14:27:38,776 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 14:27:38,786 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/prodbin-ll_valuebound100.c[537,550] [2022-04-27 14:27:38,801 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 14:27:38,812 INFO L208 MainTranslator]: Completed translation [2022-04-27 14:27:38,812 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:27:38 WrapperNode [2022-04-27 14:27:38,812 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 14:27:38,813 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 14:27:38,813 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 14:27:38,813 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 14:27:38,819 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:27:38" (1/1) ... [2022-04-27 14:27:38,820 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:27:38" (1/1) ... [2022-04-27 14:27:38,824 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:27:38" (1/1) ... [2022-04-27 14:27:38,824 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:27:38" (1/1) ... [2022-04-27 14:27:38,829 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:27:38" (1/1) ... [2022-04-27 14:27:38,831 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:27:38" (1/1) ... [2022-04-27 14:27:38,833 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:27:38" (1/1) ... [2022-04-27 14:27:38,836 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 14:27:38,837 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 14:27:38,837 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 14:27:38,837 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 14:27:38,838 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:27:38" (1/1) ... [2022-04-27 14:27:38,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 14:27:38,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:27:38,858 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-27 14:27:38,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-27 14:27:38,892 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 14:27:38,892 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 14:27:38,892 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 14:27:38,893 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 14:27:38,893 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 14:27:38,894 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 14:27:38,894 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 14:27:38,894 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 14:27:38,894 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 14:27:38,894 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 14:27:38,894 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 14:27:38,894 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 14:27:38,897 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 14:27:38,897 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 14:27:38,897 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 14:27:38,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 14:27:38,897 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 14:27:38,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 14:27:38,897 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 14:27:38,897 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 14:27:38,941 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 14:27:38,943 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 14:27:39,097 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 14:27:39,102 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 14:27:39,102 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 14:27:39,103 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 02:27:39 BoogieIcfgContainer [2022-04-27 14:27:39,103 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 14:27:39,104 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 14:27:39,104 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 14:27:39,119 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 14:27:39,119 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 02:27:38" (1/3) ... [2022-04-27 14:27:39,120 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@717da1b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 02:27:39, skipping insertion in model container [2022-04-27 14:27:39,120 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:27:38" (2/3) ... [2022-04-27 14:27:39,120 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@717da1b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 02:27:39, skipping insertion in model container [2022-04-27 14:27:39,120 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 02:27:39" (3/3) ... [2022-04-27 14:27:39,121 INFO L111 eAbstractionObserver]: Analyzing ICFG prodbin-ll_valuebound100.c [2022-04-27 14:27:39,129 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 14:27:39,129 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 14:27:39,157 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 14:27:39,161 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@1feee78d, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1a8c6c1 [2022-04-27 14:27:39,162 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 14:27:39,166 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 14:27:39,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-27 14:27:39,171 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:27:39,171 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:27:39,172 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:27:39,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:27:39,175 INFO L85 PathProgramCache]: Analyzing trace with hash -589322634, now seen corresponding path program 1 times [2022-04-27 14:27:39,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:27:39,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867173607] [2022-04-27 14:27:39,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:27:39,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:27:39,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:27:39,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 14:27:39,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:27:39,349 INFO L290 TraceCheckUtils]: 0: Hoare triple {52#(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); {35#true} is VALID [2022-04-27 14:27:39,349 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume true; {35#true} is VALID [2022-04-27 14:27:39,349 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {35#true} {35#true} #71#return; {35#true} is VALID [2022-04-27 14:27:39,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 14:27:39,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:27:39,369 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-27 14:27:39,370 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-27 14:27:39,370 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-27 14:27:39,370 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#false} {35#true} #61#return; {36#false} is VALID [2022-04-27 14:27:39,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-27 14:27:39,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:27:39,376 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-27 14:27:39,376 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-27 14:27:39,377 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-27 14:27:39,377 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#false} {36#false} #63#return; {36#false} is VALID [2022-04-27 14:27:39,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-27 14:27:39,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:27:39,381 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-27 14:27:39,382 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-27 14:27:39,382 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-27 14:27:39,382 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#false} {36#false} #65#return; {36#false} is VALID [2022-04-27 14:27:39,383 INFO L272 TraceCheckUtils]: 0: Hoare triple {35#true} call ULTIMATE.init(); {52#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 14:27:39,383 INFO L290 TraceCheckUtils]: 1: Hoare triple {52#(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); {35#true} is VALID [2022-04-27 14:27:39,383 INFO L290 TraceCheckUtils]: 2: Hoare triple {35#true} assume true; {35#true} is VALID [2022-04-27 14:27:39,383 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35#true} {35#true} #71#return; {35#true} is VALID [2022-04-27 14:27:39,384 INFO L272 TraceCheckUtils]: 4: Hoare triple {35#true} call #t~ret6 := main(); {35#true} is VALID [2022-04-27 14:27:39,384 INFO L290 TraceCheckUtils]: 5: Hoare triple {35#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4; {35#true} is VALID [2022-04-27 14:27:39,384 INFO L272 TraceCheckUtils]: 6: Hoare triple {35#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 100 then 1 else 0)); {35#true} is VALID [2022-04-27 14:27:39,384 INFO L290 TraceCheckUtils]: 7: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-27 14:27:39,384 INFO L290 TraceCheckUtils]: 8: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-27 14:27:39,385 INFO L290 TraceCheckUtils]: 9: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-27 14:27:39,385 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {36#false} {35#true} #61#return; {36#false} is VALID [2022-04-27 14:27:39,385 INFO L290 TraceCheckUtils]: 11: Hoare triple {36#false} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {36#false} is VALID [2022-04-27 14:27:39,385 INFO L272 TraceCheckUtils]: 12: Hoare triple {36#false} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 100 then 1 else 0)); {35#true} is VALID [2022-04-27 14:27:39,385 INFO L290 TraceCheckUtils]: 13: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-27 14:27:39,388 INFO L290 TraceCheckUtils]: 14: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-27 14:27:39,388 INFO L290 TraceCheckUtils]: 15: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-27 14:27:39,388 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {36#false} {36#false} #63#return; {36#false} is VALID [2022-04-27 14:27:39,388 INFO L272 TraceCheckUtils]: 17: Hoare triple {36#false} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {35#true} is VALID [2022-04-27 14:27:39,388 INFO L290 TraceCheckUtils]: 18: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-27 14:27:39,389 INFO L290 TraceCheckUtils]: 19: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-27 14:27:39,389 INFO L290 TraceCheckUtils]: 20: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-27 14:27:39,389 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {36#false} {36#false} #65#return; {36#false} is VALID [2022-04-27 14:27:39,389 INFO L290 TraceCheckUtils]: 22: Hoare triple {36#false} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {36#false} is VALID [2022-04-27 14:27:39,389 INFO L290 TraceCheckUtils]: 23: Hoare triple {36#false} assume false; {36#false} is VALID [2022-04-27 14:27:39,390 INFO L272 TraceCheckUtils]: 24: Hoare triple {36#false} call __VERIFIER_assert((if ~z~0 == ~a~0 * ~b~0 then 1 else 0)); {36#false} is VALID [2022-04-27 14:27:39,390 INFO L290 TraceCheckUtils]: 25: Hoare triple {36#false} ~cond := #in~cond; {36#false} is VALID [2022-04-27 14:27:39,390 INFO L290 TraceCheckUtils]: 26: Hoare triple {36#false} assume 0 == ~cond; {36#false} is VALID [2022-04-27 14:27:39,390 INFO L290 TraceCheckUtils]: 27: Hoare triple {36#false} assume !false; {36#false} is VALID [2022-04-27 14:27:39,390 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-27 14:27:39,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:27:39,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867173607] [2022-04-27 14:27:39,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867173607] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 14:27:39,391 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 14:27:39,392 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 14:27:39,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803233553] [2022-04-27 14:27:39,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:27:39,396 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2022-04-27 14:27:39,397 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:27:39,399 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 14:27:39,428 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:27:39,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 14:27:39,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:27:39,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 14:27:39,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 14:27:39,444 INFO L87 Difference]: Start difference. First operand has 32 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 14:27:39,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:27:39,568 INFO L93 Difference]: Finished difference Result 57 states and 77 transitions. [2022-04-27 14:27:39,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 14:27:39,568 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2022-04-27 14:27:39,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:27:39,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 14:27:39,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions. [2022-04-27 14:27:39,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 14:27:39,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions. [2022-04-27 14:27:39,591 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 77 transitions. [2022-04-27 14:27:39,670 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:27:39,676 INFO L225 Difference]: With dead ends: 57 [2022-04-27 14:27:39,676 INFO L226 Difference]: Without dead ends: 27 [2022-04-27 14:27:39,678 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 14:27:39,680 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 19 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 14:27:39,681 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 34 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 14:27:39,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-27 14:27:39,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-04-27 14:27:39,706 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:27:39,707 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 27 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:27:39,708 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 27 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:27:39,709 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 27 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:27:39,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:27:39,716 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-04-27 14:27:39,716 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-27 14:27:39,716 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:27:39,716 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:27:39,717 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 27 states. [2022-04-27 14:27:39,717 INFO L87 Difference]: Start difference. First operand has 27 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 27 states. [2022-04-27 14:27:39,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:27:39,720 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-04-27 14:27:39,720 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-27 14:27:39,721 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:27:39,721 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:27:39,721 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:27:39,721 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:27:39,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:27:39,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-04-27 14:27:39,727 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 28 [2022-04-27 14:27:39,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:27:39,727 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-04-27 14:27:39,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 14:27:39,728 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-27 14:27:39,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-27 14:27:39,728 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:27:39,728 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:27:39,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 14:27:39,729 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:27:39,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:27:39,729 INFO L85 PathProgramCache]: Analyzing trace with hash -1736242504, now seen corresponding path program 1 times [2022-04-27 14:27:39,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:27:39,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931446034] [2022-04-27 14:27:39,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:27:39,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:27:39,760 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:27:39,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1601005704] [2022-04-27 14:27:39,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:27:39,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:27:39,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:27:39,766 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 14:27:39,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-27 14:27:39,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:27:39,822 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-27 14:27:39,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:27:39,844 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:27:40,020 INFO L272 TraceCheckUtils]: 0: Hoare triple {224#true} call ULTIMATE.init(); {224#true} is VALID [2022-04-27 14:27:40,020 INFO L290 TraceCheckUtils]: 1: Hoare triple {224#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); {224#true} is VALID [2022-04-27 14:27:40,020 INFO L290 TraceCheckUtils]: 2: Hoare triple {224#true} assume true; {224#true} is VALID [2022-04-27 14:27:40,021 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {224#true} {224#true} #71#return; {224#true} is VALID [2022-04-27 14:27:40,021 INFO L272 TraceCheckUtils]: 4: Hoare triple {224#true} call #t~ret6 := main(); {224#true} is VALID [2022-04-27 14:27:40,023 INFO L290 TraceCheckUtils]: 5: Hoare triple {224#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4; {224#true} is VALID [2022-04-27 14:27:40,024 INFO L272 TraceCheckUtils]: 6: Hoare triple {224#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 100 then 1 else 0)); {224#true} is VALID [2022-04-27 14:27:40,024 INFO L290 TraceCheckUtils]: 7: Hoare triple {224#true} ~cond := #in~cond; {224#true} is VALID [2022-04-27 14:27:40,024 INFO L290 TraceCheckUtils]: 8: Hoare triple {224#true} assume !(0 == ~cond); {224#true} is VALID [2022-04-27 14:27:40,025 INFO L290 TraceCheckUtils]: 9: Hoare triple {224#true} assume true; {224#true} is VALID [2022-04-27 14:27:40,025 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {224#true} {224#true} #61#return; {224#true} is VALID [2022-04-27 14:27:40,025 INFO L290 TraceCheckUtils]: 11: Hoare triple {224#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {224#true} is VALID [2022-04-27 14:27:40,027 INFO L272 TraceCheckUtils]: 12: Hoare triple {224#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 100 then 1 else 0)); {224#true} is VALID [2022-04-27 14:27:40,027 INFO L290 TraceCheckUtils]: 13: Hoare triple {224#true} ~cond := #in~cond; {224#true} is VALID [2022-04-27 14:27:40,027 INFO L290 TraceCheckUtils]: 14: Hoare triple {224#true} assume !(0 == ~cond); {224#true} is VALID [2022-04-27 14:27:40,028 INFO L290 TraceCheckUtils]: 15: Hoare triple {224#true} assume true; {224#true} is VALID [2022-04-27 14:27:40,028 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {224#true} {224#true} #63#return; {224#true} is VALID [2022-04-27 14:27:40,028 INFO L272 TraceCheckUtils]: 17: Hoare triple {224#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {224#true} is VALID [2022-04-27 14:27:40,028 INFO L290 TraceCheckUtils]: 18: Hoare triple {224#true} ~cond := #in~cond; {224#true} is VALID [2022-04-27 14:27:40,029 INFO L290 TraceCheckUtils]: 19: Hoare triple {224#true} assume !(0 == ~cond); {224#true} is VALID [2022-04-27 14:27:40,029 INFO L290 TraceCheckUtils]: 20: Hoare triple {224#true} assume true; {224#true} is VALID [2022-04-27 14:27:40,029 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {224#true} {224#true} #65#return; {224#true} is VALID [2022-04-27 14:27:40,030 INFO L290 TraceCheckUtils]: 22: Hoare triple {224#true} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {295#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-27 14:27:40,030 INFO L290 TraceCheckUtils]: 23: Hoare triple {295#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} assume !false; {295#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-27 14:27:40,031 INFO L272 TraceCheckUtils]: 24: Hoare triple {295#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {302#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:27:40,032 INFO L290 TraceCheckUtils]: 25: Hoare triple {302#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {306#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:27:40,033 INFO L290 TraceCheckUtils]: 26: Hoare triple {306#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {225#false} is VALID [2022-04-27 14:27:40,033 INFO L290 TraceCheckUtils]: 27: Hoare triple {225#false} assume !false; {225#false} is VALID [2022-04-27 14:27:40,034 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-27 14:27:40,034 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 14:27:40,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:27:40,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931446034] [2022-04-27 14:27:40,035 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:27:40,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1601005704] [2022-04-27 14:27:40,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1601005704] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 14:27:40,038 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 14:27:40,038 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 14:27:40,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965219684] [2022-04-27 14:27:40,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:27:40,040 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 28 [2022-04-27 14:27:40,041 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:27:40,041 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-27 14:27:40,058 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:27:40,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 14:27:40,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:27:40,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 14:27:40,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 14:27:40,060 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-27 14:27:40,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:27:40,210 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2022-04-27 14:27:40,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 14:27:40,211 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 28 [2022-04-27 14:27:40,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:27:40,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-27 14:27:40,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 45 transitions. [2022-04-27 14:27:40,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-27 14:27:40,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 45 transitions. [2022-04-27 14:27:40,217 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 45 transitions. [2022-04-27 14:27:40,251 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:27:40,255 INFO L225 Difference]: With dead ends: 39 [2022-04-27 14:27:40,255 INFO L226 Difference]: Without dead ends: 37 [2022-04-27 14:27:40,255 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 14:27:40,257 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 8 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 14:27:40,257 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 87 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 14:27:40,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-04-27 14:27:40,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 33. [2022-04-27 14:27:40,271 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:27:40,271 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 33 states, 20 states have (on average 1.15) internal successors, (23), 22 states have internal predecessors, (23), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:27:40,272 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 33 states, 20 states have (on average 1.15) internal successors, (23), 22 states have internal predecessors, (23), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:27:40,273 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 33 states, 20 states have (on average 1.15) internal successors, (23), 22 states have internal predecessors, (23), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:27:40,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:27:40,277 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2022-04-27 14:27:40,279 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2022-04-27 14:27:40,280 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:27:40,285 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:27:40,287 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 20 states have (on average 1.15) internal successors, (23), 22 states have internal predecessors, (23), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Second operand 37 states. [2022-04-27 14:27:40,287 INFO L87 Difference]: Start difference. First operand has 33 states, 20 states have (on average 1.15) internal successors, (23), 22 states have internal predecessors, (23), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Second operand 37 states. [2022-04-27 14:27:40,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:27:40,291 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2022-04-27 14:27:40,291 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2022-04-27 14:27:40,292 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:27:40,292 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:27:40,292 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:27:40,292 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:27:40,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 20 states have (on average 1.15) internal successors, (23), 22 states have internal predecessors, (23), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:27:40,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2022-04-27 14:27:40,294 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 28 [2022-04-27 14:27:40,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:27:40,294 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2022-04-27 14:27:40,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-27 14:27:40,294 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2022-04-27 14:27:40,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-27 14:27:40,295 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:27:40,295 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:27:40,327 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-27 14:27:40,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:27:40,512 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:27:40,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:27:40,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1911690432, now seen corresponding path program 1 times [2022-04-27 14:27:40,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:27:40,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994040210] [2022-04-27 14:27:40,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:27:40,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:27:40,532 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:27:40,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1024603488] [2022-04-27 14:27:40,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:27:40,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:27:40,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:27:40,536 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 14:27:40,538 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-27 14:27:40,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:27:40,580 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 14:27:40,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:27:40,589 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:27:40,722 INFO L272 TraceCheckUtils]: 0: Hoare triple {491#true} call ULTIMATE.init(); {491#true} is VALID [2022-04-27 14:27:40,722 INFO L290 TraceCheckUtils]: 1: Hoare triple {491#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); {491#true} is VALID [2022-04-27 14:27:40,723 INFO L290 TraceCheckUtils]: 2: Hoare triple {491#true} assume true; {491#true} is VALID [2022-04-27 14:27:40,723 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {491#true} {491#true} #71#return; {491#true} is VALID [2022-04-27 14:27:40,723 INFO L272 TraceCheckUtils]: 4: Hoare triple {491#true} call #t~ret6 := main(); {491#true} is VALID [2022-04-27 14:27:40,723 INFO L290 TraceCheckUtils]: 5: Hoare triple {491#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4; {491#true} is VALID [2022-04-27 14:27:40,723 INFO L272 TraceCheckUtils]: 6: Hoare triple {491#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 100 then 1 else 0)); {491#true} is VALID [2022-04-27 14:27:40,723 INFO L290 TraceCheckUtils]: 7: Hoare triple {491#true} ~cond := #in~cond; {491#true} is VALID [2022-04-27 14:27:40,723 INFO L290 TraceCheckUtils]: 8: Hoare triple {491#true} assume !(0 == ~cond); {491#true} is VALID [2022-04-27 14:27:40,723 INFO L290 TraceCheckUtils]: 9: Hoare triple {491#true} assume true; {491#true} is VALID [2022-04-27 14:27:40,724 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {491#true} {491#true} #61#return; {491#true} is VALID [2022-04-27 14:27:40,724 INFO L290 TraceCheckUtils]: 11: Hoare triple {491#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {491#true} is VALID [2022-04-27 14:27:40,724 INFO L272 TraceCheckUtils]: 12: Hoare triple {491#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 100 then 1 else 0)); {491#true} is VALID [2022-04-27 14:27:40,724 INFO L290 TraceCheckUtils]: 13: Hoare triple {491#true} ~cond := #in~cond; {491#true} is VALID [2022-04-27 14:27:40,724 INFO L290 TraceCheckUtils]: 14: Hoare triple {491#true} assume !(0 == ~cond); {491#true} is VALID [2022-04-27 14:27:40,724 INFO L290 TraceCheckUtils]: 15: Hoare triple {491#true} assume true; {491#true} is VALID [2022-04-27 14:27:40,724 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {491#true} {491#true} #63#return; {491#true} is VALID [2022-04-27 14:27:40,724 INFO L272 TraceCheckUtils]: 17: Hoare triple {491#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {491#true} is VALID [2022-04-27 14:27:40,725 INFO L290 TraceCheckUtils]: 18: Hoare triple {491#true} ~cond := #in~cond; {550#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 14:27:40,725 INFO L290 TraceCheckUtils]: 19: Hoare triple {550#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {554#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 14:27:40,726 INFO L290 TraceCheckUtils]: 20: Hoare triple {554#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {554#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 14:27:40,726 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {554#(not (= |assume_abort_if_not_#in~cond| 0))} {491#true} #65#return; {561#(<= 1 main_~b~0)} is VALID [2022-04-27 14:27:40,727 INFO L290 TraceCheckUtils]: 22: Hoare triple {561#(<= 1 main_~b~0)} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {565#(<= 1 main_~y~0)} is VALID [2022-04-27 14:27:40,727 INFO L290 TraceCheckUtils]: 23: Hoare triple {565#(<= 1 main_~y~0)} assume !false; {565#(<= 1 main_~y~0)} is VALID [2022-04-27 14:27:40,727 INFO L272 TraceCheckUtils]: 24: Hoare triple {565#(<= 1 main_~y~0)} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {491#true} is VALID [2022-04-27 14:27:40,727 INFO L290 TraceCheckUtils]: 25: Hoare triple {491#true} ~cond := #in~cond; {491#true} is VALID [2022-04-27 14:27:40,727 INFO L290 TraceCheckUtils]: 26: Hoare triple {491#true} assume !(0 == ~cond); {491#true} is VALID [2022-04-27 14:27:40,728 INFO L290 TraceCheckUtils]: 27: Hoare triple {491#true} assume true; {491#true} is VALID [2022-04-27 14:27:40,728 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {491#true} {565#(<= 1 main_~y~0)} #67#return; {565#(<= 1 main_~y~0)} is VALID [2022-04-27 14:27:40,728 INFO L290 TraceCheckUtils]: 29: Hoare triple {565#(<= 1 main_~y~0)} assume !(0 != ~y~0); {492#false} is VALID [2022-04-27 14:27:40,729 INFO L272 TraceCheckUtils]: 30: Hoare triple {492#false} call __VERIFIER_assert((if ~z~0 == ~a~0 * ~b~0 then 1 else 0)); {492#false} is VALID [2022-04-27 14:27:40,729 INFO L290 TraceCheckUtils]: 31: Hoare triple {492#false} ~cond := #in~cond; {492#false} is VALID [2022-04-27 14:27:40,729 INFO L290 TraceCheckUtils]: 32: Hoare triple {492#false} assume 0 == ~cond; {492#false} is VALID [2022-04-27 14:27:40,729 INFO L290 TraceCheckUtils]: 33: Hoare triple {492#false} assume !false; {492#false} is VALID [2022-04-27 14:27:40,729 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-27 14:27:40,729 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 14:27:40,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:27:40,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994040210] [2022-04-27 14:27:40,730 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:27:40,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1024603488] [2022-04-27 14:27:40,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1024603488] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 14:27:40,730 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 14:27:40,730 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 14:27:40,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12334606] [2022-04-27 14:27:40,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:27:40,730 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34 [2022-04-27 14:27:40,731 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:27:40,731 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 14:27:40,751 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:27:40,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 14:27:40,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:27:40,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 14:27:40,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 14:27:40,752 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 14:27:40,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:27:40,895 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2022-04-27 14:27:40,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 14:27:40,896 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34 [2022-04-27 14:27:40,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:27:40,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 14:27:40,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 45 transitions. [2022-04-27 14:27:40,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 14:27:40,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 45 transitions. [2022-04-27 14:27:40,899 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 45 transitions. [2022-04-27 14:27:40,926 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:27:40,927 INFO L225 Difference]: With dead ends: 43 [2022-04-27 14:27:40,927 INFO L226 Difference]: Without dead ends: 36 [2022-04-27 14:27:40,927 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-27 14:27:40,928 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 14 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 14:27:40,928 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 89 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 14:27:40,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-27 14:27:40,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2022-04-27 14:27:40,935 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:27:40,935 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 34 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 22 states have internal predecessors, (24), 8 states have call successors, (8), 5 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 14:27:40,935 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 34 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 22 states have internal predecessors, (24), 8 states have call successors, (8), 5 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 14:27:40,935 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 34 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 22 states have internal predecessors, (24), 8 states have call successors, (8), 5 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 14:27:40,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:27:40,937 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2022-04-27 14:27:40,937 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2022-04-27 14:27:40,937 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:27:40,937 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:27:40,937 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 22 states have internal predecessors, (24), 8 states have call successors, (8), 5 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 36 states. [2022-04-27 14:27:40,938 INFO L87 Difference]: Start difference. First operand has 34 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 22 states have internal predecessors, (24), 8 states have call successors, (8), 5 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 36 states. [2022-04-27 14:27:40,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:27:40,939 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2022-04-27 14:27:40,939 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2022-04-27 14:27:40,939 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:27:40,939 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:27:40,939 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:27:40,939 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:27:40,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 22 states have internal predecessors, (24), 8 states have call successors, (8), 5 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 14:27:40,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2022-04-27 14:27:40,941 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 34 [2022-04-27 14:27:40,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:27:40,941 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2022-04-27 14:27:40,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 14:27:40,941 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2022-04-27 14:27:40,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-27 14:27:40,942 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:27:40,942 INFO L195 NwaCegarLoop]: trace histogram [3, 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 14:27:40,960 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-27 14:27:41,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-27 14:27:41,156 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:27:41,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:27:41,156 INFO L85 PathProgramCache]: Analyzing trace with hash 2022075506, now seen corresponding path program 1 times [2022-04-27 14:27:41,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:27:41,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863193748] [2022-04-27 14:27:41,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:27:41,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:27:41,171 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:27:41,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1828442052] [2022-04-27 14:27:41,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:27:41,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:27:41,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:27:41,173 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 14:27:41,173 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-27 14:27:41,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:27:41,207 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-27 14:27:41,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:27:41,220 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:27:42,242 INFO L272 TraceCheckUtils]: 0: Hoare triple {783#true} call ULTIMATE.init(); {783#true} is VALID [2022-04-27 14:27:42,242 INFO L290 TraceCheckUtils]: 1: Hoare triple {783#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); {783#true} is VALID [2022-04-27 14:27:42,242 INFO L290 TraceCheckUtils]: 2: Hoare triple {783#true} assume true; {783#true} is VALID [2022-04-27 14:27:42,242 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {783#true} {783#true} #71#return; {783#true} is VALID [2022-04-27 14:27:42,242 INFO L272 TraceCheckUtils]: 4: Hoare triple {783#true} call #t~ret6 := main(); {783#true} is VALID [2022-04-27 14:27:42,243 INFO L290 TraceCheckUtils]: 5: Hoare triple {783#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4; {783#true} is VALID [2022-04-27 14:27:42,243 INFO L272 TraceCheckUtils]: 6: Hoare triple {783#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 100 then 1 else 0)); {783#true} is VALID [2022-04-27 14:27:42,243 INFO L290 TraceCheckUtils]: 7: Hoare triple {783#true} ~cond := #in~cond; {783#true} is VALID [2022-04-27 14:27:42,243 INFO L290 TraceCheckUtils]: 8: Hoare triple {783#true} assume !(0 == ~cond); {783#true} is VALID [2022-04-27 14:27:42,243 INFO L290 TraceCheckUtils]: 9: Hoare triple {783#true} assume true; {783#true} is VALID [2022-04-27 14:27:42,243 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {783#true} {783#true} #61#return; {783#true} is VALID [2022-04-27 14:27:42,243 INFO L290 TraceCheckUtils]: 11: Hoare triple {783#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {783#true} is VALID [2022-04-27 14:27:42,243 INFO L272 TraceCheckUtils]: 12: Hoare triple {783#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 100 then 1 else 0)); {783#true} is VALID [2022-04-27 14:27:42,243 INFO L290 TraceCheckUtils]: 13: Hoare triple {783#true} ~cond := #in~cond; {783#true} is VALID [2022-04-27 14:27:42,243 INFO L290 TraceCheckUtils]: 14: Hoare triple {783#true} assume !(0 == ~cond); {783#true} is VALID [2022-04-27 14:27:42,244 INFO L290 TraceCheckUtils]: 15: Hoare triple {783#true} assume true; {783#true} is VALID [2022-04-27 14:27:42,244 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {783#true} {783#true} #63#return; {783#true} is VALID [2022-04-27 14:27:42,244 INFO L272 TraceCheckUtils]: 17: Hoare triple {783#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {783#true} is VALID [2022-04-27 14:27:42,244 INFO L290 TraceCheckUtils]: 18: Hoare triple {783#true} ~cond := #in~cond; {783#true} is VALID [2022-04-27 14:27:42,244 INFO L290 TraceCheckUtils]: 19: Hoare triple {783#true} assume !(0 == ~cond); {783#true} is VALID [2022-04-27 14:27:42,244 INFO L290 TraceCheckUtils]: 20: Hoare triple {783#true} assume true; {783#true} is VALID [2022-04-27 14:27:42,244 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {783#true} {783#true} #65#return; {783#true} is VALID [2022-04-27 14:27:42,254 INFO L290 TraceCheckUtils]: 22: Hoare triple {783#true} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {854#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-27 14:27:42,254 INFO L290 TraceCheckUtils]: 23: Hoare triple {854#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} assume !false; {854#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-27 14:27:42,255 INFO L272 TraceCheckUtils]: 24: Hoare triple {854#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {783#true} is VALID [2022-04-27 14:27:42,255 INFO L290 TraceCheckUtils]: 25: Hoare triple {783#true} ~cond := #in~cond; {783#true} is VALID [2022-04-27 14:27:42,255 INFO L290 TraceCheckUtils]: 26: Hoare triple {783#true} assume !(0 == ~cond); {783#true} is VALID [2022-04-27 14:27:42,255 INFO L290 TraceCheckUtils]: 27: Hoare triple {783#true} assume true; {783#true} is VALID [2022-04-27 14:27:42,256 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {783#true} {854#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} #67#return; {854#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-27 14:27:42,256 INFO L290 TraceCheckUtils]: 29: Hoare triple {854#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} assume !!(0 != ~y~0); {876#(and (= main_~z~0 0) (not (= main_~y~0 0)) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-27 14:27:42,257 INFO L290 TraceCheckUtils]: 30: Hoare triple {876#(and (= main_~z~0 0) (not (= main_~y~0 0)) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} assume 1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2);~z~0 := ~z~0 + ~x~0;~y~0 := ~y~0 - 1; {880#(and (<= 1 (mod (+ main_~y~0 1) 2)) (= main_~b~0 (+ main_~y~0 1)) (= main_~z~0 main_~x~0) (= main_~a~0 main_~x~0) (<= 0 (+ main_~y~0 1)))} is VALID [2022-04-27 14:27:42,258 INFO L290 TraceCheckUtils]: 31: Hoare triple {880#(and (<= 1 (mod (+ main_~y~0 1) 2)) (= main_~b~0 (+ main_~y~0 1)) (= main_~z~0 main_~x~0) (= main_~a~0 main_~x~0) (<= 0 (+ main_~y~0 1)))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {884#(and (= main_~a~0 main_~z~0) (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} is VALID [2022-04-27 14:27:42,258 INFO L290 TraceCheckUtils]: 32: Hoare triple {884#(and (= main_~a~0 main_~z~0) (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} assume !false; {884#(and (= main_~a~0 main_~z~0) (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} is VALID [2022-04-27 14:27:42,451 INFO L272 TraceCheckUtils]: 33: Hoare triple {884#(and (= main_~a~0 main_~z~0) (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {891#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:27:42,451 INFO L290 TraceCheckUtils]: 34: Hoare triple {891#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {895#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:27:42,455 INFO L290 TraceCheckUtils]: 35: Hoare triple {895#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {784#false} is VALID [2022-04-27 14:27:42,455 INFO L290 TraceCheckUtils]: 36: Hoare triple {784#false} assume !false; {784#false} is VALID [2022-04-27 14:27:42,456 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-27 14:27:42,456 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:28:13,520 INFO L290 TraceCheckUtils]: 36: Hoare triple {784#false} assume !false; {784#false} is VALID [2022-04-27 14:28:13,521 INFO L290 TraceCheckUtils]: 35: Hoare triple {895#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {784#false} is VALID [2022-04-27 14:28:13,521 INFO L290 TraceCheckUtils]: 34: Hoare triple {891#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {895#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:28:13,521 INFO L272 TraceCheckUtils]: 33: Hoare triple {911#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {891#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:28:13,522 INFO L290 TraceCheckUtils]: 32: Hoare triple {911#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} assume !false; {911#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-27 14:28:13,526 INFO L290 TraceCheckUtils]: 31: Hoare triple {918#(and (or (not (< main_~y~0 0)) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (and (not (= (mod main_~y~0 2) 0)) (< main_~y~0 0))))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {911#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-27 14:28:13,528 INFO L290 TraceCheckUtils]: 30: Hoare triple {922#(or (= (+ (* (* main_~x~0 2) (div (+ (- 1) main_~y~0) 2)) main_~z~0 main_~x~0) (* main_~b~0 main_~a~0)) (not (<= 1 (mod main_~y~0 2))) (< main_~y~0 0))} assume 1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2);~z~0 := ~z~0 + ~x~0;~y~0 := ~y~0 - 1; {918#(and (or (not (< main_~y~0 0)) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (and (not (= (mod main_~y~0 2) 0)) (< main_~y~0 0))))} is VALID [2022-04-27 14:28:13,529 INFO L290 TraceCheckUtils]: 29: Hoare triple {922#(or (= (+ (* (* main_~x~0 2) (div (+ (- 1) main_~y~0) 2)) main_~z~0 main_~x~0) (* main_~b~0 main_~a~0)) (not (<= 1 (mod main_~y~0 2))) (< main_~y~0 0))} assume !!(0 != ~y~0); {922#(or (= (+ (* (* main_~x~0 2) (div (+ (- 1) main_~y~0) 2)) main_~z~0 main_~x~0) (* main_~b~0 main_~a~0)) (not (<= 1 (mod main_~y~0 2))) (< main_~y~0 0))} is VALID [2022-04-27 14:28:13,529 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {783#true} {922#(or (= (+ (* (* main_~x~0 2) (div (+ (- 1) main_~y~0) 2)) main_~z~0 main_~x~0) (* main_~b~0 main_~a~0)) (not (<= 1 (mod main_~y~0 2))) (< main_~y~0 0))} #67#return; {922#(or (= (+ (* (* main_~x~0 2) (div (+ (- 1) main_~y~0) 2)) main_~z~0 main_~x~0) (* main_~b~0 main_~a~0)) (not (<= 1 (mod main_~y~0 2))) (< main_~y~0 0))} is VALID [2022-04-27 14:28:13,529 INFO L290 TraceCheckUtils]: 27: Hoare triple {783#true} assume true; {783#true} is VALID [2022-04-27 14:28:13,530 INFO L290 TraceCheckUtils]: 26: Hoare triple {783#true} assume !(0 == ~cond); {783#true} is VALID [2022-04-27 14:28:13,530 INFO L290 TraceCheckUtils]: 25: Hoare triple {783#true} ~cond := #in~cond; {783#true} is VALID [2022-04-27 14:28:13,530 INFO L272 TraceCheckUtils]: 24: Hoare triple {922#(or (= (+ (* (* main_~x~0 2) (div (+ (- 1) main_~y~0) 2)) main_~z~0 main_~x~0) (* main_~b~0 main_~a~0)) (not (<= 1 (mod main_~y~0 2))) (< main_~y~0 0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {783#true} is VALID [2022-04-27 14:28:13,530 INFO L290 TraceCheckUtils]: 23: Hoare triple {922#(or (= (+ (* (* main_~x~0 2) (div (+ (- 1) main_~y~0) 2)) main_~z~0 main_~x~0) (* main_~b~0 main_~a~0)) (not (<= 1 (mod main_~y~0 2))) (< main_~y~0 0))} assume !false; {922#(or (= (+ (* (* main_~x~0 2) (div (+ (- 1) main_~y~0) 2)) main_~z~0 main_~x~0) (* main_~b~0 main_~a~0)) (not (<= 1 (mod main_~y~0 2))) (< main_~y~0 0))} is VALID [2022-04-27 14:28:13,883 INFO L290 TraceCheckUtils]: 22: Hoare triple {783#true} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {922#(or (= (+ (* (* main_~x~0 2) (div (+ (- 1) main_~y~0) 2)) main_~z~0 main_~x~0) (* main_~b~0 main_~a~0)) (not (<= 1 (mod main_~y~0 2))) (< main_~y~0 0))} is VALID [2022-04-27 14:28:13,883 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {783#true} {783#true} #65#return; {783#true} is VALID [2022-04-27 14:28:13,883 INFO L290 TraceCheckUtils]: 20: Hoare triple {783#true} assume true; {783#true} is VALID [2022-04-27 14:28:13,883 INFO L290 TraceCheckUtils]: 19: Hoare triple {783#true} assume !(0 == ~cond); {783#true} is VALID [2022-04-27 14:28:13,883 INFO L290 TraceCheckUtils]: 18: Hoare triple {783#true} ~cond := #in~cond; {783#true} is VALID [2022-04-27 14:28:13,883 INFO L272 TraceCheckUtils]: 17: Hoare triple {783#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {783#true} is VALID [2022-04-27 14:28:13,884 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {783#true} {783#true} #63#return; {783#true} is VALID [2022-04-27 14:28:13,884 INFO L290 TraceCheckUtils]: 15: Hoare triple {783#true} assume true; {783#true} is VALID [2022-04-27 14:28:13,884 INFO L290 TraceCheckUtils]: 14: Hoare triple {783#true} assume !(0 == ~cond); {783#true} is VALID [2022-04-27 14:28:13,884 INFO L290 TraceCheckUtils]: 13: Hoare triple {783#true} ~cond := #in~cond; {783#true} is VALID [2022-04-27 14:28:13,884 INFO L272 TraceCheckUtils]: 12: Hoare triple {783#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 100 then 1 else 0)); {783#true} is VALID [2022-04-27 14:28:13,884 INFO L290 TraceCheckUtils]: 11: Hoare triple {783#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {783#true} is VALID [2022-04-27 14:28:13,884 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {783#true} {783#true} #61#return; {783#true} is VALID [2022-04-27 14:28:13,884 INFO L290 TraceCheckUtils]: 9: Hoare triple {783#true} assume true; {783#true} is VALID [2022-04-27 14:28:13,884 INFO L290 TraceCheckUtils]: 8: Hoare triple {783#true} assume !(0 == ~cond); {783#true} is VALID [2022-04-27 14:28:13,884 INFO L290 TraceCheckUtils]: 7: Hoare triple {783#true} ~cond := #in~cond; {783#true} is VALID [2022-04-27 14:28:13,884 INFO L272 TraceCheckUtils]: 6: Hoare triple {783#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 100 then 1 else 0)); {783#true} is VALID [2022-04-27 14:28:13,884 INFO L290 TraceCheckUtils]: 5: Hoare triple {783#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4; {783#true} is VALID [2022-04-27 14:28:13,885 INFO L272 TraceCheckUtils]: 4: Hoare triple {783#true} call #t~ret6 := main(); {783#true} is VALID [2022-04-27 14:28:13,885 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {783#true} {783#true} #71#return; {783#true} is VALID [2022-04-27 14:28:13,885 INFO L290 TraceCheckUtils]: 2: Hoare triple {783#true} assume true; {783#true} is VALID [2022-04-27 14:28:13,885 INFO L290 TraceCheckUtils]: 1: Hoare triple {783#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); {783#true} is VALID [2022-04-27 14:28:13,885 INFO L272 TraceCheckUtils]: 0: Hoare triple {783#true} call ULTIMATE.init(); {783#true} is VALID [2022-04-27 14:28:13,885 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-27 14:28:13,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:28:13,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863193748] [2022-04-27 14:28:13,886 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:28:13,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1828442052] [2022-04-27 14:28:13,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1828442052] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 14:28:13,886 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:28:13,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 11 [2022-04-27 14:28:13,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624288926] [2022-04-27 14:28:13,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:28:13,886 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 37 [2022-04-27 14:28:13,887 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:28:13,887 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 14:28:14,146 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:28:14,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 14:28:14,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:28:14,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 14:28:14,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-04-27 14:28:14,147 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 14:28:15,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:28:15,442 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2022-04-27 14:28:15,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 14:28:15,443 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 37 [2022-04-27 14:28:15,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:28:15,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 14:28:15,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 46 transitions. [2022-04-27 14:28:15,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 14:28:15,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 46 transitions. [2022-04-27 14:28:15,445 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 46 transitions. [2022-04-27 14:28:15,480 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:28:15,481 INFO L225 Difference]: With dead ends: 47 [2022-04-27 14:28:15,481 INFO L226 Difference]: Without dead ends: 45 [2022-04-27 14:28:15,481 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 62 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2022-04-27 14:28:15,481 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 8 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-27 14:28:15,482 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 116 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-27 14:28:15,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-27 14:28:15,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2022-04-27 14:28:15,502 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:28:15,502 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 43 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 29 states have internal predecessors, (33), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 14:28:15,502 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 43 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 29 states have internal predecessors, (33), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 14:28:15,502 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 43 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 29 states have internal predecessors, (33), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 14:28:15,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:28:15,504 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2022-04-27 14:28:15,504 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2022-04-27 14:28:15,505 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:28:15,505 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:28:15,505 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 29 states have internal predecessors, (33), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 45 states. [2022-04-27 14:28:15,505 INFO L87 Difference]: Start difference. First operand has 43 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 29 states have internal predecessors, (33), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 45 states. [2022-04-27 14:28:15,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:28:15,507 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2022-04-27 14:28:15,507 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2022-04-27 14:28:15,507 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:28:15,507 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:28:15,507 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:28:15,507 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:28:15,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 29 states have internal predecessors, (33), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 14:28:15,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2022-04-27 14:28:15,509 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 37 [2022-04-27 14:28:15,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:28:15,509 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2022-04-27 14:28:15,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 14:28:15,509 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2022-04-27 14:28:15,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-27 14:28:15,510 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:28:15,510 INFO L195 NwaCegarLoop]: trace histogram [3, 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 14:28:15,531 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-27 14:28:15,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:28:15,719 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:28:15,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:28:15,720 INFO L85 PathProgramCache]: Analyzing trace with hash -497884428, now seen corresponding path program 1 times [2022-04-27 14:28:15,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:28:15,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066019151] [2022-04-27 14:28:15,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:28:15,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:28:15,747 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:28:15,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1283273956] [2022-04-27 14:28:15,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:28:15,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:28:15,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:28:15,753 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 14:28:15,754 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-27 14:28:15,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:28:15,800 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-27 14:28:15,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:28:15,810 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:28:17,527 INFO L272 TraceCheckUtils]: 0: Hoare triple {1236#true} call ULTIMATE.init(); {1236#true} is VALID [2022-04-27 14:28:17,527 INFO L290 TraceCheckUtils]: 1: Hoare triple {1236#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); {1236#true} is VALID [2022-04-27 14:28:17,527 INFO L290 TraceCheckUtils]: 2: Hoare triple {1236#true} assume true; {1236#true} is VALID [2022-04-27 14:28:17,527 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1236#true} {1236#true} #71#return; {1236#true} is VALID [2022-04-27 14:28:17,527 INFO L272 TraceCheckUtils]: 4: Hoare triple {1236#true} call #t~ret6 := main(); {1236#true} is VALID [2022-04-27 14:28:17,527 INFO L290 TraceCheckUtils]: 5: Hoare triple {1236#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4; {1236#true} is VALID [2022-04-27 14:28:17,527 INFO L272 TraceCheckUtils]: 6: Hoare triple {1236#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 100 then 1 else 0)); {1236#true} is VALID [2022-04-27 14:28:17,528 INFO L290 TraceCheckUtils]: 7: Hoare triple {1236#true} ~cond := #in~cond; {1236#true} is VALID [2022-04-27 14:28:17,528 INFO L290 TraceCheckUtils]: 8: Hoare triple {1236#true} assume !(0 == ~cond); {1236#true} is VALID [2022-04-27 14:28:17,528 INFO L290 TraceCheckUtils]: 9: Hoare triple {1236#true} assume true; {1236#true} is VALID [2022-04-27 14:28:17,528 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1236#true} {1236#true} #61#return; {1236#true} is VALID [2022-04-27 14:28:17,528 INFO L290 TraceCheckUtils]: 11: Hoare triple {1236#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {1236#true} is VALID [2022-04-27 14:28:17,528 INFO L272 TraceCheckUtils]: 12: Hoare triple {1236#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 100 then 1 else 0)); {1236#true} is VALID [2022-04-27 14:28:17,528 INFO L290 TraceCheckUtils]: 13: Hoare triple {1236#true} ~cond := #in~cond; {1236#true} is VALID [2022-04-27 14:28:17,528 INFO L290 TraceCheckUtils]: 14: Hoare triple {1236#true} assume !(0 == ~cond); {1236#true} is VALID [2022-04-27 14:28:17,528 INFO L290 TraceCheckUtils]: 15: Hoare triple {1236#true} assume true; {1236#true} is VALID [2022-04-27 14:28:17,528 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1236#true} {1236#true} #63#return; {1236#true} is VALID [2022-04-27 14:28:17,528 INFO L272 TraceCheckUtils]: 17: Hoare triple {1236#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {1236#true} is VALID [2022-04-27 14:28:17,529 INFO L290 TraceCheckUtils]: 18: Hoare triple {1236#true} ~cond := #in~cond; {1295#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 14:28:17,529 INFO L290 TraceCheckUtils]: 19: Hoare triple {1295#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1299#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 14:28:17,530 INFO L290 TraceCheckUtils]: 20: Hoare triple {1299#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1299#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 14:28:17,530 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1299#(not (= |assume_abort_if_not_#in~cond| 0))} {1236#true} #65#return; {1306#(<= 1 main_~b~0)} is VALID [2022-04-27 14:28:17,531 INFO L290 TraceCheckUtils]: 22: Hoare triple {1306#(<= 1 main_~b~0)} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {1310#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-27 14:28:17,531 INFO L290 TraceCheckUtils]: 23: Hoare triple {1310#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} assume !false; {1310#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-27 14:28:17,531 INFO L272 TraceCheckUtils]: 24: Hoare triple {1310#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {1236#true} is VALID [2022-04-27 14:28:17,531 INFO L290 TraceCheckUtils]: 25: Hoare triple {1236#true} ~cond := #in~cond; {1320#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:28:17,532 INFO L290 TraceCheckUtils]: 26: Hoare triple {1320#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {1324#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:28:17,532 INFO L290 TraceCheckUtils]: 27: Hoare triple {1324#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1324#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:28:17,533 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1324#(not (= |__VERIFIER_assert_#in~cond| 0))} {1310#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} #67#return; {1310#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-27 14:28:17,533 INFO L290 TraceCheckUtils]: 29: Hoare triple {1310#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} assume !!(0 != ~y~0); {1310#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-27 14:28:17,534 INFO L290 TraceCheckUtils]: 30: Hoare triple {1310#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {1337#(and (= main_~z~0 0) (not (= (mod main_~y~0 2) 1)) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-27 14:28:17,535 INFO L290 TraceCheckUtils]: 31: Hoare triple {1337#(and (= main_~z~0 0) (not (= (mod main_~y~0 2) 1)) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {1341#(and (= main_~z~0 0) (= main_~y~0 (div main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0))} is VALID [2022-04-27 14:28:17,535 INFO L290 TraceCheckUtils]: 32: Hoare triple {1341#(and (= main_~z~0 0) (= main_~y~0 (div main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0))} assume !false; {1341#(and (= main_~z~0 0) (= main_~y~0 (div main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0))} is VALID [2022-04-27 14:28:17,537 INFO L272 TraceCheckUtils]: 33: Hoare triple {1341#(and (= main_~z~0 0) (= main_~y~0 (div main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {1348#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:28:17,537 INFO L290 TraceCheckUtils]: 34: Hoare triple {1348#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1352#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:28:17,537 INFO L290 TraceCheckUtils]: 35: Hoare triple {1352#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1237#false} is VALID [2022-04-27 14:28:17,537 INFO L290 TraceCheckUtils]: 36: Hoare triple {1237#false} assume !false; {1237#false} is VALID [2022-04-27 14:28:17,538 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-27 14:28:17,538 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:28:41,803 INFO L290 TraceCheckUtils]: 36: Hoare triple {1237#false} assume !false; {1237#false} is VALID [2022-04-27 14:28:41,804 INFO L290 TraceCheckUtils]: 35: Hoare triple {1352#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1237#false} is VALID [2022-04-27 14:28:41,804 INFO L290 TraceCheckUtils]: 34: Hoare triple {1348#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1352#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:28:41,805 INFO L272 TraceCheckUtils]: 33: Hoare triple {1368#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {1348#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:28:41,806 INFO L290 TraceCheckUtils]: 32: Hoare triple {1368#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} assume !false; {1368#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-27 14:28:41,812 INFO L290 TraceCheckUtils]: 31: Hoare triple {1375#(and (or (not (< main_~y~0 0)) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (and (not (= (mod main_~y~0 2) 0)) (< main_~y~0 0))))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {1368#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-27 14:28:41,813 INFO L290 TraceCheckUtils]: 30: Hoare triple {1379#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {1375#(and (or (not (< main_~y~0 0)) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (and (not (= (mod main_~y~0 2) 0)) (< main_~y~0 0))))} is VALID [2022-04-27 14:28:41,814 INFO L290 TraceCheckUtils]: 29: Hoare triple {1379#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} assume !!(0 != ~y~0); {1379#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} is VALID [2022-04-27 14:28:41,816 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1324#(not (= |__VERIFIER_assert_#in~cond| 0))} {1386#(or (<= 0 main_~y~0) (not (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0)))} #67#return; {1379#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} is VALID [2022-04-27 14:28:41,816 INFO L290 TraceCheckUtils]: 27: Hoare triple {1324#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1324#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:28:41,817 INFO L290 TraceCheckUtils]: 26: Hoare triple {1396#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {1324#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:28:41,817 INFO L290 TraceCheckUtils]: 25: Hoare triple {1236#true} ~cond := #in~cond; {1396#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 14:28:41,817 INFO L272 TraceCheckUtils]: 24: Hoare triple {1386#(or (<= 0 main_~y~0) (not (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0)))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {1236#true} is VALID [2022-04-27 14:28:41,818 INFO L290 TraceCheckUtils]: 23: Hoare triple {1386#(or (<= 0 main_~y~0) (not (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0)))} assume !false; {1386#(or (<= 0 main_~y~0) (not (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0)))} is VALID [2022-04-27 14:28:41,818 INFO L290 TraceCheckUtils]: 22: Hoare triple {1406#(or (= (* main_~b~0 main_~a~0) (* (* main_~a~0 2) (+ (div main_~b~0 2) 1))) (= (mod main_~b~0 2) 0) (<= 0 main_~b~0))} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {1386#(or (<= 0 main_~y~0) (not (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0)))} is VALID [2022-04-27 14:28:41,819 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1299#(not (= |assume_abort_if_not_#in~cond| 0))} {1236#true} #65#return; {1406#(or (= (* main_~b~0 main_~a~0) (* (* main_~a~0 2) (+ (div main_~b~0 2) 1))) (= (mod main_~b~0 2) 0) (<= 0 main_~b~0))} is VALID [2022-04-27 14:28:41,819 INFO L290 TraceCheckUtils]: 20: Hoare triple {1299#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1299#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 14:28:41,820 INFO L290 TraceCheckUtils]: 19: Hoare triple {1419#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {1299#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 14:28:41,820 INFO L290 TraceCheckUtils]: 18: Hoare triple {1236#true} ~cond := #in~cond; {1419#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-27 14:28:41,820 INFO L272 TraceCheckUtils]: 17: Hoare triple {1236#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {1236#true} is VALID [2022-04-27 14:28:41,821 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1236#true} {1236#true} #63#return; {1236#true} is VALID [2022-04-27 14:28:41,821 INFO L290 TraceCheckUtils]: 15: Hoare triple {1236#true} assume true; {1236#true} is VALID [2022-04-27 14:28:41,821 INFO L290 TraceCheckUtils]: 14: Hoare triple {1236#true} assume !(0 == ~cond); {1236#true} is VALID [2022-04-27 14:28:41,821 INFO L290 TraceCheckUtils]: 13: Hoare triple {1236#true} ~cond := #in~cond; {1236#true} is VALID [2022-04-27 14:28:41,821 INFO L272 TraceCheckUtils]: 12: Hoare triple {1236#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 100 then 1 else 0)); {1236#true} is VALID [2022-04-27 14:28:41,821 INFO L290 TraceCheckUtils]: 11: Hoare triple {1236#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {1236#true} is VALID [2022-04-27 14:28:41,821 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1236#true} {1236#true} #61#return; {1236#true} is VALID [2022-04-27 14:28:41,821 INFO L290 TraceCheckUtils]: 9: Hoare triple {1236#true} assume true; {1236#true} is VALID [2022-04-27 14:28:41,821 INFO L290 TraceCheckUtils]: 8: Hoare triple {1236#true} assume !(0 == ~cond); {1236#true} is VALID [2022-04-27 14:28:41,821 INFO L290 TraceCheckUtils]: 7: Hoare triple {1236#true} ~cond := #in~cond; {1236#true} is VALID [2022-04-27 14:28:41,821 INFO L272 TraceCheckUtils]: 6: Hoare triple {1236#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 100 then 1 else 0)); {1236#true} is VALID [2022-04-27 14:28:41,821 INFO L290 TraceCheckUtils]: 5: Hoare triple {1236#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4; {1236#true} is VALID [2022-04-27 14:28:41,822 INFO L272 TraceCheckUtils]: 4: Hoare triple {1236#true} call #t~ret6 := main(); {1236#true} is VALID [2022-04-27 14:28:41,822 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1236#true} {1236#true} #71#return; {1236#true} is VALID [2022-04-27 14:28:41,822 INFO L290 TraceCheckUtils]: 2: Hoare triple {1236#true} assume true; {1236#true} is VALID [2022-04-27 14:28:41,822 INFO L290 TraceCheckUtils]: 1: Hoare triple {1236#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); {1236#true} is VALID [2022-04-27 14:28:41,822 INFO L272 TraceCheckUtils]: 0: Hoare triple {1236#true} call ULTIMATE.init(); {1236#true} is VALID [2022-04-27 14:28:41,822 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-27 14:28:41,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:28:41,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066019151] [2022-04-27 14:28:41,823 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:28:41,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1283273956] [2022-04-27 14:28:41,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1283273956] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 14:28:41,823 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 14:28:41,823 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 19 [2022-04-27 14:28:41,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594318883] [2022-04-27 14:28:41,823 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 14:28:41,824 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 16 states have internal predecessors, (32), 5 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) Word has length 37 [2022-04-27 14:28:41,824 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:28:41,824 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 16 states have internal predecessors, (32), 5 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-27 14:28:41,865 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 14:28:41,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-27 14:28:41,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:28:41,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-27 14:28:41,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2022-04-27 14:28:41,866 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 16 states have internal predecessors, (32), 5 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-27 14:28:43,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:28:43,935 INFO L93 Difference]: Finished difference Result 68 states and 81 transitions. [2022-04-27 14:28:43,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-27 14:28:43,935 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 16 states have internal predecessors, (32), 5 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) Word has length 37 [2022-04-27 14:28:43,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:28:43,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 16 states have internal predecessors, (32), 5 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-27 14:28:43,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 67 transitions. [2022-04-27 14:28:43,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 16 states have internal predecessors, (32), 5 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-27 14:28:43,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 67 transitions. [2022-04-27 14:28:43,939 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 67 transitions. [2022-04-27 14:28:44,002 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:28:44,003 INFO L225 Difference]: With dead ends: 68 [2022-04-27 14:28:44,003 INFO L226 Difference]: Without dead ends: 61 [2022-04-27 14:28:44,004 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 54 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=122, Invalid=528, Unknown=0, NotChecked=0, Total=650 [2022-04-27 14:28:44,004 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 39 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-27 14:28:44,005 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 160 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-27 14:28:44,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-04-27 14:28:44,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2022-04-27 14:28:44,023 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:28:44,024 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand has 61 states, 42 states have (on average 1.2142857142857142) internal successors, (51), 44 states have internal predecessors, (51), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 14:28:44,024 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand has 61 states, 42 states have (on average 1.2142857142857142) internal successors, (51), 44 states have internal predecessors, (51), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 14:28:44,024 INFO L87 Difference]: Start difference. First operand 61 states. Second operand has 61 states, 42 states have (on average 1.2142857142857142) internal successors, (51), 44 states have internal predecessors, (51), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 14:28:44,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:28:44,026 INFO L93 Difference]: Finished difference Result 61 states and 73 transitions. [2022-04-27 14:28:44,026 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 73 transitions. [2022-04-27 14:28:44,026 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:28:44,026 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:28:44,026 INFO L74 IsIncluded]: Start isIncluded. First operand has 61 states, 42 states have (on average 1.2142857142857142) internal successors, (51), 44 states have internal predecessors, (51), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand 61 states. [2022-04-27 14:28:44,027 INFO L87 Difference]: Start difference. First operand has 61 states, 42 states have (on average 1.2142857142857142) internal successors, (51), 44 states have internal predecessors, (51), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand 61 states. [2022-04-27 14:28:44,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:28:44,028 INFO L93 Difference]: Finished difference Result 61 states and 73 transitions. [2022-04-27 14:28:44,028 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 73 transitions. [2022-04-27 14:28:44,029 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:28:44,029 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:28:44,029 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:28:44,029 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:28:44,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 42 states have (on average 1.2142857142857142) internal successors, (51), 44 states have internal predecessors, (51), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 14:28:44,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 73 transitions. [2022-04-27 14:28:44,031 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 73 transitions. Word has length 37 [2022-04-27 14:28:44,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:28:44,031 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 73 transitions. [2022-04-27 14:28:44,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 16 states have internal predecessors, (32), 5 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-27 14:28:44,031 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 73 transitions. [2022-04-27 14:28:44,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-27 14:28:44,032 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:28:44,032 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 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 14:28:44,053 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-27 14:28:44,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:28:44,247 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:28:44,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:28:44,248 INFO L85 PathProgramCache]: Analyzing trace with hash -1351630086, now seen corresponding path program 1 times [2022-04-27 14:28:44,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:28:44,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873198481] [2022-04-27 14:28:44,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:28:44,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:28:44,259 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:28:44,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [756130730] [2022-04-27 14:28:44,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:28:44,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:28:44,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:28:44,260 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 14:28:44,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-27 14:28:44,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:28:44,294 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-27 14:28:44,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:28:44,302 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:28:50,874 INFO L272 TraceCheckUtils]: 0: Hoare triple {1793#true} call ULTIMATE.init(); {1793#true} is VALID [2022-04-27 14:28:50,874 INFO L290 TraceCheckUtils]: 1: Hoare triple {1793#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); {1793#true} is VALID [2022-04-27 14:28:50,874 INFO L290 TraceCheckUtils]: 2: Hoare triple {1793#true} assume true; {1793#true} is VALID [2022-04-27 14:28:50,874 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1793#true} {1793#true} #71#return; {1793#true} is VALID [2022-04-27 14:28:50,874 INFO L272 TraceCheckUtils]: 4: Hoare triple {1793#true} call #t~ret6 := main(); {1793#true} is VALID [2022-04-27 14:28:50,874 INFO L290 TraceCheckUtils]: 5: Hoare triple {1793#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4; {1793#true} is VALID [2022-04-27 14:28:50,875 INFO L272 TraceCheckUtils]: 6: Hoare triple {1793#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 100 then 1 else 0)); {1793#true} is VALID [2022-04-27 14:28:50,875 INFO L290 TraceCheckUtils]: 7: Hoare triple {1793#true} ~cond := #in~cond; {1793#true} is VALID [2022-04-27 14:28:50,875 INFO L290 TraceCheckUtils]: 8: Hoare triple {1793#true} assume !(0 == ~cond); {1793#true} is VALID [2022-04-27 14:28:50,875 INFO L290 TraceCheckUtils]: 9: Hoare triple {1793#true} assume true; {1793#true} is VALID [2022-04-27 14:28:50,875 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1793#true} {1793#true} #61#return; {1793#true} is VALID [2022-04-27 14:28:50,875 INFO L290 TraceCheckUtils]: 11: Hoare triple {1793#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {1793#true} is VALID [2022-04-27 14:28:50,875 INFO L272 TraceCheckUtils]: 12: Hoare triple {1793#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 100 then 1 else 0)); {1793#true} is VALID [2022-04-27 14:28:50,875 INFO L290 TraceCheckUtils]: 13: Hoare triple {1793#true} ~cond := #in~cond; {1793#true} is VALID [2022-04-27 14:28:50,875 INFO L290 TraceCheckUtils]: 14: Hoare triple {1793#true} assume !(0 == ~cond); {1793#true} is VALID [2022-04-27 14:28:50,875 INFO L290 TraceCheckUtils]: 15: Hoare triple {1793#true} assume true; {1793#true} is VALID [2022-04-27 14:28:50,875 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1793#true} {1793#true} #63#return; {1793#true} is VALID [2022-04-27 14:28:50,875 INFO L272 TraceCheckUtils]: 17: Hoare triple {1793#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {1793#true} is VALID [2022-04-27 14:28:50,876 INFO L290 TraceCheckUtils]: 18: Hoare triple {1793#true} ~cond := #in~cond; {1793#true} is VALID [2022-04-27 14:28:50,876 INFO L290 TraceCheckUtils]: 19: Hoare triple {1793#true} assume !(0 == ~cond); {1793#true} is VALID [2022-04-27 14:28:50,876 INFO L290 TraceCheckUtils]: 20: Hoare triple {1793#true} assume true; {1793#true} is VALID [2022-04-27 14:28:50,876 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1793#true} {1793#true} #65#return; {1793#true} is VALID [2022-04-27 14:28:50,876 INFO L290 TraceCheckUtils]: 22: Hoare triple {1793#true} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {1793#true} is VALID [2022-04-27 14:28:50,876 INFO L290 TraceCheckUtils]: 23: Hoare triple {1793#true} assume !false; {1793#true} is VALID [2022-04-27 14:28:50,876 INFO L272 TraceCheckUtils]: 24: Hoare triple {1793#true} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {1793#true} is VALID [2022-04-27 14:28:50,876 INFO L290 TraceCheckUtils]: 25: Hoare triple {1793#true} ~cond := #in~cond; {1793#true} is VALID [2022-04-27 14:28:50,876 INFO L290 TraceCheckUtils]: 26: Hoare triple {1793#true} assume !(0 == ~cond); {1793#true} is VALID [2022-04-27 14:28:50,876 INFO L290 TraceCheckUtils]: 27: Hoare triple {1793#true} assume true; {1793#true} is VALID [2022-04-27 14:28:50,876 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1793#true} {1793#true} #67#return; {1793#true} is VALID [2022-04-27 14:28:50,876 INFO L290 TraceCheckUtils]: 29: Hoare triple {1793#true} assume !!(0 != ~y~0); {1793#true} is VALID [2022-04-27 14:28:50,877 INFO L290 TraceCheckUtils]: 30: Hoare triple {1793#true} assume 1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2);~z~0 := ~z~0 + ~x~0;~y~0 := ~y~0 - 1; {1793#true} is VALID [2022-04-27 14:28:50,877 INFO L290 TraceCheckUtils]: 31: Hoare triple {1793#true} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {1793#true} is VALID [2022-04-27 14:28:50,877 INFO L290 TraceCheckUtils]: 32: Hoare triple {1793#true} assume !false; {1793#true} is VALID [2022-04-27 14:28:50,877 INFO L272 TraceCheckUtils]: 33: Hoare triple {1793#true} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {1793#true} is VALID [2022-04-27 14:28:50,877 INFO L290 TraceCheckUtils]: 34: Hoare triple {1793#true} ~cond := #in~cond; {1900#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:28:50,878 INFO L290 TraceCheckUtils]: 35: Hoare triple {1900#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {1904#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:28:50,878 INFO L290 TraceCheckUtils]: 36: Hoare triple {1904#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1904#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:28:52,880 WARN L284 TraceCheckUtils]: 37: Hoare quadruple {1904#(not (= |__VERIFIER_assert_#in~cond| 0))} {1793#true} #67#return; {1911#(or (and (not (= main_~y~0 0)) (= (mod (+ (* (- 1) main_~z~0) (* main_~b~0 main_~a~0)) main_~y~0) 0)) (= (+ (* (- 1) main_~z~0) (* main_~b~0 main_~a~0)) 0))} is UNKNOWN [2022-04-27 14:28:52,881 INFO L290 TraceCheckUtils]: 38: Hoare triple {1911#(or (and (not (= main_~y~0 0)) (= (mod (+ (* (- 1) main_~z~0) (* main_~b~0 main_~a~0)) main_~y~0) 0)) (= (+ (* (- 1) main_~z~0) (* main_~b~0 main_~a~0)) 0))} assume !(0 != ~y~0); {1915#(= main_~z~0 (* main_~b~0 main_~a~0))} is VALID [2022-04-27 14:28:52,882 INFO L272 TraceCheckUtils]: 39: Hoare triple {1915#(= main_~z~0 (* main_~b~0 main_~a~0))} call __VERIFIER_assert((if ~z~0 == ~a~0 * ~b~0 then 1 else 0)); {1919#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:28:52,882 INFO L290 TraceCheckUtils]: 40: Hoare triple {1919#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1923#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:28:52,882 INFO L290 TraceCheckUtils]: 41: Hoare triple {1923#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1794#false} is VALID [2022-04-27 14:28:52,882 INFO L290 TraceCheckUtils]: 42: Hoare triple {1794#false} assume !false; {1794#false} is VALID [2022-04-27 14:28:52,883 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-27 14:28:52,883 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:29:06,285 INFO L290 TraceCheckUtils]: 42: Hoare triple {1794#false} assume !false; {1794#false} is VALID [2022-04-27 14:29:06,285 INFO L290 TraceCheckUtils]: 41: Hoare triple {1923#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1794#false} is VALID [2022-04-27 14:29:06,285 INFO L290 TraceCheckUtils]: 40: Hoare triple {1919#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1923#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:29:06,286 INFO L272 TraceCheckUtils]: 39: Hoare triple {1915#(= main_~z~0 (* main_~b~0 main_~a~0))} call __VERIFIER_assert((if ~z~0 == ~a~0 * ~b~0 then 1 else 0)); {1919#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:29:06,286 INFO L290 TraceCheckUtils]: 38: Hoare triple {1942#(or (not (= main_~y~0 0)) (= main_~z~0 (* main_~b~0 main_~a~0)))} assume !(0 != ~y~0); {1915#(= main_~z~0 (* main_~b~0 main_~a~0))} is VALID [2022-04-27 14:29:06,287 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {1904#(not (= |__VERIFIER_assert_#in~cond| 0))} {1793#true} #67#return; {1942#(or (not (= main_~y~0 0)) (= main_~z~0 (* main_~b~0 main_~a~0)))} is VALID [2022-04-27 14:29:06,287 INFO L290 TraceCheckUtils]: 36: Hoare triple {1904#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1904#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:29:06,288 INFO L290 TraceCheckUtils]: 35: Hoare triple {1955#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {1904#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:29:06,289 INFO L290 TraceCheckUtils]: 34: Hoare triple {1793#true} ~cond := #in~cond; {1955#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 14:29:06,289 INFO L272 TraceCheckUtils]: 33: Hoare triple {1793#true} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {1793#true} is VALID [2022-04-27 14:29:06,289 INFO L290 TraceCheckUtils]: 32: Hoare triple {1793#true} assume !false; {1793#true} is VALID [2022-04-27 14:29:06,289 INFO L290 TraceCheckUtils]: 31: Hoare triple {1793#true} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {1793#true} is VALID [2022-04-27 14:29:06,289 INFO L290 TraceCheckUtils]: 30: Hoare triple {1793#true} assume 1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2);~z~0 := ~z~0 + ~x~0;~y~0 := ~y~0 - 1; {1793#true} is VALID [2022-04-27 14:29:06,289 INFO L290 TraceCheckUtils]: 29: Hoare triple {1793#true} assume !!(0 != ~y~0); {1793#true} is VALID [2022-04-27 14:29:06,289 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1793#true} {1793#true} #67#return; {1793#true} is VALID [2022-04-27 14:29:06,289 INFO L290 TraceCheckUtils]: 27: Hoare triple {1793#true} assume true; {1793#true} is VALID [2022-04-27 14:29:06,290 INFO L290 TraceCheckUtils]: 26: Hoare triple {1793#true} assume !(0 == ~cond); {1793#true} is VALID [2022-04-27 14:29:06,290 INFO L290 TraceCheckUtils]: 25: Hoare triple {1793#true} ~cond := #in~cond; {1793#true} is VALID [2022-04-27 14:29:06,290 INFO L272 TraceCheckUtils]: 24: Hoare triple {1793#true} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {1793#true} is VALID [2022-04-27 14:29:06,290 INFO L290 TraceCheckUtils]: 23: Hoare triple {1793#true} assume !false; {1793#true} is VALID [2022-04-27 14:29:06,290 INFO L290 TraceCheckUtils]: 22: Hoare triple {1793#true} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {1793#true} is VALID [2022-04-27 14:29:06,290 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1793#true} {1793#true} #65#return; {1793#true} is VALID [2022-04-27 14:29:06,290 INFO L290 TraceCheckUtils]: 20: Hoare triple {1793#true} assume true; {1793#true} is VALID [2022-04-27 14:29:06,290 INFO L290 TraceCheckUtils]: 19: Hoare triple {1793#true} assume !(0 == ~cond); {1793#true} is VALID [2022-04-27 14:29:06,290 INFO L290 TraceCheckUtils]: 18: Hoare triple {1793#true} ~cond := #in~cond; {1793#true} is VALID [2022-04-27 14:29:06,290 INFO L272 TraceCheckUtils]: 17: Hoare triple {1793#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {1793#true} is VALID [2022-04-27 14:29:06,290 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1793#true} {1793#true} #63#return; {1793#true} is VALID [2022-04-27 14:29:06,290 INFO L290 TraceCheckUtils]: 15: Hoare triple {1793#true} assume true; {1793#true} is VALID [2022-04-27 14:29:06,291 INFO L290 TraceCheckUtils]: 14: Hoare triple {1793#true} assume !(0 == ~cond); {1793#true} is VALID [2022-04-27 14:29:06,291 INFO L290 TraceCheckUtils]: 13: Hoare triple {1793#true} ~cond := #in~cond; {1793#true} is VALID [2022-04-27 14:29:06,291 INFO L272 TraceCheckUtils]: 12: Hoare triple {1793#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 100 then 1 else 0)); {1793#true} is VALID [2022-04-27 14:29:06,291 INFO L290 TraceCheckUtils]: 11: Hoare triple {1793#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {1793#true} is VALID [2022-04-27 14:29:06,291 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1793#true} {1793#true} #61#return; {1793#true} is VALID [2022-04-27 14:29:06,291 INFO L290 TraceCheckUtils]: 9: Hoare triple {1793#true} assume true; {1793#true} is VALID [2022-04-27 14:29:06,291 INFO L290 TraceCheckUtils]: 8: Hoare triple {1793#true} assume !(0 == ~cond); {1793#true} is VALID [2022-04-27 14:29:06,291 INFO L290 TraceCheckUtils]: 7: Hoare triple {1793#true} ~cond := #in~cond; {1793#true} is VALID [2022-04-27 14:29:06,291 INFO L272 TraceCheckUtils]: 6: Hoare triple {1793#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 100 then 1 else 0)); {1793#true} is VALID [2022-04-27 14:29:06,291 INFO L290 TraceCheckUtils]: 5: Hoare triple {1793#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4; {1793#true} is VALID [2022-04-27 14:29:06,291 INFO L272 TraceCheckUtils]: 4: Hoare triple {1793#true} call #t~ret6 := main(); {1793#true} is VALID [2022-04-27 14:29:06,291 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1793#true} {1793#true} #71#return; {1793#true} is VALID [2022-04-27 14:29:06,291 INFO L290 TraceCheckUtils]: 2: Hoare triple {1793#true} assume true; {1793#true} is VALID [2022-04-27 14:29:06,292 INFO L290 TraceCheckUtils]: 1: Hoare triple {1793#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); {1793#true} is VALID [2022-04-27 14:29:06,292 INFO L272 TraceCheckUtils]: 0: Hoare triple {1793#true} call ULTIMATE.init(); {1793#true} is VALID [2022-04-27 14:29:06,292 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-27 14:29:06,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:29:06,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873198481] [2022-04-27 14:29:06,292 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:29:06,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [756130730] [2022-04-27 14:29:06,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [756130730] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 14:29:06,292 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 14:29:06,292 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-04-27 14:29:06,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966176976] [2022-04-27 14:29:06,293 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 14:29:06,293 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 7 states have internal predecessors, (25), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 3 states have call predecessors, (7), 1 states have call successors, (7) Word has length 43 [2022-04-27 14:29:06,293 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:29:06,293 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 7 states have internal predecessors, (25), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 3 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-27 14:29:08,324 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 38 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-27 14:29:08,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-27 14:29:08,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:29:08,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-27 14:29:08,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-27 14:29:08,325 INFO L87 Difference]: Start difference. First operand 61 states and 73 transitions. Second operand has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 7 states have internal predecessors, (25), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 3 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-27 14:29:10,370 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 14:29:10,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:29:10,566 INFO L93 Difference]: Finished difference Result 68 states and 79 transitions. [2022-04-27 14:29:10,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 14:29:10,566 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 7 states have internal predecessors, (25), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 3 states have call predecessors, (7), 1 states have call successors, (7) Word has length 43 [2022-04-27 14:29:10,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:29:10,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 7 states have internal predecessors, (25), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 3 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-27 14:29:10,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 40 transitions. [2022-04-27 14:29:10,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 7 states have internal predecessors, (25), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 3 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-27 14:29:10,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 40 transitions. [2022-04-27 14:29:10,568 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 40 transitions. [2022-04-27 14:29:14,598 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 38 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-27 14:29:14,599 INFO L225 Difference]: With dead ends: 68 [2022-04-27 14:29:14,599 INFO L226 Difference]: Without dead ends: 61 [2022-04-27 14:29:14,600 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-04-27 14:29:14,600 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 17 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-04-27 14:29:14,600 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 122 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 69 Invalid, 1 Unknown, 0 Unchecked, 2.1s Time] [2022-04-27 14:29:14,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-04-27 14:29:14,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2022-04-27 14:29:14,616 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:29:14,616 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand has 60 states, 42 states have (on average 1.1428571428571428) internal successors, (48), 43 states have internal predecessors, (48), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 14:29:14,616 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand has 60 states, 42 states have (on average 1.1428571428571428) internal successors, (48), 43 states have internal predecessors, (48), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 14:29:14,616 INFO L87 Difference]: Start difference. First operand 61 states. Second operand has 60 states, 42 states have (on average 1.1428571428571428) internal successors, (48), 43 states have internal predecessors, (48), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 14:29:14,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:29:14,618 INFO L93 Difference]: Finished difference Result 61 states and 70 transitions. [2022-04-27 14:29:14,618 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 70 transitions. [2022-04-27 14:29:14,618 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:29:14,618 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:29:14,618 INFO L74 IsIncluded]: Start isIncluded. First operand has 60 states, 42 states have (on average 1.1428571428571428) internal successors, (48), 43 states have internal predecessors, (48), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand 61 states. [2022-04-27 14:29:14,619 INFO L87 Difference]: Start difference. First operand has 60 states, 42 states have (on average 1.1428571428571428) internal successors, (48), 43 states have internal predecessors, (48), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand 61 states. [2022-04-27 14:29:14,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:29:14,620 INFO L93 Difference]: Finished difference Result 61 states and 70 transitions. [2022-04-27 14:29:14,620 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 70 transitions. [2022-04-27 14:29:14,620 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:29:14,620 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:29:14,620 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:29:14,620 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:29:14,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 42 states have (on average 1.1428571428571428) internal successors, (48), 43 states have internal predecessors, (48), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 14:29:14,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 69 transitions. [2022-04-27 14:29:14,622 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 69 transitions. Word has length 43 [2022-04-27 14:29:14,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:29:14,622 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 69 transitions. [2022-04-27 14:29:14,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 7 states have internal predecessors, (25), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 3 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-27 14:29:14,622 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 69 transitions. [2022-04-27 14:29:14,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-04-27 14:29:14,623 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:29:14,623 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:29:14,647 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-27 14:29:14,847 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 14:29:14,847 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:29:14,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:29:14,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1494691206, now seen corresponding path program 1 times [2022-04-27 14:29:14,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:29:14,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821392150] [2022-04-27 14:29:14,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:29:14,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:29:14,865 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:29:14,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [406781818] [2022-04-27 14:29:14,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:29:14,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:29:14,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:29:14,866 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 14:29:14,867 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 14:29:14,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:29:14,902 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-27 14:29:14,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:29:14,918 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:29:46,680 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-27 14:30:17,866 INFO L272 TraceCheckUtils]: 0: Hoare triple {2364#true} call ULTIMATE.init(); {2364#true} is VALID [2022-04-27 14:30:17,866 INFO L290 TraceCheckUtils]: 1: Hoare triple {2364#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); {2364#true} is VALID [2022-04-27 14:30:17,866 INFO L290 TraceCheckUtils]: 2: Hoare triple {2364#true} assume true; {2364#true} is VALID [2022-04-27 14:30:17,866 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2364#true} {2364#true} #71#return; {2364#true} is VALID [2022-04-27 14:30:17,867 INFO L272 TraceCheckUtils]: 4: Hoare triple {2364#true} call #t~ret6 := main(); {2364#true} is VALID [2022-04-27 14:30:17,867 INFO L290 TraceCheckUtils]: 5: Hoare triple {2364#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4; {2364#true} is VALID [2022-04-27 14:30:17,867 INFO L272 TraceCheckUtils]: 6: Hoare triple {2364#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 100 then 1 else 0)); {2364#true} is VALID [2022-04-27 14:30:17,867 INFO L290 TraceCheckUtils]: 7: Hoare triple {2364#true} ~cond := #in~cond; {2364#true} is VALID [2022-04-27 14:30:17,867 INFO L290 TraceCheckUtils]: 8: Hoare triple {2364#true} assume !(0 == ~cond); {2364#true} is VALID [2022-04-27 14:30:17,867 INFO L290 TraceCheckUtils]: 9: Hoare triple {2364#true} assume true; {2364#true} is VALID [2022-04-27 14:30:17,867 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2364#true} {2364#true} #61#return; {2364#true} is VALID [2022-04-27 14:30:17,867 INFO L290 TraceCheckUtils]: 11: Hoare triple {2364#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {2364#true} is VALID [2022-04-27 14:30:17,867 INFO L272 TraceCheckUtils]: 12: Hoare triple {2364#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 100 then 1 else 0)); {2364#true} is VALID [2022-04-27 14:30:17,867 INFO L290 TraceCheckUtils]: 13: Hoare triple {2364#true} ~cond := #in~cond; {2364#true} is VALID [2022-04-27 14:30:17,867 INFO L290 TraceCheckUtils]: 14: Hoare triple {2364#true} assume !(0 == ~cond); {2364#true} is VALID [2022-04-27 14:30:17,867 INFO L290 TraceCheckUtils]: 15: Hoare triple {2364#true} assume true; {2364#true} is VALID [2022-04-27 14:30:17,867 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2364#true} {2364#true} #63#return; {2364#true} is VALID [2022-04-27 14:30:17,868 INFO L272 TraceCheckUtils]: 17: Hoare triple {2364#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {2364#true} is VALID [2022-04-27 14:30:17,868 INFO L290 TraceCheckUtils]: 18: Hoare triple {2364#true} ~cond := #in~cond; {2364#true} is VALID [2022-04-27 14:30:17,868 INFO L290 TraceCheckUtils]: 19: Hoare triple {2364#true} assume !(0 == ~cond); {2364#true} is VALID [2022-04-27 14:30:17,868 INFO L290 TraceCheckUtils]: 20: Hoare triple {2364#true} assume true; {2364#true} is VALID [2022-04-27 14:30:17,868 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2364#true} {2364#true} #65#return; {2364#true} is VALID [2022-04-27 14:30:17,868 INFO L290 TraceCheckUtils]: 22: Hoare triple {2364#true} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {2435#(= main_~a~0 main_~x~0)} is VALID [2022-04-27 14:30:17,869 INFO L290 TraceCheckUtils]: 23: Hoare triple {2435#(= main_~a~0 main_~x~0)} assume !false; {2435#(= main_~a~0 main_~x~0)} is VALID [2022-04-27 14:30:17,869 INFO L272 TraceCheckUtils]: 24: Hoare triple {2435#(= main_~a~0 main_~x~0)} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {2364#true} is VALID [2022-04-27 14:30:17,869 INFO L290 TraceCheckUtils]: 25: Hoare triple {2364#true} ~cond := #in~cond; {2364#true} is VALID [2022-04-27 14:30:17,869 INFO L290 TraceCheckUtils]: 26: Hoare triple {2364#true} assume !(0 == ~cond); {2364#true} is VALID [2022-04-27 14:30:17,869 INFO L290 TraceCheckUtils]: 27: Hoare triple {2364#true} assume true; {2364#true} is VALID [2022-04-27 14:30:17,869 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2364#true} {2435#(= main_~a~0 main_~x~0)} #67#return; {2435#(= main_~a~0 main_~x~0)} is VALID [2022-04-27 14:30:17,870 INFO L290 TraceCheckUtils]: 29: Hoare triple {2435#(= main_~a~0 main_~x~0)} assume !!(0 != ~y~0); {2457#(and (not (= main_~y~0 0)) (= main_~a~0 main_~x~0))} is VALID [2022-04-27 14:30:17,871 INFO L290 TraceCheckUtils]: 30: Hoare triple {2457#(and (not (= main_~y~0 0)) (= main_~a~0 main_~x~0))} assume 1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2);~z~0 := ~z~0 + ~x~0;~y~0 := ~y~0 - 1; {2461#(and (< 0 (+ main_~y~0 1)) (= main_~a~0 main_~x~0))} is VALID [2022-04-27 14:30:17,871 INFO L290 TraceCheckUtils]: 31: Hoare triple {2461#(and (< 0 (+ main_~y~0 1)) (= main_~a~0 main_~x~0))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {2465#(and (= (* main_~a~0 2) main_~x~0) (< 0 (+ main_~y~0 1)))} is VALID [2022-04-27 14:30:17,872 INFO L290 TraceCheckUtils]: 32: Hoare triple {2465#(and (= (* main_~a~0 2) main_~x~0) (< 0 (+ main_~y~0 1)))} assume !false; {2465#(and (= (* main_~a~0 2) main_~x~0) (< 0 (+ main_~y~0 1)))} is VALID [2022-04-27 14:30:17,872 INFO L272 TraceCheckUtils]: 33: Hoare triple {2465#(and (= (* main_~a~0 2) main_~x~0) (< 0 (+ main_~y~0 1)))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {2364#true} is VALID [2022-04-27 14:30:17,873 INFO L290 TraceCheckUtils]: 34: Hoare triple {2364#true} ~cond := #in~cond; {2475#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:30:17,874 INFO L290 TraceCheckUtils]: 35: Hoare triple {2475#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {2479#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:30:17,878 INFO L290 TraceCheckUtils]: 36: Hoare triple {2479#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2479#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:30:17,879 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {2479#(not (= |__VERIFIER_assert_#in~cond| 0))} {2465#(and (= (* main_~a~0 2) main_~x~0) (< 0 (+ main_~y~0 1)))} #67#return; {2486#(and (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (= (* main_~a~0 2) main_~x~0) (< 0 (+ main_~y~0 1)))} is VALID [2022-04-27 14:30:17,880 INFO L290 TraceCheckUtils]: 38: Hoare triple {2486#(and (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (= (* main_~a~0 2) main_~x~0) (< 0 (+ main_~y~0 1)))} assume !!(0 != ~y~0); {2486#(and (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (= (* main_~a~0 2) main_~x~0) (< 0 (+ main_~y~0 1)))} is VALID [2022-04-27 14:30:17,880 INFO L290 TraceCheckUtils]: 39: Hoare triple {2486#(and (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (= (* main_~a~0 2) main_~x~0) (< 0 (+ main_~y~0 1)))} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {2493#(and (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 1)) (= (* main_~a~0 2) main_~x~0) (< 0 (+ main_~y~0 1)))} is VALID [2022-04-27 14:30:17,883 INFO L290 TraceCheckUtils]: 40: Hoare triple {2493#(and (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 1)) (= (* main_~a~0 2) main_~x~0) (< 0 (+ main_~y~0 1)))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {2497#(and (= (* main_~a~0 4) main_~x~0) (exists ((aux_mod_v_main_~y~0_26_22 Int) (aux_div_v_main_~y~0_26_22 Int)) (and (not (= aux_mod_v_main_~y~0_26_22 1)) (< 0 (+ (* aux_div_v_main_~y~0_26_22 2) aux_mod_v_main_~y~0_26_22 1)) (<= 0 aux_mod_v_main_~y~0_26_22) (= main_~y~0 (div (+ (* aux_div_v_main_~y~0_26_22 2) aux_mod_v_main_~y~0_26_22) 2)) (= (+ (* (* main_~a~0 2) (+ (* aux_div_v_main_~y~0_26_22 2) aux_mod_v_main_~y~0_26_22)) main_~z~0) (* main_~b~0 main_~a~0)) (< aux_mod_v_main_~y~0_26_22 2))))} is VALID [2022-04-27 14:30:18,222 INFO L290 TraceCheckUtils]: 41: Hoare triple {2497#(and (= (* main_~a~0 4) main_~x~0) (exists ((aux_mod_v_main_~y~0_26_22 Int) (aux_div_v_main_~y~0_26_22 Int)) (and (not (= aux_mod_v_main_~y~0_26_22 1)) (< 0 (+ (* aux_div_v_main_~y~0_26_22 2) aux_mod_v_main_~y~0_26_22 1)) (<= 0 aux_mod_v_main_~y~0_26_22) (= main_~y~0 (div (+ (* aux_div_v_main_~y~0_26_22 2) aux_mod_v_main_~y~0_26_22) 2)) (= (+ (* (* main_~a~0 2) (+ (* aux_div_v_main_~y~0_26_22 2) aux_mod_v_main_~y~0_26_22)) main_~z~0) (* main_~b~0 main_~a~0)) (< aux_mod_v_main_~y~0_26_22 2))))} assume !false; {2501#(and (= (mod (+ main_~z~0 (* main_~a~0 main_~y~0 (- 4)) (* main_~b~0 main_~a~0)) 2) 0) (= (* main_~a~0 4) main_~x~0) (= (div (+ (* (- 1) main_~z~0) (* main_~b~0 main_~a~0)) 2) (* 2 (* main_~a~0 main_~y~0))) (< 0 (+ main_~y~0 1)))} is VALID [2022-04-27 14:30:18,516 INFO L272 TraceCheckUtils]: 42: Hoare triple {2501#(and (= (mod (+ main_~z~0 (* main_~a~0 main_~y~0 (- 4)) (* main_~b~0 main_~a~0)) 2) 0) (= (* main_~a~0 4) main_~x~0) (= (div (+ (* (- 1) main_~z~0) (* main_~b~0 main_~a~0)) 2) (* 2 (* main_~a~0 main_~y~0))) (< 0 (+ main_~y~0 1)))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {2505#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:30:18,516 INFO L290 TraceCheckUtils]: 43: Hoare triple {2505#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2509#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:30:18,517 INFO L290 TraceCheckUtils]: 44: Hoare triple {2509#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2365#false} is VALID [2022-04-27 14:30:18,517 INFO L290 TraceCheckUtils]: 45: Hoare triple {2365#false} assume !false; {2365#false} is VALID [2022-04-27 14:30:18,517 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-04-27 14:30:18,517 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:30:38,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:30:38,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821392150] [2022-04-27 14:30:38,328 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:30:38,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [406781818] [2022-04-27 14:30:38,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [406781818] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:30:38,329 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:30:38,329 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2022-04-27 14:30:38,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20299744] [2022-04-27 14:30:38,329 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:30:38,329 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 46 [2022-04-27 14:30:38,329 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:30:38,330 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-27 14:30:40,772 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 39 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-27 14:30:40,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-27 14:30:40,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:30:40,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-27 14:30:40,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=248, Unknown=1, NotChecked=0, Total=306 [2022-04-27 14:30:40,773 INFO L87 Difference]: Start difference. First operand 60 states and 69 transitions. Second operand has 14 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-27 14:30:48,418 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 14:30:53,145 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 14:30:56,447 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 14:30:58,449 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 14:31:00,452 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 14:31:02,462 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 14:31:05,739 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 14:31:05,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:31:05,804 INFO L93 Difference]: Finished difference Result 88 states and 101 transitions. [2022-04-27 14:31:05,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-27 14:31:05,804 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 46 [2022-04-27 14:31:05,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:31:05,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-27 14:31:05,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 56 transitions. [2022-04-27 14:31:05,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-27 14:31:05,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 56 transitions. [2022-04-27 14:31:05,806 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 56 transitions. [2022-04-27 14:31:07,777 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:31:07,778 INFO L225 Difference]: With dead ends: 88 [2022-04-27 14:31:07,779 INFO L226 Difference]: Without dead ends: 86 [2022-04-27 14:31:07,779 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=68, Invalid=311, Unknown=1, NotChecked=0, Total=380 [2022-04-27 14:31:07,779 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 17 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 5 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.4s IncrementalHoareTripleChecker+Time [2022-04-27 14:31:07,780 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 214 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 225 Invalid, 4 Unknown, 0 Unchecked, 15.4s Time] [2022-04-27 14:31:07,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-04-27 14:31:07,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 79. [2022-04-27 14:31:07,811 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:31:07,811 INFO L82 GeneralOperation]: Start isEquivalent. First operand 86 states. Second operand has 79 states, 56 states have (on average 1.125) internal successors, (63), 59 states have internal predecessors, (63), 14 states have call successors, (14), 9 states have call predecessors, (14), 8 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 14:31:07,812 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand has 79 states, 56 states have (on average 1.125) internal successors, (63), 59 states have internal predecessors, (63), 14 states have call successors, (14), 9 states have call predecessors, (14), 8 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 14:31:07,812 INFO L87 Difference]: Start difference. First operand 86 states. Second operand has 79 states, 56 states have (on average 1.125) internal successors, (63), 59 states have internal predecessors, (63), 14 states have call successors, (14), 9 states have call predecessors, (14), 8 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 14:31:07,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:31:07,814 INFO L93 Difference]: Finished difference Result 86 states and 99 transitions. [2022-04-27 14:31:07,814 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 99 transitions. [2022-04-27 14:31:07,814 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:31:07,814 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:31:07,814 INFO L74 IsIncluded]: Start isIncluded. First operand has 79 states, 56 states have (on average 1.125) internal successors, (63), 59 states have internal predecessors, (63), 14 states have call successors, (14), 9 states have call predecessors, (14), 8 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) Second operand 86 states. [2022-04-27 14:31:07,815 INFO L87 Difference]: Start difference. First operand has 79 states, 56 states have (on average 1.125) internal successors, (63), 59 states have internal predecessors, (63), 14 states have call successors, (14), 9 states have call predecessors, (14), 8 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) Second operand 86 states. [2022-04-27 14:31:07,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:31:07,816 INFO L93 Difference]: Finished difference Result 86 states and 99 transitions. [2022-04-27 14:31:07,816 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 99 transitions. [2022-04-27 14:31:07,817 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:31:07,817 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:31:07,817 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:31:07,817 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:31:07,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 56 states have (on average 1.125) internal successors, (63), 59 states have internal predecessors, (63), 14 states have call successors, (14), 9 states have call predecessors, (14), 8 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 14:31:07,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 90 transitions. [2022-04-27 14:31:07,821 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 90 transitions. Word has length 46 [2022-04-27 14:31:07,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:31:07,821 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 90 transitions. [2022-04-27 14:31:07,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-27 14:31:07,821 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 90 transitions. [2022-04-27 14:31:07,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-27 14:31:07,822 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:31:07,822 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:31:07,838 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-04-27 14:31:08,033 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 14:31:08,033 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:31:08,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:31:08,034 INFO L85 PathProgramCache]: Analyzing trace with hash -1459553868, now seen corresponding path program 2 times [2022-04-27 14:31:08,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:31:08,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535173299] [2022-04-27 14:31:08,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:31:08,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:31:08,044 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:31:08,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1059388869] [2022-04-27 14:31:08,044 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 14:31:08,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:31:08,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:31:08,045 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 14:31:08,046 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-27 14:31:08,140 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 14:31:08,140 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:31:08,142 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 51 conjunts are in the unsatisfiable core [2022-04-27 14:31:08,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:31:08,162 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:31:48,098 INFO L272 TraceCheckUtils]: 0: Hoare triple {2954#true} call ULTIMATE.init(); {2954#true} is VALID [2022-04-27 14:31:48,098 INFO L290 TraceCheckUtils]: 1: Hoare triple {2954#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); {2954#true} is VALID [2022-04-27 14:31:48,098 INFO L290 TraceCheckUtils]: 2: Hoare triple {2954#true} assume true; {2954#true} is VALID [2022-04-27 14:31:48,098 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2954#true} {2954#true} #71#return; {2954#true} is VALID [2022-04-27 14:31:48,098 INFO L272 TraceCheckUtils]: 4: Hoare triple {2954#true} call #t~ret6 := main(); {2954#true} is VALID [2022-04-27 14:31:48,098 INFO L290 TraceCheckUtils]: 5: Hoare triple {2954#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4; {2954#true} is VALID [2022-04-27 14:31:48,098 INFO L272 TraceCheckUtils]: 6: Hoare triple {2954#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 100 then 1 else 0)); {2954#true} is VALID [2022-04-27 14:31:48,099 INFO L290 TraceCheckUtils]: 7: Hoare triple {2954#true} ~cond := #in~cond; {2954#true} is VALID [2022-04-27 14:31:48,099 INFO L290 TraceCheckUtils]: 8: Hoare triple {2954#true} assume !(0 == ~cond); {2954#true} is VALID [2022-04-27 14:31:48,099 INFO L290 TraceCheckUtils]: 9: Hoare triple {2954#true} assume true; {2954#true} is VALID [2022-04-27 14:31:48,099 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2954#true} {2954#true} #61#return; {2954#true} is VALID [2022-04-27 14:31:48,099 INFO L290 TraceCheckUtils]: 11: Hoare triple {2954#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {2954#true} is VALID [2022-04-27 14:31:48,099 INFO L272 TraceCheckUtils]: 12: Hoare triple {2954#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 100 then 1 else 0)); {2954#true} is VALID [2022-04-27 14:31:48,099 INFO L290 TraceCheckUtils]: 13: Hoare triple {2954#true} ~cond := #in~cond; {2954#true} is VALID [2022-04-27 14:31:48,099 INFO L290 TraceCheckUtils]: 14: Hoare triple {2954#true} assume !(0 == ~cond); {2954#true} is VALID [2022-04-27 14:31:48,099 INFO L290 TraceCheckUtils]: 15: Hoare triple {2954#true} assume true; {2954#true} is VALID [2022-04-27 14:31:48,099 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2954#true} {2954#true} #63#return; {2954#true} is VALID [2022-04-27 14:31:48,099 INFO L272 TraceCheckUtils]: 17: Hoare triple {2954#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {2954#true} is VALID [2022-04-27 14:31:48,099 INFO L290 TraceCheckUtils]: 18: Hoare triple {2954#true} ~cond := #in~cond; {2954#true} is VALID [2022-04-27 14:31:48,099 INFO L290 TraceCheckUtils]: 19: Hoare triple {2954#true} assume !(0 == ~cond); {2954#true} is VALID [2022-04-27 14:31:48,099 INFO L290 TraceCheckUtils]: 20: Hoare triple {2954#true} assume true; {2954#true} is VALID [2022-04-27 14:31:48,099 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2954#true} {2954#true} #65#return; {2954#true} is VALID [2022-04-27 14:31:48,107 INFO L290 TraceCheckUtils]: 22: Hoare triple {2954#true} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {3025#(and (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-27 14:31:48,107 INFO L290 TraceCheckUtils]: 23: Hoare triple {3025#(and (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} assume !false; {3025#(and (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-27 14:31:48,108 INFO L272 TraceCheckUtils]: 24: Hoare triple {3025#(and (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {2954#true} is VALID [2022-04-27 14:31:48,108 INFO L290 TraceCheckUtils]: 25: Hoare triple {2954#true} ~cond := #in~cond; {3035#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:31:48,108 INFO L290 TraceCheckUtils]: 26: Hoare triple {3035#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {3039#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:31:48,108 INFO L290 TraceCheckUtils]: 27: Hoare triple {3039#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3039#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:31:48,109 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {3039#(not (= |__VERIFIER_assert_#in~cond| 0))} {3025#(and (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} #67#return; {3046#(and (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-27 14:31:48,110 INFO L290 TraceCheckUtils]: 29: Hoare triple {3046#(and (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} assume !!(0 != ~y~0); {3050#(and (not (= main_~y~0 0)) (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-27 14:31:48,111 INFO L290 TraceCheckUtils]: 30: Hoare triple {3050#(and (not (= main_~y~0 0)) (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} assume 1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2);~z~0 := ~z~0 + ~x~0;~y~0 := ~y~0 - 1; {3054#(and (<= 1 (mod (+ main_~y~0 1) 2)) (= main_~b~0 (+ main_~y~0 1)) (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (= main_~a~0 main_~x~0) (<= 0 (+ main_~y~0 1)))} is VALID [2022-04-27 14:31:48,113 INFO L290 TraceCheckUtils]: 31: Hoare triple {3054#(and (<= 1 (mod (+ main_~y~0 1) 2)) (= main_~b~0 (+ main_~y~0 1)) (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (= main_~a~0 main_~x~0) (<= 0 (+ main_~y~0 1)))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {3058#(and (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (= (* main_~b~0 main_~a~0) (+ main_~z~0 (* main_~a~0 (+ (- 1) main_~b~0)))) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} is VALID [2022-04-27 14:31:48,114 INFO L290 TraceCheckUtils]: 32: Hoare triple {3058#(and (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (= (* main_~b~0 main_~a~0) (+ main_~z~0 (* main_~a~0 (+ (- 1) main_~b~0)))) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} assume !false; {3058#(and (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (= (* main_~b~0 main_~a~0) (+ main_~z~0 (* main_~a~0 (+ (- 1) main_~b~0)))) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} is VALID [2022-04-27 14:31:48,114 INFO L272 TraceCheckUtils]: 33: Hoare triple {3058#(and (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (= (* main_~b~0 main_~a~0) (+ main_~z~0 (* main_~a~0 (+ (- 1) main_~b~0)))) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {2954#true} is VALID [2022-04-27 14:31:48,114 INFO L290 TraceCheckUtils]: 34: Hoare triple {2954#true} ~cond := #in~cond; {3035#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:31:48,114 INFO L290 TraceCheckUtils]: 35: Hoare triple {3035#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {3039#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:31:48,114 INFO L290 TraceCheckUtils]: 36: Hoare triple {3039#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3039#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:31:48,115 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {3039#(not (= |__VERIFIER_assert_#in~cond| 0))} {3058#(and (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (= (* main_~b~0 main_~a~0) (+ main_~z~0 (* main_~a~0 (+ (- 1) main_~b~0)))) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} #67#return; {3058#(and (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (= (* main_~b~0 main_~a~0) (+ main_~z~0 (* main_~a~0 (+ (- 1) main_~b~0)))) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} is VALID [2022-04-27 14:31:48,116 INFO L290 TraceCheckUtils]: 38: Hoare triple {3058#(and (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (= (* main_~b~0 main_~a~0) (+ main_~z~0 (* main_~a~0 (+ (- 1) main_~b~0)))) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} assume !!(0 != ~y~0); {3080#(and (not (= main_~y~0 0)) (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (= (* main_~b~0 main_~a~0) (+ main_~z~0 (* main_~a~0 (+ (- 1) main_~b~0)))) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} is VALID [2022-04-27 14:31:48,117 INFO L290 TraceCheckUtils]: 39: Hoare triple {3080#(and (not (= main_~y~0 0)) (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (= (* main_~b~0 main_~a~0) (+ main_~z~0 (* main_~a~0 (+ (- 1) main_~b~0)))) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} assume 1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2);~z~0 := ~z~0 + ~x~0;~y~0 := ~y~0 - 1; {3084#(and (<= 1 (mod main_~b~0 2)) (= (+ main_~a~0 main_~x~0) main_~z~0) (= (* main_~a~0 2) main_~x~0) (= (div (+ (- 1) main_~b~0) 2) (+ main_~y~0 1)) (<= 1 (mod (div (+ (- 1) main_~b~0) 2) 2)) (<= 0 main_~b~0))} is VALID [2022-04-27 14:31:48,118 INFO L290 TraceCheckUtils]: 40: Hoare triple {3084#(and (<= 1 (mod main_~b~0 2)) (= (+ main_~a~0 main_~x~0) main_~z~0) (= (* main_~a~0 2) main_~x~0) (= (div (+ (- 1) main_~b~0) 2) (+ main_~y~0 1)) (<= 1 (mod (div (+ (- 1) main_~b~0) 2) 2)) (<= 0 main_~b~0))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {3088#(and (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 4) main_~x~0) (= (* main_~a~0 3) main_~z~0) (= (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2) main_~y~0) (<= 1 (mod (div (+ (- 1) main_~b~0) 2) 2)) (<= 0 main_~b~0))} is VALID [2022-04-27 14:31:48,119 INFO L290 TraceCheckUtils]: 41: Hoare triple {3088#(and (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 4) main_~x~0) (= (* main_~a~0 3) main_~z~0) (= (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2) main_~y~0) (<= 1 (mod (div (+ (- 1) main_~b~0) 2) 2)) (<= 0 main_~b~0))} assume !false; {3088#(and (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 4) main_~x~0) (= (* main_~a~0 3) main_~z~0) (= (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2) main_~y~0) (<= 1 (mod (div (+ (- 1) main_~b~0) 2) 2)) (<= 0 main_~b~0))} is VALID [2022-04-27 14:31:48,119 INFO L272 TraceCheckUtils]: 42: Hoare triple {3088#(and (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 4) main_~x~0) (= (* main_~a~0 3) main_~z~0) (= (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2) main_~y~0) (<= 1 (mod (div (+ (- 1) main_~b~0) 2) 2)) (<= 0 main_~b~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {2954#true} is VALID [2022-04-27 14:31:48,119 INFO L290 TraceCheckUtils]: 43: Hoare triple {2954#true} ~cond := #in~cond; {3035#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:31:48,119 INFO L290 TraceCheckUtils]: 44: Hoare triple {3035#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {3039#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:31:48,120 INFO L290 TraceCheckUtils]: 45: Hoare triple {3039#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3039#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:31:48,120 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {3039#(not (= |__VERIFIER_assert_#in~cond| 0))} {3088#(and (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 4) main_~x~0) (= (* main_~a~0 3) main_~z~0) (= (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2) main_~y~0) (<= 1 (mod (div (+ (- 1) main_~b~0) 2) 2)) (<= 0 main_~b~0))} #67#return; {3088#(and (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 4) main_~x~0) (= (* main_~a~0 3) main_~z~0) (= (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2) main_~y~0) (<= 1 (mod (div (+ (- 1) main_~b~0) 2) 2)) (<= 0 main_~b~0))} is VALID [2022-04-27 14:31:48,121 INFO L290 TraceCheckUtils]: 47: Hoare triple {3088#(and (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 4) main_~x~0) (= (* main_~a~0 3) main_~z~0) (= (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2) main_~y~0) (<= 1 (mod (div (+ (- 1) main_~b~0) 2) 2)) (<= 0 main_~b~0))} assume !!(0 != ~y~0); {3088#(and (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 4) main_~x~0) (= (* main_~a~0 3) main_~z~0) (= (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2) main_~y~0) (<= 1 (mod (div (+ (- 1) main_~b~0) 2) 2)) (<= 0 main_~b~0))} is VALID [2022-04-27 14:31:48,122 INFO L290 TraceCheckUtils]: 48: Hoare triple {3088#(and (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 4) main_~x~0) (= (* main_~a~0 3) main_~z~0) (= (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2) main_~y~0) (<= 1 (mod (div (+ (- 1) main_~b~0) 2) 2)) (<= 0 main_~b~0))} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {3113#(and (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 4) main_~x~0) (not (= (mod main_~y~0 2) 1)) (= (* main_~a~0 3) main_~z~0) (= (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2) main_~y~0) (<= 1 (mod (div (+ (- 1) main_~b~0) 2) 2)) (<= 0 main_~b~0))} is VALID [2022-04-27 14:31:48,123 INFO L290 TraceCheckUtils]: 49: Hoare triple {3113#(and (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 4) main_~x~0) (not (= (mod main_~y~0 2) 1)) (= (* main_~a~0 3) main_~z~0) (= (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2) main_~y~0) (<= 1 (mod (div (+ (- 1) main_~b~0) 2) 2)) (<= 0 main_~b~0))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {3117#(and (<= 1 (mod main_~b~0 2)) (= (div (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2) 2) main_~y~0) (= main_~x~0 (* main_~a~0 8)) (= (* main_~a~0 3) main_~z~0) (not (= (mod (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2) 2) 1)) (<= 1 (mod (div (+ (- 1) main_~b~0) 2) 2)) (<= 0 main_~b~0))} is VALID [2022-04-27 14:31:48,124 INFO L290 TraceCheckUtils]: 50: Hoare triple {3117#(and (<= 1 (mod main_~b~0 2)) (= (div (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2) 2) main_~y~0) (= main_~x~0 (* main_~a~0 8)) (= (* main_~a~0 3) main_~z~0) (not (= (mod (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2) 2) 1)) (<= 1 (mod (div (+ (- 1) main_~b~0) 2) 2)) (<= 0 main_~b~0))} assume !false; {3117#(and (<= 1 (mod main_~b~0 2)) (= (div (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2) 2) main_~y~0) (= main_~x~0 (* main_~a~0 8)) (= (* main_~a~0 3) main_~z~0) (not (= (mod (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2) 2) 1)) (<= 1 (mod (div (+ (- 1) main_~b~0) 2) 2)) (<= 0 main_~b~0))} is VALID [2022-04-27 14:31:50,127 WARN L272 TraceCheckUtils]: 51: Hoare triple {3117#(and (<= 1 (mod main_~b~0 2)) (= (div (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2) 2) main_~y~0) (= main_~x~0 (* main_~a~0 8)) (= (* main_~a~0 3) main_~z~0) (not (= (mod (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2) 2) 1)) (<= 1 (mod (div (+ (- 1) main_~b~0) 2) 2)) (<= 0 main_~b~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {3124#(<= 1 |__VERIFIER_assert_#in~cond|)} is UNKNOWN [2022-04-27 14:31:50,127 INFO L290 TraceCheckUtils]: 52: Hoare triple {3124#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3128#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:31:50,128 INFO L290 TraceCheckUtils]: 53: Hoare triple {3128#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2955#false} is VALID [2022-04-27 14:31:50,128 INFO L290 TraceCheckUtils]: 54: Hoare triple {2955#false} assume !false; {2955#false} is VALID [2022-04-27 14:31:50,128 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 3 proven. 24 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-27 14:31:50,128 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:34:00,397 INFO L290 TraceCheckUtils]: 54: Hoare triple {2955#false} assume !false; {2955#false} is VALID [2022-04-27 14:34:00,398 INFO L290 TraceCheckUtils]: 53: Hoare triple {3128#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2955#false} is VALID [2022-04-27 14:34:00,398 INFO L290 TraceCheckUtils]: 52: Hoare triple {3124#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3128#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:34:00,399 INFO L272 TraceCheckUtils]: 51: Hoare triple {3144#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {3124#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:34:00,399 INFO L290 TraceCheckUtils]: 50: Hoare triple {3144#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} assume !false; {3144#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-27 14:34:00,404 INFO L290 TraceCheckUtils]: 49: Hoare triple {3151#(and (or (not (< main_~y~0 0)) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (and (not (= (mod main_~y~0 2) 0)) (< main_~y~0 0))))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {3144#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-27 14:34:00,405 INFO L290 TraceCheckUtils]: 48: Hoare triple {3155#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {3151#(and (or (not (< main_~y~0 0)) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (and (not (= (mod main_~y~0 2) 0)) (< main_~y~0 0))))} is VALID [2022-04-27 14:34:00,405 INFO L290 TraceCheckUtils]: 47: Hoare triple {3155#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} assume !!(0 != ~y~0); {3155#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} is VALID [2022-04-27 14:34:00,408 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {3039#(not (= |__VERIFIER_assert_#in~cond| 0))} {3162#(or (<= 0 main_~y~0) (not (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0)))} #67#return; {3155#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} is VALID [2022-04-27 14:34:00,408 INFO L290 TraceCheckUtils]: 45: Hoare triple {3039#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3039#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:34:00,408 INFO L290 TraceCheckUtils]: 44: Hoare triple {3172#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {3039#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:34:00,409 INFO L290 TraceCheckUtils]: 43: Hoare triple {2954#true} ~cond := #in~cond; {3172#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 14:34:00,409 INFO L272 TraceCheckUtils]: 42: Hoare triple {3162#(or (<= 0 main_~y~0) (not (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0)))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {2954#true} is VALID [2022-04-27 14:34:00,409 INFO L290 TraceCheckUtils]: 41: Hoare triple {3162#(or (<= 0 main_~y~0) (not (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0)))} assume !false; {3162#(or (<= 0 main_~y~0) (not (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0)))} is VALID [2022-04-27 14:34:00,444 INFO L290 TraceCheckUtils]: 40: Hoare triple {3182#(forall ((aux_div_aux_mod_v_main_~y~0_38_22_69 Int)) (or (and (or (not (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0))) (< (div main_~y~0 2) (* 2 aux_div_aux_mod_v_main_~y~0_38_22_69)) (not (= (mod main_~y~0 2) 0)) (<= 0 (div main_~y~0 2)) (<= (+ 2 (* 2 aux_div_aux_mod_v_main_~y~0_38_22_69)) (div main_~y~0 2)) (<= (div (- (div main_~y~0 2)) (- 2)) (+ (div (+ (- 2) (div main_~y~0 2)) 2) 1))) (or (not (< main_~y~0 0)) (= (mod main_~y~0 2) 0) (not (= (* main_~b~0 main_~a~0) (+ (* main_~x~0 2) (* 2 (* (div main_~y~0 2) main_~x~0)) main_~z~0))) (<= (div (+ (- 1) (* (- 1) (div main_~y~0 2))) (- 2)) (+ (div (+ (- 1) (div main_~y~0 2)) 2) 1)) (<= (+ (* 2 aux_div_aux_mod_v_main_~y~0_38_22_69) 1) (div main_~y~0 2)) (< (+ (div main_~y~0 2) 1) (* 2 aux_div_aux_mod_v_main_~y~0_38_22_69)))) (= (+ main_~z~0 (* main_~x~0 4) (* (* main_~x~0 aux_div_aux_mod_v_main_~y~0_38_22_69) 4)) (* main_~b~0 main_~a~0))))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {3162#(or (<= 0 main_~y~0) (not (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0)))} is VALID [2022-04-27 14:34:00,446 INFO L290 TraceCheckUtils]: 39: Hoare triple {2954#true} assume 1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2);~z~0 := ~z~0 + ~x~0;~y~0 := ~y~0 - 1; {3182#(forall ((aux_div_aux_mod_v_main_~y~0_38_22_69 Int)) (or (and (or (not (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0))) (< (div main_~y~0 2) (* 2 aux_div_aux_mod_v_main_~y~0_38_22_69)) (not (= (mod main_~y~0 2) 0)) (<= 0 (div main_~y~0 2)) (<= (+ 2 (* 2 aux_div_aux_mod_v_main_~y~0_38_22_69)) (div main_~y~0 2)) (<= (div (- (div main_~y~0 2)) (- 2)) (+ (div (+ (- 2) (div main_~y~0 2)) 2) 1))) (or (not (< main_~y~0 0)) (= (mod main_~y~0 2) 0) (not (= (* main_~b~0 main_~a~0) (+ (* main_~x~0 2) (* 2 (* (div main_~y~0 2) main_~x~0)) main_~z~0))) (<= (div (+ (- 1) (* (- 1) (div main_~y~0 2))) (- 2)) (+ (div (+ (- 1) (div main_~y~0 2)) 2) 1)) (<= (+ (* 2 aux_div_aux_mod_v_main_~y~0_38_22_69) 1) (div main_~y~0 2)) (< (+ (div main_~y~0 2) 1) (* 2 aux_div_aux_mod_v_main_~y~0_38_22_69)))) (= (+ main_~z~0 (* main_~x~0 4) (* (* main_~x~0 aux_div_aux_mod_v_main_~y~0_38_22_69) 4)) (* main_~b~0 main_~a~0))))} is VALID [2022-04-27 14:34:00,446 INFO L290 TraceCheckUtils]: 38: Hoare triple {2954#true} assume !!(0 != ~y~0); {2954#true} is VALID [2022-04-27 14:34:00,447 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {2954#true} {2954#true} #67#return; {2954#true} is VALID [2022-04-27 14:34:00,447 INFO L290 TraceCheckUtils]: 36: Hoare triple {2954#true} assume true; {2954#true} is VALID [2022-04-27 14:34:00,447 INFO L290 TraceCheckUtils]: 35: Hoare triple {2954#true} assume !(0 == ~cond); {2954#true} is VALID [2022-04-27 14:34:00,447 INFO L290 TraceCheckUtils]: 34: Hoare triple {2954#true} ~cond := #in~cond; {2954#true} is VALID [2022-04-27 14:34:00,447 INFO L272 TraceCheckUtils]: 33: Hoare triple {2954#true} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {2954#true} is VALID [2022-04-27 14:34:00,447 INFO L290 TraceCheckUtils]: 32: Hoare triple {2954#true} assume !false; {2954#true} is VALID [2022-04-27 14:34:00,447 INFO L290 TraceCheckUtils]: 31: Hoare triple {2954#true} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {2954#true} is VALID [2022-04-27 14:34:00,450 INFO L290 TraceCheckUtils]: 30: Hoare triple {2954#true} assume 1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2);~z~0 := ~z~0 + ~x~0;~y~0 := ~y~0 - 1; {2954#true} is VALID [2022-04-27 14:34:00,450 INFO L290 TraceCheckUtils]: 29: Hoare triple {2954#true} assume !!(0 != ~y~0); {2954#true} is VALID [2022-04-27 14:34:00,450 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2954#true} {2954#true} #67#return; {2954#true} is VALID [2022-04-27 14:34:00,450 INFO L290 TraceCheckUtils]: 27: Hoare triple {2954#true} assume true; {2954#true} is VALID [2022-04-27 14:34:00,451 INFO L290 TraceCheckUtils]: 26: Hoare triple {2954#true} assume !(0 == ~cond); {2954#true} is VALID [2022-04-27 14:34:00,451 INFO L290 TraceCheckUtils]: 25: Hoare triple {2954#true} ~cond := #in~cond; {2954#true} is VALID [2022-04-27 14:34:00,451 INFO L272 TraceCheckUtils]: 24: Hoare triple {2954#true} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {2954#true} is VALID [2022-04-27 14:34:00,451 INFO L290 TraceCheckUtils]: 23: Hoare triple {2954#true} assume !false; {2954#true} is VALID [2022-04-27 14:34:00,451 INFO L290 TraceCheckUtils]: 22: Hoare triple {2954#true} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {2954#true} is VALID [2022-04-27 14:34:00,451 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2954#true} {2954#true} #65#return; {2954#true} is VALID [2022-04-27 14:34:00,451 INFO L290 TraceCheckUtils]: 20: Hoare triple {2954#true} assume true; {2954#true} is VALID [2022-04-27 14:34:00,451 INFO L290 TraceCheckUtils]: 19: Hoare triple {2954#true} assume !(0 == ~cond); {2954#true} is VALID [2022-04-27 14:34:00,451 INFO L290 TraceCheckUtils]: 18: Hoare triple {2954#true} ~cond := #in~cond; {2954#true} is VALID [2022-04-27 14:34:00,451 INFO L272 TraceCheckUtils]: 17: Hoare triple {2954#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {2954#true} is VALID [2022-04-27 14:34:00,451 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2954#true} {2954#true} #63#return; {2954#true} is VALID [2022-04-27 14:34:00,451 INFO L290 TraceCheckUtils]: 15: Hoare triple {2954#true} assume true; {2954#true} is VALID [2022-04-27 14:34:00,451 INFO L290 TraceCheckUtils]: 14: Hoare triple {2954#true} assume !(0 == ~cond); {2954#true} is VALID [2022-04-27 14:34:00,451 INFO L290 TraceCheckUtils]: 13: Hoare triple {2954#true} ~cond := #in~cond; {2954#true} is VALID [2022-04-27 14:34:00,451 INFO L272 TraceCheckUtils]: 12: Hoare triple {2954#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 100 then 1 else 0)); {2954#true} is VALID [2022-04-27 14:34:00,451 INFO L290 TraceCheckUtils]: 11: Hoare triple {2954#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {2954#true} is VALID [2022-04-27 14:34:00,452 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2954#true} {2954#true} #61#return; {2954#true} is VALID [2022-04-27 14:34:00,452 INFO L290 TraceCheckUtils]: 9: Hoare triple {2954#true} assume true; {2954#true} is VALID [2022-04-27 14:34:00,452 INFO L290 TraceCheckUtils]: 8: Hoare triple {2954#true} assume !(0 == ~cond); {2954#true} is VALID [2022-04-27 14:34:00,452 INFO L290 TraceCheckUtils]: 7: Hoare triple {2954#true} ~cond := #in~cond; {2954#true} is VALID [2022-04-27 14:34:00,452 INFO L272 TraceCheckUtils]: 6: Hoare triple {2954#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 100 then 1 else 0)); {2954#true} is VALID [2022-04-27 14:34:00,452 INFO L290 TraceCheckUtils]: 5: Hoare triple {2954#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4; {2954#true} is VALID [2022-04-27 14:34:00,452 INFO L272 TraceCheckUtils]: 4: Hoare triple {2954#true} call #t~ret6 := main(); {2954#true} is VALID [2022-04-27 14:34:00,452 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2954#true} {2954#true} #71#return; {2954#true} is VALID [2022-04-27 14:34:00,452 INFO L290 TraceCheckUtils]: 2: Hoare triple {2954#true} assume true; {2954#true} is VALID [2022-04-27 14:34:00,452 INFO L290 TraceCheckUtils]: 1: Hoare triple {2954#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); {2954#true} is VALID [2022-04-27 14:34:00,452 INFO L272 TraceCheckUtils]: 0: Hoare triple {2954#true} call ULTIMATE.init(); {2954#true} is VALID [2022-04-27 14:34:00,452 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 25 proven. 4 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-04-27 14:34:00,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:34:00,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535173299] [2022-04-27 14:34:00,453 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:34:00,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1059388869] [2022-04-27 14:34:00,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1059388869] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 14:34:00,453 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 14:34:00,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11] total 22 [2022-04-27 14:34:00,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197336778] [2022-04-27 14:34:00,453 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 14:34:00,454 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.0) internal successors, (44), 20 states have internal predecessors, (44), 7 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) Word has length 55 [2022-04-27 14:34:00,454 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:34:00,454 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 22 states have (on average 2.0) internal successors, (44), 20 states have internal predecessors, (44), 7 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2022-04-27 14:34:01,354 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:34:01,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-27 14:34:01,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:34:01,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-27 14:34:01,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=376, Unknown=3, NotChecked=0, Total=462 [2022-04-27 14:34:01,355 INFO L87 Difference]: Start difference. First operand 79 states and 90 transitions. Second operand has 22 states, 22 states have (on average 2.0) internal successors, (44), 20 states have internal predecessors, (44), 7 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2022-04-27 14:34:06,980 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 14:34:13,659 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 14:34:21,242 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 14:34:29,554 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 14:34:45,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-27 14:34:45,576 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 89 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 25.6s TimeCoverageRelationStatistics Valid=143, Invalid=664, Unknown=5, NotChecked=0, Total=812 [2022-04-27 14:34:45,576 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 31 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 20 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 23 IncrementalHoareTripleChecker+Unchecked, 11.3s IncrementalHoareTripleChecker+Time [2022-04-27 14:34:45,577 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 219 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 203 Invalid, 3 Unknown, 23 Unchecked, 11.3s Time] [2022-04-27 14:34:45,593 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-04-27 14:34:45,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:34:45,792 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: explication result by transitivity: VALID old explication result: INVALID at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:941) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:768) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:345) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:388) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:282) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1058) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:960) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:182) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.NwaCegarLoop.computeAutomataDifference(NwaCegarLoop.java:353) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.NwaCegarLoop.refineAbstraction(NwaCegarLoop.java:325) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:487) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:409) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:300) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:260) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:152) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-04-27 14:34:45,794 INFO L158 Benchmark]: Toolchain (without parser) took 427221.06ms. Allocated memory was 183.5MB in the beginning and 223.3MB in the end (delta: 39.8MB). Free memory was 136.3MB in the beginning and 190.3MB in the end (delta: -54.0MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 14:34:45,794 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 183.5MB. Free memory is still 152.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 14:34:45,794 INFO L158 Benchmark]: CACSL2BoogieTranslator took 236.41ms. Allocated memory is still 183.5MB. Free memory was 136.1MB in the beginning and 160.9MB in the end (delta: -24.8MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-04-27 14:34:45,794 INFO L158 Benchmark]: Boogie Preprocessor took 23.71ms. Allocated memory is still 183.5MB. Free memory was 160.9MB in the beginning and 159.4MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 14:34:45,795 INFO L158 Benchmark]: RCFGBuilder took 266.21ms. Allocated memory is still 183.5MB. Free memory was 159.4MB in the beginning and 147.8MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-27 14:34:45,795 INFO L158 Benchmark]: TraceAbstraction took 426689.26ms. Allocated memory was 183.5MB in the beginning and 223.3MB in the end (delta: 39.8MB). Free memory was 147.3MB in the beginning and 190.3MB in the end (delta: -43.0MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 14:34:45,795 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.26ms. Allocated memory is still 183.5MB. Free memory is still 152.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 236.41ms. Allocated memory is still 183.5MB. Free memory was 136.1MB in the beginning and 160.9MB in the end (delta: -24.8MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 23.71ms. Allocated memory is still 183.5MB. Free memory was 160.9MB in the beginning and 159.4MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 266.21ms. Allocated memory is still 183.5MB. Free memory was 159.4MB in the beginning and 147.8MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 426689.26ms. Allocated memory was 183.5MB in the beginning and 223.3MB in the end (delta: 39.8MB). Free memory was 147.3MB in the beginning and 190.3MB in the end (delta: -43.0MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: explication result by transitivity: VALID old explication result: INVALID de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: explication result by transitivity: VALID old explication result: INVALID: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:941) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-04-27 14:34:45,874 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...