/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/dijkstra-u_unwindbound50.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-07 13:02:25,736 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-07 13:02:25,751 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-07 13:02:25,769 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-07 13:02:25,769 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-07 13:02:25,770 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-07 13:02:25,771 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-07 13:02:25,772 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-07 13:02:25,773 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-07 13:02:25,774 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-07 13:02:25,774 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-07 13:02:25,780 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-07 13:02:25,781 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-07 13:02:25,787 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-07 13:02:25,788 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-07 13:02:25,790 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-07 13:02:25,791 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-07 13:02:25,791 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-07 13:02:25,792 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-07 13:02:25,793 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-07 13:02:25,794 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-07 13:02:25,796 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-07 13:02:25,806 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-07 13:02:25,807 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-07 13:02:25,808 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-07 13:02:25,809 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-07 13:02:25,809 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-07 13:02:25,810 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-07 13:02:25,810 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-07 13:02:25,810 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-07 13:02:25,811 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-07 13:02:25,811 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-07 13:02:25,811 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-07 13:02:25,812 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-07 13:02:25,812 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-07 13:02:25,813 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-07 13:02:25,813 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-07 13:02:25,813 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-07 13:02:25,814 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-07 13:02:25,814 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-07 13:02:25,814 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-07 13:02:25,819 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-07 13:02:25,819 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-07 13:02:25,839 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-07 13:02:25,840 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-07 13:02:25,840 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-07 13:02:25,840 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-07 13:02:25,841 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-07 13:02:25,841 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-07 13:02:25,842 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-07 13:02:25,842 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-07 13:02:25,842 INFO L138 SettingsManager]: * Use SBE=true [2022-04-07 13:02:25,843 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-07 13:02:25,843 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-07 13:02:25,843 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-07 13:02:25,843 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-07 13:02:25,843 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-07 13:02:25,843 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-07 13:02:25,843 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-07 13:02:25,843 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-07 13:02:25,844 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-07 13:02:25,844 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-07 13:02:25,845 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-07 13:02:25,845 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-07 13:02:25,845 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-07 13:02:25,845 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-07 13:02:25,845 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-07 13:02:25,845 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 13:02:25,845 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-07 13:02:25,845 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-07 13:02:25,845 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-07 13:02:25,845 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-07 13:02:25,846 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-07 13:02:25,846 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-04-07 13:02:25,846 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-07 13:02:25,846 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-07 13:02:25,846 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-07 13:02:25,993 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-07 13:02:26,013 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-07 13:02:26,014 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-07 13:02:26,015 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-07 13:02:26,015 INFO L275 PluginConnector]: CDTParser initialized [2022-04-07 13:02:26,016 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_unwindbound50.c [2022-04-07 13:02:26,077 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a6a8b79f/91eb37fd6930462db828aa45cc8f3fe7/FLAGdb7a658e4 [2022-04-07 13:02:26,410 INFO L306 CDTParser]: Found 1 translation units. [2022-04-07 13:02:26,410 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_unwindbound50.c [2022-04-07 13:02:26,415 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a6a8b79f/91eb37fd6930462db828aa45cc8f3fe7/FLAGdb7a658e4 [2022-04-07 13:02:26,846 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a6a8b79f/91eb37fd6930462db828aa45cc8f3fe7 [2022-04-07 13:02:26,849 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-07 13:02:26,849 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-07 13:02:26,850 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-07 13:02:26,850 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-07 13:02:26,852 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-07 13:02:26,853 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 01:02:26" (1/1) ... [2022-04-07 13:02:26,853 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f8582af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 01:02:26, skipping insertion in model container [2022-04-07 13:02:26,853 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 01:02:26" (1/1) ... [2022-04-07 13:02:26,857 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-07 13:02:26,866 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-07 13:02:26,988 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/dijkstra-u_unwindbound50.c[525,538] [2022-04-07 13:02:27,031 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 13:02:27,039 INFO L203 MainTranslator]: Completed pre-run [2022-04-07 13:02:27,046 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/dijkstra-u_unwindbound50.c[525,538] [2022-04-07 13:02:27,058 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 13:02:27,065 INFO L208 MainTranslator]: Completed translation [2022-04-07 13:02:27,066 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 01:02:27 WrapperNode [2022-04-07 13:02:27,066 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-07 13:02:27,066 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-07 13:02:27,066 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-07 13:02:27,066 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-07 13:02:27,085 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 01:02:27" (1/1) ... [2022-04-07 13:02:27,086 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 01:02:27" (1/1) ... [2022-04-07 13:02:27,091 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 01:02:27" (1/1) ... [2022-04-07 13:02:27,091 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 01:02:27" (1/1) ... [2022-04-07 13:02:27,096 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 01:02:27" (1/1) ... [2022-04-07 13:02:27,099 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 01:02:27" (1/1) ... [2022-04-07 13:02:27,100 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 01:02:27" (1/1) ... [2022-04-07 13:02:27,101 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-07 13:02:27,101 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-07 13:02:27,101 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-07 13:02:27,102 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-07 13:02:27,110 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 01:02:27" (1/1) ... [2022-04-07 13:02:27,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 13:02:27,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 13:02:27,131 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-07 13:02:27,159 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-07 13:02:27,159 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-07 13:02:27,159 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-07 13:02:27,159 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-07 13:02:27,160 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-07 13:02:27,161 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-07 13:02:27,161 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-07 13:02:27,161 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-07 13:02:27,161 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-07 13:02:27,162 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-07 13:02:27,162 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-07 13:02:27,162 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-07 13:02:27,162 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-07 13:02:27,162 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-07 13:02:27,162 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-07 13:02:27,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-07 13:02:27,162 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-07 13:02:27,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-07 13:02:27,162 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-07 13:02:27,162 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-07 13:02:27,149 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-07 13:02:27,209 INFO L234 CfgBuilder]: Building ICFG [2022-04-07 13:02:27,210 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-07 13:02:27,394 INFO L275 CfgBuilder]: Performing block encoding [2022-04-07 13:02:27,415 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-07 13:02:27,415 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-07 13:02:27,416 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 01:02:27 BoogieIcfgContainer [2022-04-07 13:02:27,417 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-07 13:02:27,418 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-07 13:02:27,418 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-07 13:02:27,420 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-07 13:02:27,421 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.04 01:02:26" (1/3) ... [2022-04-07 13:02:27,421 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@266272f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 01:02:27, skipping insertion in model container [2022-04-07 13:02:27,421 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 01:02:27" (2/3) ... [2022-04-07 13:02:27,421 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@266272f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 01:02:27, skipping insertion in model container [2022-04-07 13:02:27,421 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 01:02:27" (3/3) ... [2022-04-07 13:02:27,422 INFO L111 eAbstractionObserver]: Analyzing ICFG dijkstra-u_unwindbound50.c [2022-04-07 13:02:27,425 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-07 13:02:27,425 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-07 13:02:27,466 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-07 13:02:27,472 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-07 13:02:27,472 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-07 13:02:27,485 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 22 states have internal predecessors, (31), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-07 13:02:27,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-07 13:02:27,489 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 13:02:27,489 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 13:02:27,489 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 13:02:27,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 13:02:27,493 INFO L85 PathProgramCache]: Analyzing trace with hash -2024343623, now seen corresponding path program 1 times [2022-04-07 13:02:27,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 13:02:27,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126737103] [2022-04-07 13:02:27,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 13:02:27,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 13:02:27,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:02:27,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 13:02:27,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:02:27,627 INFO L290 TraceCheckUtils]: 0: Hoare triple {51#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {42#true} is VALID [2022-04-07 13:02:27,627 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} assume true; {42#true} is VALID [2022-04-07 13:02:27,627 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {42#true} {42#true} #102#return; {42#true} is VALID [2022-04-07 13:02:27,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-07 13:02:27,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:02:27,633 INFO L290 TraceCheckUtils]: 0: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-07 13:02:27,633 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-07 13:02:27,634 INFO L290 TraceCheckUtils]: 2: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-07 13:02:27,634 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43#false} {42#true} #82#return; {43#false} is VALID [2022-04-07 13:02:27,635 INFO L272 TraceCheckUtils]: 0: Hoare triple {42#true} call ULTIMATE.init(); {51#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 13:02:27,635 INFO L290 TraceCheckUtils]: 1: Hoare triple {51#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {42#true} is VALID [2022-04-07 13:02:27,635 INFO L290 TraceCheckUtils]: 2: Hoare triple {42#true} assume true; {42#true} is VALID [2022-04-07 13:02:27,635 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42#true} {42#true} #102#return; {42#true} is VALID [2022-04-07 13:02:27,635 INFO L272 TraceCheckUtils]: 4: Hoare triple {42#true} call #t~ret7 := main(); {42#true} is VALID [2022-04-07 13:02:27,635 INFO L290 TraceCheckUtils]: 5: Hoare triple {42#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {42#true} is VALID [2022-04-07 13:02:27,636 INFO L272 TraceCheckUtils]: 6: Hoare triple {42#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {42#true} is VALID [2022-04-07 13:02:27,636 INFO L290 TraceCheckUtils]: 7: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-07 13:02:27,636 INFO L290 TraceCheckUtils]: 8: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-07 13:02:27,636 INFO L290 TraceCheckUtils]: 9: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-07 13:02:27,636 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {43#false} {42#true} #82#return; {43#false} is VALID [2022-04-07 13:02:27,637 INFO L290 TraceCheckUtils]: 11: Hoare triple {43#false} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {43#false} is VALID [2022-04-07 13:02:27,637 INFO L290 TraceCheckUtils]: 12: Hoare triple {43#false} assume !true; {43#false} is VALID [2022-04-07 13:02:27,637 INFO L290 TraceCheckUtils]: 13: Hoare triple {43#false} assume !true; {43#false} is VALID [2022-04-07 13:02:27,637 INFO L272 TraceCheckUtils]: 14: Hoare triple {43#false} call __VERIFIER_assert((if 0 == (~h~0 * ~h~0 * ~h~0 - 12 * ~h~0 * ~n~0 + 16 * ~n~0 * ~p~0 + 12 * ~h~0 * ~r~0 - 16 * ~p~0 * ~r~0 - ~h~0 - 4 * ~p~0) % 4294967296 then 1 else 0)); {43#false} is VALID [2022-04-07 13:02:27,637 INFO L290 TraceCheckUtils]: 15: Hoare triple {43#false} ~cond := #in~cond; {43#false} is VALID [2022-04-07 13:02:27,637 INFO L290 TraceCheckUtils]: 16: Hoare triple {43#false} assume 0 == ~cond; {43#false} is VALID [2022-04-07 13:02:27,638 INFO L290 TraceCheckUtils]: 17: Hoare triple {43#false} assume !false; {43#false} is VALID [2022-04-07 13:02:27,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 13:02:27,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 13:02:27,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126737103] [2022-04-07 13:02:27,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126737103] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 13:02:27,639 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 13:02:27,639 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-07 13:02:27,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521969326] [2022-04-07 13:02:27,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 13:02:27,643 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, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-07 13:02:27,644 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 13:02:27,646 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, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 13:02:27,673 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 13:02:27,673 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-07 13:02:27,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 13:02:27,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-07 13:02:27,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-07 13:02:27,698 INFO L87 Difference]: Start difference. First operand has 39 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 22 states have internal predecessors, (31), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) 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, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 13:02:30,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:02:30,483 INFO L93 Difference]: Finished difference Result 70 states and 111 transitions. [2022-04-07 13:02:30,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-07 13:02:30,484 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, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-07 13:02:30,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 13:02:30,485 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, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 13:02:30,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2022-04-07 13:02:30,492 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, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 13:02:30,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2022-04-07 13:02:30,497 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 111 transitions. [2022-04-07 13:02:30,615 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 13:02:30,626 INFO L225 Difference]: With dead ends: 70 [2022-04-07 13:02:30,626 INFO L226 Difference]: Without dead ends: 35 [2022-04-07 13:02:30,640 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-07 13:02:30,642 INFO L913 BasicCegarLoop]: 49 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 13:02:30,643 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 53 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 13:02:30,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-07 13:02:30,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2022-04-07 13:02:30,668 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 13:02:30,669 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 34 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-07 13:02:30,669 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 34 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-07 13:02:30,669 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 34 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-07 13:02:30,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:02:30,673 INFO L93 Difference]: Finished difference Result 35 states and 47 transitions. [2022-04-07 13:02:30,673 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 47 transitions. [2022-04-07 13:02:30,674 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:02:30,674 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:02:30,674 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 35 states. [2022-04-07 13:02:30,675 INFO L87 Difference]: Start difference. First operand has 34 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 35 states. [2022-04-07 13:02:30,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:02:30,678 INFO L93 Difference]: Finished difference Result 35 states and 47 transitions. [2022-04-07 13:02:30,678 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 47 transitions. [2022-04-07 13:02:30,679 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:02:30,679 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:02:30,679 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 13:02:30,680 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 13:02:30,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-07 13:02:30,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 46 transitions. [2022-04-07 13:02:30,683 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 46 transitions. Word has length 18 [2022-04-07 13:02:30,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 13:02:30,683 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 46 transitions. [2022-04-07 13:02:30,684 INFO L479 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, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 13:02:30,684 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 46 transitions. [2022-04-07 13:02:30,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-07 13:02:30,684 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 13:02:30,684 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 13:02:30,685 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-07 13:02:30,685 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 13:02:30,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 13:02:30,685 INFO L85 PathProgramCache]: Analyzing trace with hash -96361696, now seen corresponding path program 1 times [2022-04-07 13:02:30,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 13:02:30,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987418407] [2022-04-07 13:02:30,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 13:02:30,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 13:02:30,700 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 13:02:30,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1323948536] [2022-04-07 13:02:30,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 13:02:30,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 13:02:30,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 13:02:30,702 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-07 13:02:30,703 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-07 13:02:30,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:02:30,745 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-07 13:02:30,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:02:30,756 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 13:02:30,866 INFO L272 TraceCheckUtils]: 0: Hoare triple {274#true} call ULTIMATE.init(); {274#true} is VALID [2022-04-07 13:02:30,867 INFO L290 TraceCheckUtils]: 1: Hoare triple {274#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {282#(<= ~counter~0 0)} is VALID [2022-04-07 13:02:30,868 INFO L290 TraceCheckUtils]: 2: Hoare triple {282#(<= ~counter~0 0)} assume true; {282#(<= ~counter~0 0)} is VALID [2022-04-07 13:02:30,868 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {282#(<= ~counter~0 0)} {274#true} #102#return; {282#(<= ~counter~0 0)} is VALID [2022-04-07 13:02:30,869 INFO L272 TraceCheckUtils]: 4: Hoare triple {282#(<= ~counter~0 0)} call #t~ret7 := main(); {282#(<= ~counter~0 0)} is VALID [2022-04-07 13:02:30,869 INFO L290 TraceCheckUtils]: 5: Hoare triple {282#(<= ~counter~0 0)} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {282#(<= ~counter~0 0)} is VALID [2022-04-07 13:02:30,870 INFO L272 TraceCheckUtils]: 6: Hoare triple {282#(<= ~counter~0 0)} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {282#(<= ~counter~0 0)} is VALID [2022-04-07 13:02:30,871 INFO L290 TraceCheckUtils]: 7: Hoare triple {282#(<= ~counter~0 0)} ~cond := #in~cond; {282#(<= ~counter~0 0)} is VALID [2022-04-07 13:02:30,871 INFO L290 TraceCheckUtils]: 8: Hoare triple {282#(<= ~counter~0 0)} assume !(0 == ~cond); {282#(<= ~counter~0 0)} is VALID [2022-04-07 13:02:30,871 INFO L290 TraceCheckUtils]: 9: Hoare triple {282#(<= ~counter~0 0)} assume true; {282#(<= ~counter~0 0)} is VALID [2022-04-07 13:02:30,872 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {282#(<= ~counter~0 0)} {282#(<= ~counter~0 0)} #82#return; {282#(<= ~counter~0 0)} is VALID [2022-04-07 13:02:30,873 INFO L290 TraceCheckUtils]: 11: Hoare triple {282#(<= ~counter~0 0)} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {282#(<= ~counter~0 0)} is VALID [2022-04-07 13:02:30,873 INFO L290 TraceCheckUtils]: 12: Hoare triple {282#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {316#(<= |main_#t~post5| 0)} is VALID [2022-04-07 13:02:30,874 INFO L290 TraceCheckUtils]: 13: Hoare triple {316#(<= |main_#t~post5| 0)} assume !(#t~post5 < 50);havoc #t~post5; {275#false} is VALID [2022-04-07 13:02:30,874 INFO L290 TraceCheckUtils]: 14: Hoare triple {275#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {275#false} is VALID [2022-04-07 13:02:30,874 INFO L290 TraceCheckUtils]: 15: Hoare triple {275#false} assume !(#t~post6 < 50);havoc #t~post6; {275#false} is VALID [2022-04-07 13:02:30,874 INFO L272 TraceCheckUtils]: 16: Hoare triple {275#false} call __VERIFIER_assert((if 0 == (~h~0 * ~h~0 * ~h~0 - 12 * ~h~0 * ~n~0 + 16 * ~n~0 * ~p~0 + 12 * ~h~0 * ~r~0 - 16 * ~p~0 * ~r~0 - ~h~0 - 4 * ~p~0) % 4294967296 then 1 else 0)); {275#false} is VALID [2022-04-07 13:02:30,875 INFO L290 TraceCheckUtils]: 17: Hoare triple {275#false} ~cond := #in~cond; {275#false} is VALID [2022-04-07 13:02:30,875 INFO L290 TraceCheckUtils]: 18: Hoare triple {275#false} assume 0 == ~cond; {275#false} is VALID [2022-04-07 13:02:30,875 INFO L290 TraceCheckUtils]: 19: Hoare triple {275#false} assume !false; {275#false} is VALID [2022-04-07 13:02:30,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 13:02:30,875 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 13:02:30,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 13:02:30,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987418407] [2022-04-07 13:02:30,876 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 13:02:30,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1323948536] [2022-04-07 13:02:30,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1323948536] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 13:02:30,876 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 13:02:30,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 13:02:30,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450676832] [2022-04-07 13:02:30,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 13:02:30,878 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-07 13:02:30,878 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 13:02:30,879 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 13:02:30,893 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 13:02:30,893 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 13:02:30,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 13:02:30,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 13:02:30,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 13:02:30,894 INFO L87 Difference]: Start difference. First operand 34 states and 46 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 13:02:34,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:02:34,741 INFO L93 Difference]: Finished difference Result 55 states and 78 transitions. [2022-04-07 13:02:34,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 13:02:34,741 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-07 13:02:34,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 13:02:34,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 13:02:34,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2022-04-07 13:02:34,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 13:02:34,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2022-04-07 13:02:34,746 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 78 transitions. [2022-04-07 13:02:34,814 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 13:02:34,816 INFO L225 Difference]: With dead ends: 55 [2022-04-07 13:02:34,816 INFO L226 Difference]: Without dead ends: 36 [2022-04-07 13:02:34,816 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 13:02:34,817 INFO L913 BasicCegarLoop]: 44 mSDtfsCounter, 0 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 13:02:34,817 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 119 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 13:02:34,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-07 13:02:34,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-04-07 13:02:34,824 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 13:02:34,824 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 36 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-07 13:02:34,825 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 36 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-07 13:02:34,825 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 36 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-07 13:02:34,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:02:34,827 INFO L93 Difference]: Finished difference Result 36 states and 48 transitions. [2022-04-07 13:02:34,827 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 48 transitions. [2022-04-07 13:02:34,827 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:02:34,827 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:02:34,828 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 36 states. [2022-04-07 13:02:34,828 INFO L87 Difference]: Start difference. First operand has 36 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 36 states. [2022-04-07 13:02:34,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:02:34,830 INFO L93 Difference]: Finished difference Result 36 states and 48 transitions. [2022-04-07 13:02:34,830 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 48 transitions. [2022-04-07 13:02:34,831 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:02:34,831 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:02:34,831 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 13:02:34,831 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 13:02:34,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-07 13:02:34,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 48 transitions. [2022-04-07 13:02:34,834 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 48 transitions. Word has length 20 [2022-04-07 13:02:34,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 13:02:34,835 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 48 transitions. [2022-04-07 13:02:34,835 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 13:02:34,835 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 48 transitions. [2022-04-07 13:02:34,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-07 13:02:34,835 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 13:02:34,836 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 13:02:34,876 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-07 13:02:35,054 WARN L460 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-07 13:02:35,054 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 13:02:35,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 13:02:35,055 INFO L85 PathProgramCache]: Analyzing trace with hash 962099791, now seen corresponding path program 1 times [2022-04-07 13:02:35,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 13:02:35,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305537845] [2022-04-07 13:02:35,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 13:02:35,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 13:02:35,069 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 13:02:35,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1781181404] [2022-04-07 13:02:35,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 13:02:35,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 13:02:35,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 13:02:35,071 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-07 13:02:35,072 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-07 13:02:35,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:02:35,103 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-07 13:02:35,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:02:35,110 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 13:02:35,225 INFO L272 TraceCheckUtils]: 0: Hoare triple {546#true} call ULTIMATE.init(); {546#true} is VALID [2022-04-07 13:02:35,226 INFO L290 TraceCheckUtils]: 1: Hoare triple {546#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {554#(<= ~counter~0 0)} is VALID [2022-04-07 13:02:35,226 INFO L290 TraceCheckUtils]: 2: Hoare triple {554#(<= ~counter~0 0)} assume true; {554#(<= ~counter~0 0)} is VALID [2022-04-07 13:02:35,226 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {554#(<= ~counter~0 0)} {546#true} #102#return; {554#(<= ~counter~0 0)} is VALID [2022-04-07 13:02:35,227 INFO L272 TraceCheckUtils]: 4: Hoare triple {554#(<= ~counter~0 0)} call #t~ret7 := main(); {554#(<= ~counter~0 0)} is VALID [2022-04-07 13:02:35,227 INFO L290 TraceCheckUtils]: 5: Hoare triple {554#(<= ~counter~0 0)} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {554#(<= ~counter~0 0)} is VALID [2022-04-07 13:02:35,228 INFO L272 TraceCheckUtils]: 6: Hoare triple {554#(<= ~counter~0 0)} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {554#(<= ~counter~0 0)} is VALID [2022-04-07 13:02:35,228 INFO L290 TraceCheckUtils]: 7: Hoare triple {554#(<= ~counter~0 0)} ~cond := #in~cond; {554#(<= ~counter~0 0)} is VALID [2022-04-07 13:02:35,229 INFO L290 TraceCheckUtils]: 8: Hoare triple {554#(<= ~counter~0 0)} assume !(0 == ~cond); {554#(<= ~counter~0 0)} is VALID [2022-04-07 13:02:35,229 INFO L290 TraceCheckUtils]: 9: Hoare triple {554#(<= ~counter~0 0)} assume true; {554#(<= ~counter~0 0)} is VALID [2022-04-07 13:02:35,229 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {554#(<= ~counter~0 0)} {554#(<= ~counter~0 0)} #82#return; {554#(<= ~counter~0 0)} is VALID [2022-04-07 13:02:35,230 INFO L290 TraceCheckUtils]: 11: Hoare triple {554#(<= ~counter~0 0)} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {554#(<= ~counter~0 0)} is VALID [2022-04-07 13:02:35,230 INFO L290 TraceCheckUtils]: 12: Hoare triple {554#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {588#(<= ~counter~0 1)} is VALID [2022-04-07 13:02:35,231 INFO L290 TraceCheckUtils]: 13: Hoare triple {588#(<= ~counter~0 1)} assume !!(#t~post5 < 50);havoc #t~post5; {588#(<= ~counter~0 1)} is VALID [2022-04-07 13:02:35,231 INFO L290 TraceCheckUtils]: 14: Hoare triple {588#(<= ~counter~0 1)} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {588#(<= ~counter~0 1)} is VALID [2022-04-07 13:02:35,231 INFO L290 TraceCheckUtils]: 15: Hoare triple {588#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {598#(<= |main_#t~post6| 1)} is VALID [2022-04-07 13:02:35,232 INFO L290 TraceCheckUtils]: 16: Hoare triple {598#(<= |main_#t~post6| 1)} assume !(#t~post6 < 50);havoc #t~post6; {547#false} is VALID [2022-04-07 13:02:35,232 INFO L272 TraceCheckUtils]: 17: Hoare triple {547#false} call __VERIFIER_assert((if 0 == (~h~0 * ~h~0 * ~h~0 - 12 * ~h~0 * ~n~0 + 16 * ~n~0 * ~p~0 + 12 * ~h~0 * ~r~0 - 16 * ~p~0 * ~r~0 - ~h~0 - 4 * ~p~0) % 4294967296 then 1 else 0)); {547#false} is VALID [2022-04-07 13:02:35,232 INFO L290 TraceCheckUtils]: 18: Hoare triple {547#false} ~cond := #in~cond; {547#false} is VALID [2022-04-07 13:02:35,232 INFO L290 TraceCheckUtils]: 19: Hoare triple {547#false} assume 0 == ~cond; {547#false} is VALID [2022-04-07 13:02:35,232 INFO L290 TraceCheckUtils]: 20: Hoare triple {547#false} assume !false; {547#false} is VALID [2022-04-07 13:02:35,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 13:02:35,233 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 13:02:35,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 13:02:35,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305537845] [2022-04-07 13:02:35,233 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 13:02:35,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1781181404] [2022-04-07 13:02:35,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1781181404] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 13:02:35,233 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 13:02:35,233 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 13:02:35,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319701906] [2022-04-07 13:02:35,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 13:02:35,234 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2022-04-07 13:02:35,234 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 13:02:35,234 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 13:02:35,249 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 13:02:35,249 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 13:02:35,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 13:02:35,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 13:02:35,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-07 13:02:35,250 INFO L87 Difference]: Start difference. First operand 36 states and 48 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 13:02:38,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:02:38,552 INFO L93 Difference]: Finished difference Result 49 states and 64 transitions. [2022-04-07 13:02:38,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 13:02:38,553 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2022-04-07 13:02:38,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 13:02:38,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 13:02:38,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-07 13:02:38,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 13:02:38,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-07 13:02:38,556 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 64 transitions. [2022-04-07 13:02:38,615 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 13:02:38,617 INFO L225 Difference]: With dead ends: 49 [2022-04-07 13:02:38,617 INFO L226 Difference]: Without dead ends: 40 [2022-04-07 13:02:38,617 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-07 13:02:38,618 INFO L913 BasicCegarLoop]: 43 mSDtfsCounter, 7 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 13:02:38,619 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 120 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 13:02:38,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-07 13:02:38,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2022-04-07 13:02:38,626 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 13:02:38,627 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand has 39 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-07 13:02:38,627 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand has 39 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-07 13:02:38,628 INFO L87 Difference]: Start difference. First operand 40 states. Second operand has 39 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-07 13:02:38,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:02:38,630 INFO L93 Difference]: Finished difference Result 40 states and 53 transitions. [2022-04-07 13:02:38,630 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 53 transitions. [2022-04-07 13:02:38,631 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:02:38,631 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:02:38,631 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 40 states. [2022-04-07 13:02:38,631 INFO L87 Difference]: Start difference. First operand has 39 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 40 states. [2022-04-07 13:02:38,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:02:38,634 INFO L93 Difference]: Finished difference Result 40 states and 53 transitions. [2022-04-07 13:02:38,634 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 53 transitions. [2022-04-07 13:02:38,634 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:02:38,634 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:02:38,634 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 13:02:38,635 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 13:02:38,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-07 13:02:38,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 52 transitions. [2022-04-07 13:02:38,637 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 52 transitions. Word has length 21 [2022-04-07 13:02:38,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 13:02:38,637 INFO L478 AbstractCegarLoop]: Abstraction has 39 states and 52 transitions. [2022-04-07 13:02:38,637 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 13:02:38,637 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 52 transitions. [2022-04-07 13:02:38,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-07 13:02:38,638 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 13:02:38,638 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 13:02:38,662 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-07 13:02:38,860 WARN L460 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-07 13:02:38,860 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 13:02:38,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 13:02:38,861 INFO L85 PathProgramCache]: Analyzing trace with hash 963589341, now seen corresponding path program 1 times [2022-04-07 13:02:38,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 13:02:38,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488223809] [2022-04-07 13:02:38,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 13:02:38,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 13:02:38,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:02:39,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 13:02:39,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:02:39,072 INFO L290 TraceCheckUtils]: 0: Hoare triple {835#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {822#true} is VALID [2022-04-07 13:02:39,072 INFO L290 TraceCheckUtils]: 1: Hoare triple {822#true} assume true; {822#true} is VALID [2022-04-07 13:02:39,072 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {822#true} {822#true} #102#return; {822#true} is VALID [2022-04-07 13:02:39,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-07 13:02:39,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:02:39,082 INFO L290 TraceCheckUtils]: 0: Hoare triple {822#true} ~cond := #in~cond; {822#true} is VALID [2022-04-07 13:02:39,082 INFO L290 TraceCheckUtils]: 1: Hoare triple {822#true} assume !(0 == ~cond); {822#true} is VALID [2022-04-07 13:02:39,082 INFO L290 TraceCheckUtils]: 2: Hoare triple {822#true} assume true; {822#true} is VALID [2022-04-07 13:02:39,083 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {822#true} {822#true} #82#return; {822#true} is VALID [2022-04-07 13:02:39,083 INFO L272 TraceCheckUtils]: 0: Hoare triple {822#true} call ULTIMATE.init(); {835#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 13:02:39,084 INFO L290 TraceCheckUtils]: 1: Hoare triple {835#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {822#true} is VALID [2022-04-07 13:02:39,084 INFO L290 TraceCheckUtils]: 2: Hoare triple {822#true} assume true; {822#true} is VALID [2022-04-07 13:02:39,084 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {822#true} {822#true} #102#return; {822#true} is VALID [2022-04-07 13:02:39,084 INFO L272 TraceCheckUtils]: 4: Hoare triple {822#true} call #t~ret7 := main(); {822#true} is VALID [2022-04-07 13:02:39,084 INFO L290 TraceCheckUtils]: 5: Hoare triple {822#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {822#true} is VALID [2022-04-07 13:02:39,084 INFO L272 TraceCheckUtils]: 6: Hoare triple {822#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {822#true} is VALID [2022-04-07 13:02:39,085 INFO L290 TraceCheckUtils]: 7: Hoare triple {822#true} ~cond := #in~cond; {822#true} is VALID [2022-04-07 13:02:39,085 INFO L290 TraceCheckUtils]: 8: Hoare triple {822#true} assume !(0 == ~cond); {822#true} is VALID [2022-04-07 13:02:39,085 INFO L290 TraceCheckUtils]: 9: Hoare triple {822#true} assume true; {822#true} is VALID [2022-04-07 13:02:39,085 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {822#true} {822#true} #82#return; {822#true} is VALID [2022-04-07 13:02:39,086 INFO L290 TraceCheckUtils]: 11: Hoare triple {822#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {831#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} is VALID [2022-04-07 13:02:39,086 INFO L290 TraceCheckUtils]: 12: Hoare triple {831#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {831#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} is VALID [2022-04-07 13:02:39,087 INFO L290 TraceCheckUtils]: 13: Hoare triple {831#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} assume !!(#t~post5 < 50);havoc #t~post5; {831#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} is VALID [2022-04-07 13:02:39,088 INFO L290 TraceCheckUtils]: 14: Hoare triple {831#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {832#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0))} is VALID [2022-04-07 13:02:39,088 INFO L290 TraceCheckUtils]: 15: Hoare triple {832#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {832#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0))} is VALID [2022-04-07 13:02:39,089 INFO L290 TraceCheckUtils]: 16: Hoare triple {832#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0))} assume !!(#t~post6 < 50);havoc #t~post6; {832#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0))} is VALID [2022-04-07 13:02:39,090 INFO L272 TraceCheckUtils]: 17: Hoare triple {832#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0))} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {833#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 13:02:39,091 INFO L290 TraceCheckUtils]: 18: Hoare triple {833#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {834#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 13:02:39,091 INFO L290 TraceCheckUtils]: 19: Hoare triple {834#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {823#false} is VALID [2022-04-07 13:02:39,092 INFO L290 TraceCheckUtils]: 20: Hoare triple {823#false} assume !false; {823#false} is VALID [2022-04-07 13:02:39,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 13:02:39,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 13:02:39,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488223809] [2022-04-07 13:02:39,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488223809] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 13:02:39,093 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 13:02:39,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-07 13:02:39,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145896914] [2022-04-07 13:02:39,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 13:02:39,094 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2022-04-07 13:02:39,094 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 13:02:39,094 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 13:02:39,111 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 13:02:39,112 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-07 13:02:39,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 13:02:39,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-07 13:02:39,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-07 13:02:39,113 INFO L87 Difference]: Start difference. First operand 39 states and 52 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 13:02:43,252 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 13:02:45,291 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 13:02:51,663 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 13:02:53,910 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-07 13:03:00,344 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-07 13:03:02,381 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 13:03:04,386 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 13:03:04,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:03:04,466 INFO L93 Difference]: Finished difference Result 72 states and 104 transitions. [2022-04-07 13:03:04,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-07 13:03:04,467 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2022-04-07 13:03:04,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 13:03:04,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 13:03:04,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 104 transitions. [2022-04-07 13:03:04,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 13:03:04,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 104 transitions. [2022-04-07 13:03:04,473 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 104 transitions. [2022-04-07 13:03:04,578 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 13:03:04,579 INFO L225 Difference]: With dead ends: 72 [2022-04-07 13:03:04,579 INFO L226 Difference]: Without dead ends: 51 [2022-04-07 13:03:04,580 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-04-07 13:03:04,581 INFO L913 BasicCegarLoop]: 49 mSDtfsCounter, 24 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 37 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.3s IncrementalHoareTripleChecker+Time [2022-04-07 13:03:04,581 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 107 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 203 Invalid, 6 Unknown, 0 Unchecked, 20.3s Time] [2022-04-07 13:03:04,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-07 13:03:04,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-04-07 13:03:04,592 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 13:03:04,593 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 51 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 29 states have internal predecessors, (34), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-07 13:03:04,593 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 51 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 29 states have internal predecessors, (34), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-07 13:03:04,593 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 51 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 29 states have internal predecessors, (34), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-07 13:03:04,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:03:04,596 INFO L93 Difference]: Finished difference Result 51 states and 69 transitions. [2022-04-07 13:03:04,596 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 69 transitions. [2022-04-07 13:03:04,596 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:03:04,596 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:03:04,597 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 29 states have internal predecessors, (34), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 51 states. [2022-04-07 13:03:04,597 INFO L87 Difference]: Start difference. First operand has 51 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 29 states have internal predecessors, (34), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 51 states. [2022-04-07 13:03:04,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:03:04,599 INFO L93 Difference]: Finished difference Result 51 states and 69 transitions. [2022-04-07 13:03:04,599 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 69 transitions. [2022-04-07 13:03:04,599 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:03:04,600 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:03:04,600 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 13:03:04,600 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 13:03:04,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 29 states have internal predecessors, (34), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-07 13:03:04,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 69 transitions. [2022-04-07 13:03:04,602 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 69 transitions. Word has length 21 [2022-04-07 13:03:04,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 13:03:04,602 INFO L478 AbstractCegarLoop]: Abstraction has 51 states and 69 transitions. [2022-04-07 13:03:04,602 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 13:03:04,602 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 69 transitions. [2022-04-07 13:03:04,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-07 13:03:04,603 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 13:03:04,603 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 13:03:04,603 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-07 13:03:04,603 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 13:03:04,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 13:03:04,604 INFO L85 PathProgramCache]: Analyzing trace with hash -1701877900, now seen corresponding path program 1 times [2022-04-07 13:03:04,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 13:03:04,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047784858] [2022-04-07 13:03:04,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 13:03:04,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 13:03:04,626 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 13:03:04,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [209582707] [2022-04-07 13:03:04,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 13:03:04,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 13:03:04,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 13:03:04,644 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-07 13:03:04,674 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-07 13:03:04,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:03:04,706 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-07 13:03:04,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:03:04,715 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 13:03:04,812 INFO L272 TraceCheckUtils]: 0: Hoare triple {1137#true} call ULTIMATE.init(); {1137#true} is VALID [2022-04-07 13:03:04,813 INFO L290 TraceCheckUtils]: 1: Hoare triple {1137#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1145#(<= ~counter~0 0)} is VALID [2022-04-07 13:03:04,813 INFO L290 TraceCheckUtils]: 2: Hoare triple {1145#(<= ~counter~0 0)} assume true; {1145#(<= ~counter~0 0)} is VALID [2022-04-07 13:03:04,814 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1145#(<= ~counter~0 0)} {1137#true} #102#return; {1145#(<= ~counter~0 0)} is VALID [2022-04-07 13:03:04,814 INFO L272 TraceCheckUtils]: 4: Hoare triple {1145#(<= ~counter~0 0)} call #t~ret7 := main(); {1145#(<= ~counter~0 0)} is VALID [2022-04-07 13:03:04,815 INFO L290 TraceCheckUtils]: 5: Hoare triple {1145#(<= ~counter~0 0)} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {1145#(<= ~counter~0 0)} is VALID [2022-04-07 13:03:04,815 INFO L272 TraceCheckUtils]: 6: Hoare triple {1145#(<= ~counter~0 0)} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {1145#(<= ~counter~0 0)} is VALID [2022-04-07 13:03:04,815 INFO L290 TraceCheckUtils]: 7: Hoare triple {1145#(<= ~counter~0 0)} ~cond := #in~cond; {1145#(<= ~counter~0 0)} is VALID [2022-04-07 13:03:04,816 INFO L290 TraceCheckUtils]: 8: Hoare triple {1145#(<= ~counter~0 0)} assume !(0 == ~cond); {1145#(<= ~counter~0 0)} is VALID [2022-04-07 13:03:04,818 INFO L290 TraceCheckUtils]: 9: Hoare triple {1145#(<= ~counter~0 0)} assume true; {1145#(<= ~counter~0 0)} is VALID [2022-04-07 13:03:04,818 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1145#(<= ~counter~0 0)} {1145#(<= ~counter~0 0)} #82#return; {1145#(<= ~counter~0 0)} is VALID [2022-04-07 13:03:04,819 INFO L290 TraceCheckUtils]: 11: Hoare triple {1145#(<= ~counter~0 0)} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {1145#(<= ~counter~0 0)} is VALID [2022-04-07 13:03:04,819 INFO L290 TraceCheckUtils]: 12: Hoare triple {1145#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1179#(<= ~counter~0 1)} is VALID [2022-04-07 13:03:04,819 INFO L290 TraceCheckUtils]: 13: Hoare triple {1179#(<= ~counter~0 1)} assume !!(#t~post5 < 50);havoc #t~post5; {1179#(<= ~counter~0 1)} is VALID [2022-04-07 13:03:04,820 INFO L290 TraceCheckUtils]: 14: Hoare triple {1179#(<= ~counter~0 1)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {1179#(<= ~counter~0 1)} is VALID [2022-04-07 13:03:04,820 INFO L290 TraceCheckUtils]: 15: Hoare triple {1179#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1189#(<= |main_#t~post5| 1)} is VALID [2022-04-07 13:03:04,821 INFO L290 TraceCheckUtils]: 16: Hoare triple {1189#(<= |main_#t~post5| 1)} assume !(#t~post5 < 50);havoc #t~post5; {1138#false} is VALID [2022-04-07 13:03:04,821 INFO L290 TraceCheckUtils]: 17: Hoare triple {1138#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1138#false} is VALID [2022-04-07 13:03:04,821 INFO L290 TraceCheckUtils]: 18: Hoare triple {1138#false} assume !(#t~post6 < 50);havoc #t~post6; {1138#false} is VALID [2022-04-07 13:03:04,821 INFO L272 TraceCheckUtils]: 19: Hoare triple {1138#false} call __VERIFIER_assert((if 0 == (~h~0 * ~h~0 * ~h~0 - 12 * ~h~0 * ~n~0 + 16 * ~n~0 * ~p~0 + 12 * ~h~0 * ~r~0 - 16 * ~p~0 * ~r~0 - ~h~0 - 4 * ~p~0) % 4294967296 then 1 else 0)); {1138#false} is VALID [2022-04-07 13:03:04,821 INFO L290 TraceCheckUtils]: 20: Hoare triple {1138#false} ~cond := #in~cond; {1138#false} is VALID [2022-04-07 13:03:04,821 INFO L290 TraceCheckUtils]: 21: Hoare triple {1138#false} assume 0 == ~cond; {1138#false} is VALID [2022-04-07 13:03:04,821 INFO L290 TraceCheckUtils]: 22: Hoare triple {1138#false} assume !false; {1138#false} is VALID [2022-04-07 13:03:04,821 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 13:03:04,822 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 13:03:04,971 INFO L290 TraceCheckUtils]: 22: Hoare triple {1138#false} assume !false; {1138#false} is VALID [2022-04-07 13:03:04,971 INFO L290 TraceCheckUtils]: 21: Hoare triple {1138#false} assume 0 == ~cond; {1138#false} is VALID [2022-04-07 13:03:04,971 INFO L290 TraceCheckUtils]: 20: Hoare triple {1138#false} ~cond := #in~cond; {1138#false} is VALID [2022-04-07 13:03:04,972 INFO L272 TraceCheckUtils]: 19: Hoare triple {1138#false} call __VERIFIER_assert((if 0 == (~h~0 * ~h~0 * ~h~0 - 12 * ~h~0 * ~n~0 + 16 * ~n~0 * ~p~0 + 12 * ~h~0 * ~r~0 - 16 * ~p~0 * ~r~0 - ~h~0 - 4 * ~p~0) % 4294967296 then 1 else 0)); {1138#false} is VALID [2022-04-07 13:03:04,972 INFO L290 TraceCheckUtils]: 18: Hoare triple {1138#false} assume !(#t~post6 < 50);havoc #t~post6; {1138#false} is VALID [2022-04-07 13:03:04,972 INFO L290 TraceCheckUtils]: 17: Hoare triple {1138#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1138#false} is VALID [2022-04-07 13:03:04,973 INFO L290 TraceCheckUtils]: 16: Hoare triple {1229#(< |main_#t~post5| 50)} assume !(#t~post5 < 50);havoc #t~post5; {1138#false} is VALID [2022-04-07 13:03:04,973 INFO L290 TraceCheckUtils]: 15: Hoare triple {1233#(< ~counter~0 50)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1229#(< |main_#t~post5| 50)} is VALID [2022-04-07 13:03:04,974 INFO L290 TraceCheckUtils]: 14: Hoare triple {1233#(< ~counter~0 50)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {1233#(< ~counter~0 50)} is VALID [2022-04-07 13:03:04,974 INFO L290 TraceCheckUtils]: 13: Hoare triple {1233#(< ~counter~0 50)} assume !!(#t~post5 < 50);havoc #t~post5; {1233#(< ~counter~0 50)} is VALID [2022-04-07 13:03:04,975 INFO L290 TraceCheckUtils]: 12: Hoare triple {1243#(< ~counter~0 49)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1233#(< ~counter~0 50)} is VALID [2022-04-07 13:03:04,975 INFO L290 TraceCheckUtils]: 11: Hoare triple {1243#(< ~counter~0 49)} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {1243#(< ~counter~0 49)} is VALID [2022-04-07 13:03:04,976 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1137#true} {1243#(< ~counter~0 49)} #82#return; {1243#(< ~counter~0 49)} is VALID [2022-04-07 13:03:04,976 INFO L290 TraceCheckUtils]: 9: Hoare triple {1137#true} assume true; {1137#true} is VALID [2022-04-07 13:03:04,976 INFO L290 TraceCheckUtils]: 8: Hoare triple {1137#true} assume !(0 == ~cond); {1137#true} is VALID [2022-04-07 13:03:04,976 INFO L290 TraceCheckUtils]: 7: Hoare triple {1137#true} ~cond := #in~cond; {1137#true} is VALID [2022-04-07 13:03:04,976 INFO L272 TraceCheckUtils]: 6: Hoare triple {1243#(< ~counter~0 49)} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {1137#true} is VALID [2022-04-07 13:03:04,976 INFO L290 TraceCheckUtils]: 5: Hoare triple {1243#(< ~counter~0 49)} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {1243#(< ~counter~0 49)} is VALID [2022-04-07 13:03:04,977 INFO L272 TraceCheckUtils]: 4: Hoare triple {1243#(< ~counter~0 49)} call #t~ret7 := main(); {1243#(< ~counter~0 49)} is VALID [2022-04-07 13:03:04,977 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1243#(< ~counter~0 49)} {1137#true} #102#return; {1243#(< ~counter~0 49)} is VALID [2022-04-07 13:03:04,977 INFO L290 TraceCheckUtils]: 2: Hoare triple {1243#(< ~counter~0 49)} assume true; {1243#(< ~counter~0 49)} is VALID [2022-04-07 13:03:04,978 INFO L290 TraceCheckUtils]: 1: Hoare triple {1137#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1243#(< ~counter~0 49)} is VALID [2022-04-07 13:03:04,978 INFO L272 TraceCheckUtils]: 0: Hoare triple {1137#true} call ULTIMATE.init(); {1137#true} is VALID [2022-04-07 13:03:04,978 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 13:03:04,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 13:03:04,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047784858] [2022-04-07 13:03:04,979 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 13:03:04,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [209582707] [2022-04-07 13:03:04,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [209582707] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 13:03:04,979 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 13:03:04,979 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-07 13:03:04,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876463210] [2022-04-07 13:03:04,979 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 13:03:04,979 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 23 [2022-04-07 13:03:04,980 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 13:03:04,980 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-07 13:03:05,006 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 13:03:05,007 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-07 13:03:05,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 13:03:05,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-07 13:03:05,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-07 13:03:05,007 INFO L87 Difference]: Start difference. First operand 51 states and 69 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-07 13:03:10,670 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-07 13:03:16,125 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-07 13:03:18,212 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 13:03:22,709 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-07 13:03:24,764 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 13:03:27,008 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 13:03:29,807 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 13:03:31,896 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 13:03:32,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:03:32,037 INFO L93 Difference]: Finished difference Result 102 states and 144 transitions. [2022-04-07 13:03:32,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-07 13:03:32,037 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 23 [2022-04-07 13:03:32,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 13:03:32,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-07 13:03:32,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 137 transitions. [2022-04-07 13:03:32,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-07 13:03:32,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 137 transitions. [2022-04-07 13:03:32,042 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 137 transitions. [2022-04-07 13:03:32,152 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 137 edges. 137 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 13:03:32,154 INFO L225 Difference]: With dead ends: 102 [2022-04-07 13:03:32,154 INFO L226 Difference]: Without dead ends: 83 [2022-04-07 13:03:32,154 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-04-07 13:03:32,155 INFO L913 BasicCegarLoop]: 56 mSDtfsCounter, 62 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 23 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.9s IncrementalHoareTripleChecker+Time [2022-04-07 13:03:32,155 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 237 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 82 Invalid, 7 Unknown, 0 Unchecked, 21.9s Time] [2022-04-07 13:03:32,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-04-07 13:03:32,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 79. [2022-04-07 13:03:32,179 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 13:03:32,179 INFO L82 GeneralOperation]: Start isEquivalent. First operand 83 states. Second operand has 79 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 47 states have internal predecessors, (56), 28 states have call successors, (28), 7 states have call predecessors, (28), 6 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-07 13:03:32,181 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand has 79 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 47 states have internal predecessors, (56), 28 states have call successors, (28), 7 states have call predecessors, (28), 6 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-07 13:03:32,182 INFO L87 Difference]: Start difference. First operand 83 states. Second operand has 79 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 47 states have internal predecessors, (56), 28 states have call successors, (28), 7 states have call predecessors, (28), 6 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-07 13:03:32,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:03:32,209 INFO L93 Difference]: Finished difference Result 83 states and 112 transitions. [2022-04-07 13:03:32,209 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 112 transitions. [2022-04-07 13:03:32,210 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:03:32,210 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:03:32,211 INFO L74 IsIncluded]: Start isIncluded. First operand has 79 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 47 states have internal predecessors, (56), 28 states have call successors, (28), 7 states have call predecessors, (28), 6 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand 83 states. [2022-04-07 13:03:32,211 INFO L87 Difference]: Start difference. First operand has 79 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 47 states have internal predecessors, (56), 28 states have call successors, (28), 7 states have call predecessors, (28), 6 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand 83 states. [2022-04-07 13:03:32,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:03:32,215 INFO L93 Difference]: Finished difference Result 83 states and 112 transitions. [2022-04-07 13:03:32,215 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 112 transitions. [2022-04-07 13:03:32,216 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:03:32,216 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:03:32,216 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 13:03:32,216 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 13:03:32,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 47 states have internal predecessors, (56), 28 states have call successors, (28), 7 states have call predecessors, (28), 6 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-07 13:03:32,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 108 transitions. [2022-04-07 13:03:32,222 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 108 transitions. Word has length 23 [2022-04-07 13:03:32,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 13:03:32,222 INFO L478 AbstractCegarLoop]: Abstraction has 79 states and 108 transitions. [2022-04-07 13:03:32,222 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-07 13:03:32,222 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 108 transitions. [2022-04-07 13:03:32,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-07 13:03:32,223 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 13:03:32,224 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 13:03:32,240 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-07 13:03:32,430 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 13:03:32,431 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 13:03:32,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 13:03:32,432 INFO L85 PathProgramCache]: Analyzing trace with hash -1564262277, now seen corresponding path program 1 times [2022-04-07 13:03:32,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 13:03:32,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17236686] [2022-04-07 13:03:32,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 13:03:32,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 13:03:32,450 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 13:03:32,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [196407339] [2022-04-07 13:03:32,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 13:03:32,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 13:03:32,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 13:03:32,453 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-07 13:03:32,454 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-07 13:03:32,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:03:32,486 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-07 13:03:32,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:03:32,494 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 13:03:32,637 INFO L272 TraceCheckUtils]: 0: Hoare triple {1725#true} call ULTIMATE.init(); {1725#true} is VALID [2022-04-07 13:03:32,637 INFO L290 TraceCheckUtils]: 1: Hoare triple {1725#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1733#(<= ~counter~0 0)} is VALID [2022-04-07 13:03:32,638 INFO L290 TraceCheckUtils]: 2: Hoare triple {1733#(<= ~counter~0 0)} assume true; {1733#(<= ~counter~0 0)} is VALID [2022-04-07 13:03:32,638 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1733#(<= ~counter~0 0)} {1725#true} #102#return; {1733#(<= ~counter~0 0)} is VALID [2022-04-07 13:03:32,638 INFO L272 TraceCheckUtils]: 4: Hoare triple {1733#(<= ~counter~0 0)} call #t~ret7 := main(); {1733#(<= ~counter~0 0)} is VALID [2022-04-07 13:03:32,639 INFO L290 TraceCheckUtils]: 5: Hoare triple {1733#(<= ~counter~0 0)} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {1733#(<= ~counter~0 0)} is VALID [2022-04-07 13:03:32,639 INFO L272 TraceCheckUtils]: 6: Hoare triple {1733#(<= ~counter~0 0)} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {1733#(<= ~counter~0 0)} is VALID [2022-04-07 13:03:32,639 INFO L290 TraceCheckUtils]: 7: Hoare triple {1733#(<= ~counter~0 0)} ~cond := #in~cond; {1733#(<= ~counter~0 0)} is VALID [2022-04-07 13:03:32,640 INFO L290 TraceCheckUtils]: 8: Hoare triple {1733#(<= ~counter~0 0)} assume !(0 == ~cond); {1733#(<= ~counter~0 0)} is VALID [2022-04-07 13:03:32,640 INFO L290 TraceCheckUtils]: 9: Hoare triple {1733#(<= ~counter~0 0)} assume true; {1733#(<= ~counter~0 0)} is VALID [2022-04-07 13:03:32,640 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1733#(<= ~counter~0 0)} {1733#(<= ~counter~0 0)} #82#return; {1733#(<= ~counter~0 0)} is VALID [2022-04-07 13:03:32,641 INFO L290 TraceCheckUtils]: 11: Hoare triple {1733#(<= ~counter~0 0)} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {1733#(<= ~counter~0 0)} is VALID [2022-04-07 13:03:32,641 INFO L290 TraceCheckUtils]: 12: Hoare triple {1733#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1767#(<= ~counter~0 1)} is VALID [2022-04-07 13:03:32,641 INFO L290 TraceCheckUtils]: 13: Hoare triple {1767#(<= ~counter~0 1)} assume !!(#t~post5 < 50);havoc #t~post5; {1767#(<= ~counter~0 1)} is VALID [2022-04-07 13:03:32,642 INFO L290 TraceCheckUtils]: 14: Hoare triple {1767#(<= ~counter~0 1)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {1767#(<= ~counter~0 1)} is VALID [2022-04-07 13:03:32,645 INFO L290 TraceCheckUtils]: 15: Hoare triple {1767#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1777#(<= ~counter~0 2)} is VALID [2022-04-07 13:03:32,645 INFO L290 TraceCheckUtils]: 16: Hoare triple {1777#(<= ~counter~0 2)} assume !!(#t~post5 < 50);havoc #t~post5; {1777#(<= ~counter~0 2)} is VALID [2022-04-07 13:03:32,646 INFO L290 TraceCheckUtils]: 17: Hoare triple {1777#(<= ~counter~0 2)} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {1777#(<= ~counter~0 2)} is VALID [2022-04-07 13:03:32,646 INFO L290 TraceCheckUtils]: 18: Hoare triple {1777#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1787#(<= |main_#t~post6| 2)} is VALID [2022-04-07 13:03:32,646 INFO L290 TraceCheckUtils]: 19: Hoare triple {1787#(<= |main_#t~post6| 2)} assume !(#t~post6 < 50);havoc #t~post6; {1726#false} is VALID [2022-04-07 13:03:32,647 INFO L272 TraceCheckUtils]: 20: Hoare triple {1726#false} call __VERIFIER_assert((if 0 == (~h~0 * ~h~0 * ~h~0 - 12 * ~h~0 * ~n~0 + 16 * ~n~0 * ~p~0 + 12 * ~h~0 * ~r~0 - 16 * ~p~0 * ~r~0 - ~h~0 - 4 * ~p~0) % 4294967296 then 1 else 0)); {1726#false} is VALID [2022-04-07 13:03:32,647 INFO L290 TraceCheckUtils]: 21: Hoare triple {1726#false} ~cond := #in~cond; {1726#false} is VALID [2022-04-07 13:03:32,647 INFO L290 TraceCheckUtils]: 22: Hoare triple {1726#false} assume 0 == ~cond; {1726#false} is VALID [2022-04-07 13:03:32,647 INFO L290 TraceCheckUtils]: 23: Hoare triple {1726#false} assume !false; {1726#false} is VALID [2022-04-07 13:03:32,647 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 13:03:32,647 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 13:03:32,808 INFO L290 TraceCheckUtils]: 23: Hoare triple {1726#false} assume !false; {1726#false} is VALID [2022-04-07 13:03:32,809 INFO L290 TraceCheckUtils]: 22: Hoare triple {1726#false} assume 0 == ~cond; {1726#false} is VALID [2022-04-07 13:03:32,809 INFO L290 TraceCheckUtils]: 21: Hoare triple {1726#false} ~cond := #in~cond; {1726#false} is VALID [2022-04-07 13:03:32,809 INFO L272 TraceCheckUtils]: 20: Hoare triple {1726#false} call __VERIFIER_assert((if 0 == (~h~0 * ~h~0 * ~h~0 - 12 * ~h~0 * ~n~0 + 16 * ~n~0 * ~p~0 + 12 * ~h~0 * ~r~0 - 16 * ~p~0 * ~r~0 - ~h~0 - 4 * ~p~0) % 4294967296 then 1 else 0)); {1726#false} is VALID [2022-04-07 13:03:32,809 INFO L290 TraceCheckUtils]: 19: Hoare triple {1815#(< |main_#t~post6| 50)} assume !(#t~post6 < 50);havoc #t~post6; {1726#false} is VALID [2022-04-07 13:03:32,809 INFO L290 TraceCheckUtils]: 18: Hoare triple {1819#(< ~counter~0 50)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1815#(< |main_#t~post6| 50)} is VALID [2022-04-07 13:03:32,810 INFO L290 TraceCheckUtils]: 17: Hoare triple {1819#(< ~counter~0 50)} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {1819#(< ~counter~0 50)} is VALID [2022-04-07 13:03:32,810 INFO L290 TraceCheckUtils]: 16: Hoare triple {1819#(< ~counter~0 50)} assume !!(#t~post5 < 50);havoc #t~post5; {1819#(< ~counter~0 50)} is VALID [2022-04-07 13:03:32,811 INFO L290 TraceCheckUtils]: 15: Hoare triple {1829#(< ~counter~0 49)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1819#(< ~counter~0 50)} is VALID [2022-04-07 13:03:32,811 INFO L290 TraceCheckUtils]: 14: Hoare triple {1829#(< ~counter~0 49)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {1829#(< ~counter~0 49)} is VALID [2022-04-07 13:03:32,821 INFO L290 TraceCheckUtils]: 13: Hoare triple {1829#(< ~counter~0 49)} assume !!(#t~post5 < 50);havoc #t~post5; {1829#(< ~counter~0 49)} is VALID [2022-04-07 13:03:32,821 INFO L290 TraceCheckUtils]: 12: Hoare triple {1839#(< ~counter~0 48)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1829#(< ~counter~0 49)} is VALID [2022-04-07 13:03:32,822 INFO L290 TraceCheckUtils]: 11: Hoare triple {1839#(< ~counter~0 48)} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {1839#(< ~counter~0 48)} is VALID [2022-04-07 13:03:32,822 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1725#true} {1839#(< ~counter~0 48)} #82#return; {1839#(< ~counter~0 48)} is VALID [2022-04-07 13:03:32,822 INFO L290 TraceCheckUtils]: 9: Hoare triple {1725#true} assume true; {1725#true} is VALID [2022-04-07 13:03:32,822 INFO L290 TraceCheckUtils]: 8: Hoare triple {1725#true} assume !(0 == ~cond); {1725#true} is VALID [2022-04-07 13:03:32,822 INFO L290 TraceCheckUtils]: 7: Hoare triple {1725#true} ~cond := #in~cond; {1725#true} is VALID [2022-04-07 13:03:32,822 INFO L272 TraceCheckUtils]: 6: Hoare triple {1839#(< ~counter~0 48)} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {1725#true} is VALID [2022-04-07 13:03:32,823 INFO L290 TraceCheckUtils]: 5: Hoare triple {1839#(< ~counter~0 48)} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {1839#(< ~counter~0 48)} is VALID [2022-04-07 13:03:32,823 INFO L272 TraceCheckUtils]: 4: Hoare triple {1839#(< ~counter~0 48)} call #t~ret7 := main(); {1839#(< ~counter~0 48)} is VALID [2022-04-07 13:03:32,823 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1839#(< ~counter~0 48)} {1725#true} #102#return; {1839#(< ~counter~0 48)} is VALID [2022-04-07 13:03:32,824 INFO L290 TraceCheckUtils]: 2: Hoare triple {1839#(< ~counter~0 48)} assume true; {1839#(< ~counter~0 48)} is VALID [2022-04-07 13:03:32,824 INFO L290 TraceCheckUtils]: 1: Hoare triple {1725#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1839#(< ~counter~0 48)} is VALID [2022-04-07 13:03:32,824 INFO L272 TraceCheckUtils]: 0: Hoare triple {1725#true} call ULTIMATE.init(); {1725#true} is VALID [2022-04-07 13:03:32,824 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 13:03:32,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 13:03:32,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17236686] [2022-04-07 13:03:32,825 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 13:03:32,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [196407339] [2022-04-07 13:03:32,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [196407339] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 13:03:32,825 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 13:03:32,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-07 13:03:32,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667409236] [2022-04-07 13:03:32,825 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 13:03:32,826 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 24 [2022-04-07 13:03:32,826 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 13:03:32,826 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-07 13:03:32,849 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 13:03:32,849 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-07 13:03:32,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 13:03:32,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-07 13:03:32,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-07 13:03:32,850 INFO L87 Difference]: Start difference. First operand 79 states and 108 transitions. Second operand has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-07 13:03:35,424 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 13:03:42,375 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 13:03:44,377 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 13:03:46,417 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 13:03:53,620 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 13:03:55,895 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 13:03:59,941 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 13:04:01,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:04:01,027 INFO L93 Difference]: Finished difference Result 149 states and 204 transitions. [2022-04-07 13:04:01,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-07 13:04:01,027 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 24 [2022-04-07 13:04:01,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 13:04:01,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-07 13:04:01,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 189 transitions. [2022-04-07 13:04:01,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-07 13:04:01,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 189 transitions. [2022-04-07 13:04:01,034 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 189 transitions. [2022-04-07 13:04:01,189 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 189 edges. 189 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 13:04:01,192 INFO L225 Difference]: With dead ends: 149 [2022-04-07 13:04:01,192 INFO L226 Difference]: Without dead ends: 133 [2022-04-07 13:04:01,193 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2022-04-07 13:04:01,193 INFO L913 BasicCegarLoop]: 78 mSDtfsCounter, 148 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 71 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.2s IncrementalHoareTripleChecker+Time [2022-04-07 13:04:01,194 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [148 Valid, 342 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 128 Invalid, 7 Unknown, 0 Unchecked, 18.2s Time] [2022-04-07 13:04:01,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-04-07 13:04:01,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 124. [2022-04-07 13:04:01,246 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 13:04:01,246 INFO L82 GeneralOperation]: Start isEquivalent. First operand 133 states. Second operand has 124 states, 68 states have (on average 1.3235294117647058) internal successors, (90), 73 states have internal predecessors, (90), 46 states have call successors, (46), 10 states have call predecessors, (46), 9 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2022-04-07 13:04:01,246 INFO L74 IsIncluded]: Start isIncluded. First operand 133 states. Second operand has 124 states, 68 states have (on average 1.3235294117647058) internal successors, (90), 73 states have internal predecessors, (90), 46 states have call successors, (46), 10 states have call predecessors, (46), 9 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2022-04-07 13:04:01,247 INFO L87 Difference]: Start difference. First operand 133 states. Second operand has 124 states, 68 states have (on average 1.3235294117647058) internal successors, (90), 73 states have internal predecessors, (90), 46 states have call successors, (46), 10 states have call predecessors, (46), 9 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2022-04-07 13:04:01,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:04:01,251 INFO L93 Difference]: Finished difference Result 133 states and 181 transitions. [2022-04-07 13:04:01,251 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 181 transitions. [2022-04-07 13:04:01,251 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:04:01,251 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:04:01,252 INFO L74 IsIncluded]: Start isIncluded. First operand has 124 states, 68 states have (on average 1.3235294117647058) internal successors, (90), 73 states have internal predecessors, (90), 46 states have call successors, (46), 10 states have call predecessors, (46), 9 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) Second operand 133 states. [2022-04-07 13:04:01,252 INFO L87 Difference]: Start difference. First operand has 124 states, 68 states have (on average 1.3235294117647058) internal successors, (90), 73 states have internal predecessors, (90), 46 states have call successors, (46), 10 states have call predecessors, (46), 9 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) Second operand 133 states. [2022-04-07 13:04:01,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:04:01,257 INFO L93 Difference]: Finished difference Result 133 states and 181 transitions. [2022-04-07 13:04:01,257 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 181 transitions. [2022-04-07 13:04:01,258 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:04:01,258 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:04:01,258 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 13:04:01,258 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 13:04:01,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 68 states have (on average 1.3235294117647058) internal successors, (90), 73 states have internal predecessors, (90), 46 states have call successors, (46), 10 states have call predecessors, (46), 9 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2022-04-07 13:04:01,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 176 transitions. [2022-04-07 13:04:01,262 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 176 transitions. Word has length 24 [2022-04-07 13:04:01,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 13:04:01,263 INFO L478 AbstractCegarLoop]: Abstraction has 124 states and 176 transitions. [2022-04-07 13:04:01,263 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-07 13:04:01,263 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 176 transitions. [2022-04-07 13:04:01,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-07 13:04:01,263 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 13:04:01,263 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 13:04:01,280 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-07 13:04:01,480 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 13:04:01,480 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 13:04:01,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 13:04:01,480 INFO L85 PathProgramCache]: Analyzing trace with hash -1562772727, now seen corresponding path program 1 times [2022-04-07 13:04:01,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 13:04:01,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416793611] [2022-04-07 13:04:01,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 13:04:01,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 13:04:01,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:04:01,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 13:04:01,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:04:01,729 INFO L290 TraceCheckUtils]: 0: Hoare triple {2572#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2558#true} is VALID [2022-04-07 13:04:01,729 INFO L290 TraceCheckUtils]: 1: Hoare triple {2558#true} assume true; {2558#true} is VALID [2022-04-07 13:04:01,729 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2558#true} {2558#true} #102#return; {2558#true} is VALID [2022-04-07 13:04:01,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-07 13:04:01,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:04:01,738 INFO L290 TraceCheckUtils]: 0: Hoare triple {2558#true} ~cond := #in~cond; {2558#true} is VALID [2022-04-07 13:04:01,738 INFO L290 TraceCheckUtils]: 1: Hoare triple {2558#true} assume !(0 == ~cond); {2558#true} is VALID [2022-04-07 13:04:01,738 INFO L290 TraceCheckUtils]: 2: Hoare triple {2558#true} assume true; {2558#true} is VALID [2022-04-07 13:04:01,738 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2558#true} {2558#true} #82#return; {2558#true} is VALID [2022-04-07 13:04:01,739 INFO L272 TraceCheckUtils]: 0: Hoare triple {2558#true} call ULTIMATE.init(); {2572#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 13:04:01,739 INFO L290 TraceCheckUtils]: 1: Hoare triple {2572#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2558#true} is VALID [2022-04-07 13:04:01,740 INFO L290 TraceCheckUtils]: 2: Hoare triple {2558#true} assume true; {2558#true} is VALID [2022-04-07 13:04:01,741 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2558#true} {2558#true} #102#return; {2558#true} is VALID [2022-04-07 13:04:01,744 INFO L272 TraceCheckUtils]: 4: Hoare triple {2558#true} call #t~ret7 := main(); {2558#true} is VALID [2022-04-07 13:04:01,744 INFO L290 TraceCheckUtils]: 5: Hoare triple {2558#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {2558#true} is VALID [2022-04-07 13:04:01,744 INFO L272 TraceCheckUtils]: 6: Hoare triple {2558#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {2558#true} is VALID [2022-04-07 13:04:01,744 INFO L290 TraceCheckUtils]: 7: Hoare triple {2558#true} ~cond := #in~cond; {2558#true} is VALID [2022-04-07 13:04:01,744 INFO L290 TraceCheckUtils]: 8: Hoare triple {2558#true} assume !(0 == ~cond); {2558#true} is VALID [2022-04-07 13:04:01,744 INFO L290 TraceCheckUtils]: 9: Hoare triple {2558#true} assume true; {2558#true} is VALID [2022-04-07 13:04:01,744 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2558#true} {2558#true} #82#return; {2558#true} is VALID [2022-04-07 13:04:01,745 INFO L290 TraceCheckUtils]: 11: Hoare triple {2558#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {2567#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-07 13:04:01,745 INFO L290 TraceCheckUtils]: 12: Hoare triple {2567#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2567#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-07 13:04:01,746 INFO L290 TraceCheckUtils]: 13: Hoare triple {2567#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} assume !!(#t~post5 < 50);havoc #t~post5; {2567#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-07 13:04:01,746 INFO L290 TraceCheckUtils]: 14: Hoare triple {2567#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {2568#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-07 13:04:01,747 INFO L290 TraceCheckUtils]: 15: Hoare triple {2568#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2568#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-07 13:04:01,747 INFO L290 TraceCheckUtils]: 16: Hoare triple {2568#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} assume !!(#t~post5 < 50);havoc #t~post5; {2568#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-07 13:04:01,748 INFO L290 TraceCheckUtils]: 17: Hoare triple {2568#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {2569#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0))} is VALID [2022-04-07 13:04:01,748 INFO L290 TraceCheckUtils]: 18: Hoare triple {2569#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2569#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0))} is VALID [2022-04-07 13:04:01,749 INFO L290 TraceCheckUtils]: 19: Hoare triple {2569#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0))} assume !!(#t~post6 < 50);havoc #t~post6; {2569#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0))} is VALID [2022-04-07 13:04:01,750 INFO L272 TraceCheckUtils]: 20: Hoare triple {2569#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0))} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {2570#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 13:04:01,750 INFO L290 TraceCheckUtils]: 21: Hoare triple {2570#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {2571#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 13:04:01,750 INFO L290 TraceCheckUtils]: 22: Hoare triple {2571#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {2559#false} is VALID [2022-04-07 13:04:01,750 INFO L290 TraceCheckUtils]: 23: Hoare triple {2559#false} assume !false; {2559#false} is VALID [2022-04-07 13:04:01,751 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 13:04:01,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 13:04:01,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416793611] [2022-04-07 13:04:01,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416793611] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 13:04:01,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1746883210] [2022-04-07 13:04:01,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 13:04:01,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 13:04:01,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 13:04:01,753 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-07 13:04:01,754 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-07 13:04:01,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:04:01,799 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-07 13:04:01,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:04:01,806 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 13:04:02,063 INFO L272 TraceCheckUtils]: 0: Hoare triple {2558#true} call ULTIMATE.init(); {2558#true} is VALID [2022-04-07 13:04:02,064 INFO L290 TraceCheckUtils]: 1: Hoare triple {2558#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2558#true} is VALID [2022-04-07 13:04:02,064 INFO L290 TraceCheckUtils]: 2: Hoare triple {2558#true} assume true; {2558#true} is VALID [2022-04-07 13:04:02,064 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2558#true} {2558#true} #102#return; {2558#true} is VALID [2022-04-07 13:04:02,064 INFO L272 TraceCheckUtils]: 4: Hoare triple {2558#true} call #t~ret7 := main(); {2558#true} is VALID [2022-04-07 13:04:02,064 INFO L290 TraceCheckUtils]: 5: Hoare triple {2558#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {2558#true} is VALID [2022-04-07 13:04:02,064 INFO L272 TraceCheckUtils]: 6: Hoare triple {2558#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {2558#true} is VALID [2022-04-07 13:04:02,064 INFO L290 TraceCheckUtils]: 7: Hoare triple {2558#true} ~cond := #in~cond; {2558#true} is VALID [2022-04-07 13:04:02,064 INFO L290 TraceCheckUtils]: 8: Hoare triple {2558#true} assume !(0 == ~cond); {2558#true} is VALID [2022-04-07 13:04:02,064 INFO L290 TraceCheckUtils]: 9: Hoare triple {2558#true} assume true; {2558#true} is VALID [2022-04-07 13:04:02,064 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2558#true} {2558#true} #82#return; {2558#true} is VALID [2022-04-07 13:04:02,065 INFO L290 TraceCheckUtils]: 11: Hoare triple {2558#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {2567#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-07 13:04:02,065 INFO L290 TraceCheckUtils]: 12: Hoare triple {2567#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2567#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-07 13:04:02,065 INFO L290 TraceCheckUtils]: 13: Hoare triple {2567#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} assume !!(#t~post5 < 50);havoc #t~post5; {2567#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-07 13:04:02,066 INFO L290 TraceCheckUtils]: 14: Hoare triple {2567#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {2618#(and (= main_~p~0 0) (= main_~q~0 4) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-07 13:04:02,067 INFO L290 TraceCheckUtils]: 15: Hoare triple {2618#(and (= main_~p~0 0) (= main_~q~0 4) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2618#(and (= main_~p~0 0) (= main_~q~0 4) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-07 13:04:02,067 INFO L290 TraceCheckUtils]: 16: Hoare triple {2618#(and (= main_~p~0 0) (= main_~q~0 4) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} assume !!(#t~post5 < 50);havoc #t~post5; {2618#(and (= main_~p~0 0) (= main_~q~0 4) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-07 13:04:02,068 INFO L290 TraceCheckUtils]: 17: Hoare triple {2618#(and (= main_~p~0 0) (= main_~q~0 4) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {2628#(and (not (<= (mod main_~q~0 4294967296) (mod main_~r~0 4294967296))) (= main_~p~0 0) (= main_~q~0 4))} is VALID [2022-04-07 13:04:02,068 INFO L290 TraceCheckUtils]: 18: Hoare triple {2628#(and (not (<= (mod main_~q~0 4294967296) (mod main_~r~0 4294967296))) (= main_~p~0 0) (= main_~q~0 4))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2628#(and (not (<= (mod main_~q~0 4294967296) (mod main_~r~0 4294967296))) (= main_~p~0 0) (= main_~q~0 4))} is VALID [2022-04-07 13:04:02,069 INFO L290 TraceCheckUtils]: 19: Hoare triple {2628#(and (not (<= (mod main_~q~0 4294967296) (mod main_~r~0 4294967296))) (= main_~p~0 0) (= main_~q~0 4))} assume !!(#t~post6 < 50);havoc #t~post6; {2628#(and (not (<= (mod main_~q~0 4294967296) (mod main_~r~0 4294967296))) (= main_~p~0 0) (= main_~q~0 4))} is VALID [2022-04-07 13:04:02,069 INFO L272 TraceCheckUtils]: 20: Hoare triple {2628#(and (not (<= (mod main_~q~0 4294967296) (mod main_~r~0 4294967296))) (= main_~p~0 0) (= main_~q~0 4))} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {2638#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 13:04:02,070 INFO L290 TraceCheckUtils]: 21: Hoare triple {2638#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2642#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 13:04:02,070 INFO L290 TraceCheckUtils]: 22: Hoare triple {2642#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2559#false} is VALID [2022-04-07 13:04:02,070 INFO L290 TraceCheckUtils]: 23: Hoare triple {2559#false} assume !false; {2559#false} is VALID [2022-04-07 13:04:02,070 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 13:04:02,070 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 13:04:02,273 INFO L290 TraceCheckUtils]: 23: Hoare triple {2559#false} assume !false; {2559#false} is VALID [2022-04-07 13:04:02,273 INFO L290 TraceCheckUtils]: 22: Hoare triple {2642#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2559#false} is VALID [2022-04-07 13:04:02,274 INFO L290 TraceCheckUtils]: 21: Hoare triple {2638#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2642#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 13:04:02,274 INFO L272 TraceCheckUtils]: 20: Hoare triple {2658#(< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296))} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {2638#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 13:04:02,275 INFO L290 TraceCheckUtils]: 19: Hoare triple {2658#(< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296))} assume !!(#t~post6 < 50);havoc #t~post6; {2658#(< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296))} is VALID [2022-04-07 13:04:02,275 INFO L290 TraceCheckUtils]: 18: Hoare triple {2658#(< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2658#(< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296))} is VALID [2022-04-07 13:04:02,276 INFO L290 TraceCheckUtils]: 17: Hoare triple {2668#(or (<= (mod main_~q~0 4294967296) (mod main_~n~0 4294967296)) (< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296)))} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {2658#(< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296))} is VALID [2022-04-07 13:04:02,277 INFO L290 TraceCheckUtils]: 16: Hoare triple {2668#(or (<= (mod main_~q~0 4294967296) (mod main_~n~0 4294967296)) (< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296)))} assume !!(#t~post5 < 50);havoc #t~post5; {2668#(or (<= (mod main_~q~0 4294967296) (mod main_~n~0 4294967296)) (< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296)))} is VALID [2022-04-07 13:04:02,278 INFO L290 TraceCheckUtils]: 15: Hoare triple {2668#(or (<= (mod main_~q~0 4294967296) (mod main_~n~0 4294967296)) (< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2668#(or (<= (mod main_~q~0 4294967296) (mod main_~n~0 4294967296)) (< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296)))} is VALID [2022-04-07 13:04:02,289 INFO L290 TraceCheckUtils]: 14: Hoare triple {2678#(or (<= (mod (* main_~q~0 4) 4294967296) (mod main_~n~0 4294967296)) (< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) (* main_~q~0 4)) 4294967296)))} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {2668#(or (<= (mod main_~q~0 4294967296) (mod main_~n~0 4294967296)) (< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296)))} is VALID [2022-04-07 13:04:02,291 INFO L290 TraceCheckUtils]: 13: Hoare triple {2678#(or (<= (mod (* main_~q~0 4) 4294967296) (mod main_~n~0 4294967296)) (< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) (* main_~q~0 4)) 4294967296)))} assume !!(#t~post5 < 50);havoc #t~post5; {2678#(or (<= (mod (* main_~q~0 4) 4294967296) (mod main_~n~0 4294967296)) (< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) (* main_~q~0 4)) 4294967296)))} is VALID [2022-04-07 13:04:02,291 INFO L290 TraceCheckUtils]: 12: Hoare triple {2678#(or (<= (mod (* main_~q~0 4) 4294967296) (mod main_~n~0 4294967296)) (< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) (* main_~q~0 4)) 4294967296)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2678#(or (<= (mod (* main_~q~0 4) 4294967296) (mod main_~n~0 4294967296)) (< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) (* main_~q~0 4)) 4294967296)))} is VALID [2022-04-07 13:04:02,294 INFO L290 TraceCheckUtils]: 11: Hoare triple {2558#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {2678#(or (<= (mod (* main_~q~0 4) 4294967296) (mod main_~n~0 4294967296)) (< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) (* main_~q~0 4)) 4294967296)))} is VALID [2022-04-07 13:04:02,294 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2558#true} {2558#true} #82#return; {2558#true} is VALID [2022-04-07 13:04:02,294 INFO L290 TraceCheckUtils]: 9: Hoare triple {2558#true} assume true; {2558#true} is VALID [2022-04-07 13:04:02,294 INFO L290 TraceCheckUtils]: 8: Hoare triple {2558#true} assume !(0 == ~cond); {2558#true} is VALID [2022-04-07 13:04:02,294 INFO L290 TraceCheckUtils]: 7: Hoare triple {2558#true} ~cond := #in~cond; {2558#true} is VALID [2022-04-07 13:04:02,294 INFO L272 TraceCheckUtils]: 6: Hoare triple {2558#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {2558#true} is VALID [2022-04-07 13:04:02,294 INFO L290 TraceCheckUtils]: 5: Hoare triple {2558#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {2558#true} is VALID [2022-04-07 13:04:02,294 INFO L272 TraceCheckUtils]: 4: Hoare triple {2558#true} call #t~ret7 := main(); {2558#true} is VALID [2022-04-07 13:04:02,295 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2558#true} {2558#true} #102#return; {2558#true} is VALID [2022-04-07 13:04:02,295 INFO L290 TraceCheckUtils]: 2: Hoare triple {2558#true} assume true; {2558#true} is VALID [2022-04-07 13:04:02,295 INFO L290 TraceCheckUtils]: 1: Hoare triple {2558#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2558#true} is VALID [2022-04-07 13:04:02,295 INFO L272 TraceCheckUtils]: 0: Hoare triple {2558#true} call ULTIMATE.init(); {2558#true} is VALID [2022-04-07 13:04:02,295 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 13:04:02,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1746883210] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 13:04:02,295 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 13:04:02,295 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 15 [2022-04-07 13:04:02,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555348816] [2022-04-07 13:04:02,295 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 13:04:02,296 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.4) internal successors, (36), 12 states have internal predecessors, (36), 4 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2022-04-07 13:04:02,296 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 13:04:02,296 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 2.4) internal successors, (36), 12 states have internal predecessors, (36), 4 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 13:04:02,340 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-07 13:04:02,340 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-07 13:04:02,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 13:04:02,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-07 13:04:02,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2022-04-07 13:04:02,341 INFO L87 Difference]: Start difference. First operand 124 states and 176 transitions. Second operand has 15 states, 15 states have (on average 2.4) internal successors, (36), 12 states have internal predecessors, (36), 4 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 13:04:06,813 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-07 13:04:08,815 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-07 13:04:10,823 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-07 13:04:12,888 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-07 13:04:14,890 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-07 13:04:18,965 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-07 13:04:20,967 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-07 13:04:22,969 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-07 13:04:27,235 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-07 13:04:29,237 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-07 13:04:31,243 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 13:04:33,344 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 13:04:36,066 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-07 13:04:39,531 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-07 13:04:43,980 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 13:04:46,274 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 13:04:52,320 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 13:05:07,919 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 13:05:09,923 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 13:05:11,931 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 13:05:13,939 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 13:05:20,843 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 13:05:22,941 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 13:05:24,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:05:24,059 INFO L93 Difference]: Finished difference Result 198 states and 287 transitions. [2022-04-07 13:05:24,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-07 13:05:24,060 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.4) internal successors, (36), 12 states have internal predecessors, (36), 4 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2022-04-07 13:05:24,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 13:05:24,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.4) internal successors, (36), 12 states have internal predecessors, (36), 4 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 13:05:24,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 144 transitions. [2022-04-07 13:05:24,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.4) internal successors, (36), 12 states have internal predecessors, (36), 4 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 13:05:24,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 144 transitions. [2022-04-07 13:05:24,065 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 144 transitions. [2022-04-07 13:05:24,776 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 144 edges. 144 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 13:05:24,779 INFO L225 Difference]: With dead ends: 198 [2022-04-07 13:05:24,779 INFO L226 Difference]: Without dead ends: 181 [2022-04-07 13:05:24,780 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=367, Unknown=0, NotChecked=0, Total=462 [2022-04-07 13:05:24,780 INFO L913 BasicCegarLoop]: 58 mSDtfsCounter, 73 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 481 mSolverCounterSat, 183 mSolverCounterUnsat, 21 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 53.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 685 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 183 IncrementalHoareTripleChecker+Valid, 481 IncrementalHoareTripleChecker+Invalid, 21 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 53.8s IncrementalHoareTripleChecker+Time [2022-04-07 13:05:24,780 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [82 Valid, 162 Invalid, 685 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [183 Valid, 481 Invalid, 21 Unknown, 0 Unchecked, 53.8s Time] [2022-04-07 13:05:24,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2022-04-07 13:05:24,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 174. [2022-04-07 13:05:24,869 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 13:05:24,869 INFO L82 GeneralOperation]: Start isEquivalent. First operand 181 states. Second operand has 174 states, 95 states have (on average 1.2736842105263158) internal successors, (121), 103 states have internal predecessors, (121), 65 states have call successors, (65), 14 states have call predecessors, (65), 13 states have return successors, (57), 56 states have call predecessors, (57), 57 states have call successors, (57) [2022-04-07 13:05:24,870 INFO L74 IsIncluded]: Start isIncluded. First operand 181 states. Second operand has 174 states, 95 states have (on average 1.2736842105263158) internal successors, (121), 103 states have internal predecessors, (121), 65 states have call successors, (65), 14 states have call predecessors, (65), 13 states have return successors, (57), 56 states have call predecessors, (57), 57 states have call successors, (57) [2022-04-07 13:05:24,870 INFO L87 Difference]: Start difference. First operand 181 states. Second operand has 174 states, 95 states have (on average 1.2736842105263158) internal successors, (121), 103 states have internal predecessors, (121), 65 states have call successors, (65), 14 states have call predecessors, (65), 13 states have return successors, (57), 56 states have call predecessors, (57), 57 states have call successors, (57) [2022-04-07 13:05:24,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:05:24,875 INFO L93 Difference]: Finished difference Result 181 states and 256 transitions. [2022-04-07 13:05:24,875 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 256 transitions. [2022-04-07 13:05:24,876 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:05:24,876 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:05:24,877 INFO L74 IsIncluded]: Start isIncluded. First operand has 174 states, 95 states have (on average 1.2736842105263158) internal successors, (121), 103 states have internal predecessors, (121), 65 states have call successors, (65), 14 states have call predecessors, (65), 13 states have return successors, (57), 56 states have call predecessors, (57), 57 states have call successors, (57) Second operand 181 states. [2022-04-07 13:05:24,877 INFO L87 Difference]: Start difference. First operand has 174 states, 95 states have (on average 1.2736842105263158) internal successors, (121), 103 states have internal predecessors, (121), 65 states have call successors, (65), 14 states have call predecessors, (65), 13 states have return successors, (57), 56 states have call predecessors, (57), 57 states have call successors, (57) Second operand 181 states. [2022-04-07 13:05:24,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:05:24,882 INFO L93 Difference]: Finished difference Result 181 states and 256 transitions. [2022-04-07 13:05:24,882 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 256 transitions. [2022-04-07 13:05:24,883 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:05:24,883 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:05:24,883 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 13:05:24,883 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 13:05:24,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 95 states have (on average 1.2736842105263158) internal successors, (121), 103 states have internal predecessors, (121), 65 states have call successors, (65), 14 states have call predecessors, (65), 13 states have return successors, (57), 56 states have call predecessors, (57), 57 states have call successors, (57) [2022-04-07 13:05:24,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 243 transitions. [2022-04-07 13:05:24,888 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 243 transitions. Word has length 24 [2022-04-07 13:05:24,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 13:05:24,889 INFO L478 AbstractCegarLoop]: Abstraction has 174 states and 243 transitions. [2022-04-07 13:05:24,889 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.4) internal successors, (36), 12 states have internal predecessors, (36), 4 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 13:05:24,889 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 243 transitions. [2022-04-07 13:05:24,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-07 13:05:24,889 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 13:05:24,889 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 13:05:24,907 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-04-07 13:05:25,102 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 13:05:25,103 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 13:05:25,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 13:05:25,103 INFO L85 PathProgramCache]: Analyzing trace with hash -45171523, now seen corresponding path program 1 times [2022-04-07 13:05:25,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 13:05:25,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747651745] [2022-04-07 13:05:25,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 13:05:25,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 13:05:25,113 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 13:05:25,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1101257787] [2022-04-07 13:05:25,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 13:05:25,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 13:05:25,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 13:05:25,127 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-07 13:05:25,132 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-07 13:05:25,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:05:25,231 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-07 13:05:25,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:05:25,243 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 13:05:25,391 INFO L272 TraceCheckUtils]: 0: Hoare triple {3659#true} call ULTIMATE.init(); {3659#true} is VALID [2022-04-07 13:05:25,391 INFO L290 TraceCheckUtils]: 1: Hoare triple {3659#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3659#true} is VALID [2022-04-07 13:05:25,391 INFO L290 TraceCheckUtils]: 2: Hoare triple {3659#true} assume true; {3659#true} is VALID [2022-04-07 13:05:25,391 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3659#true} {3659#true} #102#return; {3659#true} is VALID [2022-04-07 13:05:25,391 INFO L272 TraceCheckUtils]: 4: Hoare triple {3659#true} call #t~ret7 := main(); {3659#true} is VALID [2022-04-07 13:05:25,391 INFO L290 TraceCheckUtils]: 5: Hoare triple {3659#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {3659#true} is VALID [2022-04-07 13:05:25,391 INFO L272 TraceCheckUtils]: 6: Hoare triple {3659#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {3659#true} is VALID [2022-04-07 13:05:25,391 INFO L290 TraceCheckUtils]: 7: Hoare triple {3659#true} ~cond := #in~cond; {3659#true} is VALID [2022-04-07 13:05:25,392 INFO L290 TraceCheckUtils]: 8: Hoare triple {3659#true} assume !(0 == ~cond); {3659#true} is VALID [2022-04-07 13:05:25,392 INFO L290 TraceCheckUtils]: 9: Hoare triple {3659#true} assume true; {3659#true} is VALID [2022-04-07 13:05:25,392 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3659#true} {3659#true} #82#return; {3659#true} is VALID [2022-04-07 13:05:25,392 INFO L290 TraceCheckUtils]: 11: Hoare triple {3659#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {3697#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-07 13:05:25,393 INFO L290 TraceCheckUtils]: 12: Hoare triple {3697#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3697#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-07 13:05:25,393 INFO L290 TraceCheckUtils]: 13: Hoare triple {3697#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} assume !!(#t~post5 < 50);havoc #t~post5; {3697#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-07 13:05:25,393 INFO L290 TraceCheckUtils]: 14: Hoare triple {3697#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {3697#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-07 13:05:25,394 INFO L290 TraceCheckUtils]: 15: Hoare triple {3697#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3697#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-07 13:05:25,394 INFO L290 TraceCheckUtils]: 16: Hoare triple {3697#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} assume !!(#t~post6 < 50);havoc #t~post6; {3697#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-07 13:05:25,394 INFO L272 TraceCheckUtils]: 17: Hoare triple {3697#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {3659#true} is VALID [2022-04-07 13:05:25,395 INFO L290 TraceCheckUtils]: 18: Hoare triple {3659#true} ~cond := #in~cond; {3659#true} is VALID [2022-04-07 13:05:25,395 INFO L290 TraceCheckUtils]: 19: Hoare triple {3659#true} assume !(0 == ~cond); {3659#true} is VALID [2022-04-07 13:05:25,395 INFO L290 TraceCheckUtils]: 20: Hoare triple {3659#true} assume true; {3659#true} is VALID [2022-04-07 13:05:25,396 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3659#true} {3697#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} #84#return; {3697#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-07 13:05:25,396 INFO L272 TraceCheckUtils]: 22: Hoare triple {3697#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} call __VERIFIER_assert((if (~p~0 * ~p~0 + ~r~0 * ~q~0) % 4294967296 == ~n~0 * ~q~0 % 4294967296 then 1 else 0)); {3659#true} is VALID [2022-04-07 13:05:25,396 INFO L290 TraceCheckUtils]: 23: Hoare triple {3659#true} ~cond := #in~cond; {3659#true} is VALID [2022-04-07 13:05:25,396 INFO L290 TraceCheckUtils]: 24: Hoare triple {3659#true} assume !(0 == ~cond); {3659#true} is VALID [2022-04-07 13:05:25,396 INFO L290 TraceCheckUtils]: 25: Hoare triple {3659#true} assume true; {3659#true} is VALID [2022-04-07 13:05:25,397 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {3659#true} {3697#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} #86#return; {3697#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-07 13:05:25,398 INFO L272 TraceCheckUtils]: 27: Hoare triple {3697#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} call __VERIFIER_assert((if 0 == (~h~0 * ~h~0 * ~h~0 - 12 * ~h~0 * ~n~0 * ~q~0 + 16 * ~n~0 * ~p~0 * ~q~0 - ~h~0 * ~q~0 * ~q~0 - 4 * ~p~0 * ~q~0 * ~q~0 + 12 * ~h~0 * ~q~0 * ~r~0 - 16 * ~p~0 * ~q~0 * ~r~0) % 4294967296 then 1 else 0)); {3746#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 13:05:25,398 INFO L290 TraceCheckUtils]: 28: Hoare triple {3746#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3750#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 13:05:25,398 INFO L290 TraceCheckUtils]: 29: Hoare triple {3750#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3660#false} is VALID [2022-04-07 13:05:25,398 INFO L290 TraceCheckUtils]: 30: Hoare triple {3660#false} assume !false; {3660#false} is VALID [2022-04-07 13:05:25,398 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-07 13:05:25,399 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 13:05:25,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 13:05:25,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747651745] [2022-04-07 13:05:25,399 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 13:05:25,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1101257787] [2022-04-07 13:05:25,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1101257787] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 13:05:25,399 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 13:05:25,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 13:05:25,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365858184] [2022-04-07 13:05:25,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 13:05:25,400 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 31 [2022-04-07 13:05:25,400 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 13:05:25,400 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-07 13:05:25,423 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 13:05:25,423 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 13:05:25,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 13:05:25,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 13:05:25,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 13:05:25,424 INFO L87 Difference]: Start difference. First operand 174 states and 243 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-07 13:05:32,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:05:32,738 INFO L93 Difference]: Finished difference Result 180 states and 247 transitions. [2022-04-07 13:05:32,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 13:05:32,739 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 31 [2022-04-07 13:05:32,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 13:05:32,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-07 13:05:32,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 71 transitions. [2022-04-07 13:05:32,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-07 13:05:32,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 71 transitions. [2022-04-07 13:05:32,741 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 71 transitions. [2022-04-07 13:05:32,817 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 13:05:32,819 INFO L225 Difference]: With dead ends: 180 [2022-04-07 13:05:32,820 INFO L226 Difference]: Without dead ends: 152 [2022-04-07 13:05:32,820 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 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-07 13:05:32,820 INFO L913 BasicCegarLoop]: 49 mSDtfsCounter, 6 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-07 13:05:32,820 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 154 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-07 13:05:32,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2022-04-07 13:05:32,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2022-04-07 13:05:32,873 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 13:05:32,874 INFO L82 GeneralOperation]: Start isEquivalent. First operand 152 states. Second operand has 152 states, 83 states have (on average 1.2891566265060241) internal successors, (107), 90 states have internal predecessors, (107), 58 states have call successors, (58), 11 states have call predecessors, (58), 10 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) [2022-04-07 13:05:32,874 INFO L74 IsIncluded]: Start isIncluded. First operand 152 states. Second operand has 152 states, 83 states have (on average 1.2891566265060241) internal successors, (107), 90 states have internal predecessors, (107), 58 states have call successors, (58), 11 states have call predecessors, (58), 10 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) [2022-04-07 13:05:32,875 INFO L87 Difference]: Start difference. First operand 152 states. Second operand has 152 states, 83 states have (on average 1.2891566265060241) internal successors, (107), 90 states have internal predecessors, (107), 58 states have call successors, (58), 11 states have call predecessors, (58), 10 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) [2022-04-07 13:05:32,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:05:32,879 INFO L93 Difference]: Finished difference Result 152 states and 216 transitions. [2022-04-07 13:05:32,879 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 216 transitions. [2022-04-07 13:05:32,879 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:05:32,880 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:05:32,881 INFO L74 IsIncluded]: Start isIncluded. First operand has 152 states, 83 states have (on average 1.2891566265060241) internal successors, (107), 90 states have internal predecessors, (107), 58 states have call successors, (58), 11 states have call predecessors, (58), 10 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) Second operand 152 states. [2022-04-07 13:05:32,881 INFO L87 Difference]: Start difference. First operand has 152 states, 83 states have (on average 1.2891566265060241) internal successors, (107), 90 states have internal predecessors, (107), 58 states have call successors, (58), 11 states have call predecessors, (58), 10 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) Second operand 152 states. [2022-04-07 13:05:32,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:05:32,885 INFO L93 Difference]: Finished difference Result 152 states and 216 transitions. [2022-04-07 13:05:32,885 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 216 transitions. [2022-04-07 13:05:32,886 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:05:32,886 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:05:32,886 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 13:05:32,886 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 13:05:32,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 83 states have (on average 1.2891566265060241) internal successors, (107), 90 states have internal predecessors, (107), 58 states have call successors, (58), 11 states have call predecessors, (58), 10 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) [2022-04-07 13:05:32,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 216 transitions. [2022-04-07 13:05:32,890 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 216 transitions. Word has length 31 [2022-04-07 13:05:32,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 13:05:32,890 INFO L478 AbstractCegarLoop]: Abstraction has 152 states and 216 transitions. [2022-04-07 13:05:32,891 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-07 13:05:32,891 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 216 transitions. [2022-04-07 13:05:32,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-07 13:05:32,891 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 13:05:32,891 INFO L499 BasicCegarLoop]: trace histogram [3, 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, 1, 1] [2022-04-07 13:05:32,909 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-07 13:05:33,096 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 13:05:33,096 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 13:05:33,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 13:05:33,096 INFO L85 PathProgramCache]: Analyzing trace with hash -1547125783, now seen corresponding path program 1 times [2022-04-07 13:05:33,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 13:05:33,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414375628] [2022-04-07 13:05:33,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 13:05:33,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 13:05:33,105 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 13:05:33,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1999804112] [2022-04-07 13:05:33,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 13:05:33,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 13:05:33,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 13:05:33,107 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-07 13:05:33,132 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-07 13:05:33,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:05:33,198 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-07 13:05:33,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:05:33,206 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 13:05:33,327 INFO L272 TraceCheckUtils]: 0: Hoare triple {4555#true} call ULTIMATE.init(); {4555#true} is VALID [2022-04-07 13:05:33,328 INFO L290 TraceCheckUtils]: 1: Hoare triple {4555#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {4555#true} is VALID [2022-04-07 13:05:33,328 INFO L290 TraceCheckUtils]: 2: Hoare triple {4555#true} assume true; {4555#true} is VALID [2022-04-07 13:05:33,328 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4555#true} {4555#true} #102#return; {4555#true} is VALID [2022-04-07 13:05:33,328 INFO L272 TraceCheckUtils]: 4: Hoare triple {4555#true} call #t~ret7 := main(); {4555#true} is VALID [2022-04-07 13:05:33,328 INFO L290 TraceCheckUtils]: 5: Hoare triple {4555#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {4555#true} is VALID [2022-04-07 13:05:33,328 INFO L272 TraceCheckUtils]: 6: Hoare triple {4555#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {4555#true} is VALID [2022-04-07 13:05:33,328 INFO L290 TraceCheckUtils]: 7: Hoare triple {4555#true} ~cond := #in~cond; {4555#true} is VALID [2022-04-07 13:05:33,328 INFO L290 TraceCheckUtils]: 8: Hoare triple {4555#true} assume !(0 == ~cond); {4555#true} is VALID [2022-04-07 13:05:33,328 INFO L290 TraceCheckUtils]: 9: Hoare triple {4555#true} assume true; {4555#true} is VALID [2022-04-07 13:05:33,328 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4555#true} {4555#true} #82#return; {4555#true} is VALID [2022-04-07 13:05:33,329 INFO L290 TraceCheckUtils]: 11: Hoare triple {4555#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {4593#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-07 13:05:33,329 INFO L290 TraceCheckUtils]: 12: Hoare triple {4593#(and (= main_~p~0 0) (= main_~h~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4593#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-07 13:05:33,330 INFO L290 TraceCheckUtils]: 13: Hoare triple {4593#(and (= main_~p~0 0) (= main_~h~0 0))} assume !!(#t~post5 < 50);havoc #t~post5; {4593#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-07 13:05:33,330 INFO L290 TraceCheckUtils]: 14: Hoare triple {4593#(and (= main_~p~0 0) (= main_~h~0 0))} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {4593#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-07 13:05:33,330 INFO L290 TraceCheckUtils]: 15: Hoare triple {4593#(and (= main_~p~0 0) (= main_~h~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4593#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-07 13:05:33,331 INFO L290 TraceCheckUtils]: 16: Hoare triple {4593#(and (= main_~p~0 0) (= main_~h~0 0))} assume !!(#t~post5 < 50);havoc #t~post5; {4593#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-07 13:05:33,331 INFO L290 TraceCheckUtils]: 17: Hoare triple {4593#(and (= main_~p~0 0) (= main_~h~0 0))} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {4593#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-07 13:05:33,331 INFO L290 TraceCheckUtils]: 18: Hoare triple {4593#(and (= main_~p~0 0) (= main_~h~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4593#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-07 13:05:33,332 INFO L290 TraceCheckUtils]: 19: Hoare triple {4593#(and (= main_~p~0 0) (= main_~h~0 0))} assume !!(#t~post6 < 50);havoc #t~post6; {4593#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-07 13:05:33,332 INFO L272 TraceCheckUtils]: 20: Hoare triple {4593#(and (= main_~p~0 0) (= main_~h~0 0))} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {4555#true} is VALID [2022-04-07 13:05:33,332 INFO L290 TraceCheckUtils]: 21: Hoare triple {4555#true} ~cond := #in~cond; {4555#true} is VALID [2022-04-07 13:05:33,332 INFO L290 TraceCheckUtils]: 22: Hoare triple {4555#true} assume !(0 == ~cond); {4555#true} is VALID [2022-04-07 13:05:33,332 INFO L290 TraceCheckUtils]: 23: Hoare triple {4555#true} assume true; {4555#true} is VALID [2022-04-07 13:05:33,333 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {4555#true} {4593#(and (= main_~p~0 0) (= main_~h~0 0))} #84#return; {4593#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-07 13:05:33,333 INFO L272 TraceCheckUtils]: 25: Hoare triple {4593#(and (= main_~p~0 0) (= main_~h~0 0))} call __VERIFIER_assert((if (~p~0 * ~p~0 + ~r~0 * ~q~0) % 4294967296 == ~n~0 * ~q~0 % 4294967296 then 1 else 0)); {4555#true} is VALID [2022-04-07 13:05:33,333 INFO L290 TraceCheckUtils]: 26: Hoare triple {4555#true} ~cond := #in~cond; {4555#true} is VALID [2022-04-07 13:05:33,333 INFO L290 TraceCheckUtils]: 27: Hoare triple {4555#true} assume !(0 == ~cond); {4555#true} is VALID [2022-04-07 13:05:33,333 INFO L290 TraceCheckUtils]: 28: Hoare triple {4555#true} assume true; {4555#true} is VALID [2022-04-07 13:05:33,334 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {4555#true} {4593#(and (= main_~p~0 0) (= main_~h~0 0))} #86#return; {4593#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-07 13:05:33,353 INFO L272 TraceCheckUtils]: 30: Hoare triple {4593#(and (= main_~p~0 0) (= main_~h~0 0))} call __VERIFIER_assert((if 0 == (~h~0 * ~h~0 * ~h~0 - 12 * ~h~0 * ~n~0 * ~q~0 + 16 * ~n~0 * ~p~0 * ~q~0 - ~h~0 * ~q~0 * ~q~0 - 4 * ~p~0 * ~q~0 * ~q~0 + 12 * ~h~0 * ~q~0 * ~r~0 - 16 * ~p~0 * ~q~0 * ~r~0) % 4294967296 then 1 else 0)); {4651#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 13:05:33,354 INFO L290 TraceCheckUtils]: 31: Hoare triple {4651#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4655#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 13:05:33,354 INFO L290 TraceCheckUtils]: 32: Hoare triple {4655#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4556#false} is VALID [2022-04-07 13:05:33,354 INFO L290 TraceCheckUtils]: 33: Hoare triple {4556#false} assume !false; {4556#false} is VALID [2022-04-07 13:05:33,355 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-07 13:05:33,355 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 13:05:33,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 13:05:33,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414375628] [2022-04-07 13:05:33,355 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 13:05:33,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1999804112] [2022-04-07 13:05:33,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1999804112] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 13:05:33,355 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 13:05:33,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 13:05:33,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626082198] [2022-04-07 13:05:33,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 13:05:33,356 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 34 [2022-04-07 13:05:33,356 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 13:05:33,356 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-07 13:05:33,379 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 13:05:33,379 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 13:05:33,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 13:05:33,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 13:05:33,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 13:05:33,380 INFO L87 Difference]: Start difference. First operand 152 states and 216 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-07 13:05:39,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:05:39,184 INFO L93 Difference]: Finished difference Result 182 states and 241 transitions. [2022-04-07 13:05:39,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 13:05:39,184 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 34 [2022-04-07 13:05:39,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 13:05:39,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-07 13:05:39,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 69 transitions. [2022-04-07 13:05:39,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-07 13:05:39,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 69 transitions. [2022-04-07 13:05:39,187 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 69 transitions. [2022-04-07 13:05:39,258 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 13:05:39,261 INFO L225 Difference]: With dead ends: 182 [2022-04-07 13:05:39,261 INFO L226 Difference]: Without dead ends: 177 [2022-04-07 13:05:39,262 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 30 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-07 13:05:39,262 INFO L913 BasicCegarLoop]: 50 mSDtfsCounter, 8 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-07 13:05:39,262 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 156 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-07 13:05:39,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2022-04-07 13:05:39,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 170. [2022-04-07 13:05:39,323 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 13:05:39,324 INFO L82 GeneralOperation]: Start isEquivalent. First operand 177 states. Second operand has 170 states, 97 states have (on average 1.1649484536082475) internal successors, (113), 101 states have internal predecessors, (113), 55 states have call successors, (55), 18 states have call predecessors, (55), 17 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) [2022-04-07 13:05:39,324 INFO L74 IsIncluded]: Start isIncluded. First operand 177 states. Second operand has 170 states, 97 states have (on average 1.1649484536082475) internal successors, (113), 101 states have internal predecessors, (113), 55 states have call successors, (55), 18 states have call predecessors, (55), 17 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) [2022-04-07 13:05:39,324 INFO L87 Difference]: Start difference. First operand 177 states. Second operand has 170 states, 97 states have (on average 1.1649484536082475) internal successors, (113), 101 states have internal predecessors, (113), 55 states have call successors, (55), 18 states have call predecessors, (55), 17 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) [2022-04-07 13:05:39,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:05:39,332 INFO L93 Difference]: Finished difference Result 177 states and 228 transitions. [2022-04-07 13:05:39,332 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 228 transitions. [2022-04-07 13:05:39,333 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:05:39,333 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:05:39,333 INFO L74 IsIncluded]: Start isIncluded. First operand has 170 states, 97 states have (on average 1.1649484536082475) internal successors, (113), 101 states have internal predecessors, (113), 55 states have call successors, (55), 18 states have call predecessors, (55), 17 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) Second operand 177 states. [2022-04-07 13:05:39,334 INFO L87 Difference]: Start difference. First operand has 170 states, 97 states have (on average 1.1649484536082475) internal successors, (113), 101 states have internal predecessors, (113), 55 states have call successors, (55), 18 states have call predecessors, (55), 17 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) Second operand 177 states. [2022-04-07 13:05:39,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:05:39,337 INFO L93 Difference]: Finished difference Result 177 states and 228 transitions. [2022-04-07 13:05:39,337 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 228 transitions. [2022-04-07 13:05:39,338 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:05:39,338 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:05:39,338 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 13:05:39,338 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 13:05:39,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 97 states have (on average 1.1649484536082475) internal successors, (113), 101 states have internal predecessors, (113), 55 states have call successors, (55), 18 states have call predecessors, (55), 17 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) [2022-04-07 13:05:39,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 219 transitions. [2022-04-07 13:05:39,341 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 219 transitions. Word has length 34 [2022-04-07 13:05:39,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 13:05:39,342 INFO L478 AbstractCegarLoop]: Abstraction has 170 states and 219 transitions. [2022-04-07 13:05:39,342 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-07 13:05:39,342 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 219 transitions. [2022-04-07 13:05:39,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-07 13:05:39,342 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 13:05:39,342 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 13:05:39,361 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-07 13:05:39,547 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 13:05:39,547 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 13:05:39,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 13:05:39,548 INFO L85 PathProgramCache]: Analyzing trace with hash 821435566, now seen corresponding path program 1 times [2022-04-07 13:05:39,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 13:05:39,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939676591] [2022-04-07 13:05:39,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 13:05:39,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 13:05:39,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:05:39,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 13:05:39,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:05:39,667 INFO L290 TraceCheckUtils]: 0: Hoare triple {5544#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {5534#(<= ~counter~0 0)} is VALID [2022-04-07 13:05:39,667 INFO L290 TraceCheckUtils]: 1: Hoare triple {5534#(<= ~counter~0 0)} assume true; {5534#(<= ~counter~0 0)} is VALID [2022-04-07 13:05:39,668 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5534#(<= ~counter~0 0)} {5529#true} #102#return; {5534#(<= ~counter~0 0)} is VALID [2022-04-07 13:05:39,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-07 13:05:39,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:05:39,673 INFO L290 TraceCheckUtils]: 0: Hoare triple {5529#true} ~cond := #in~cond; {5529#true} is VALID [2022-04-07 13:05:39,673 INFO L290 TraceCheckUtils]: 1: Hoare triple {5529#true} assume !(0 == ~cond); {5529#true} is VALID [2022-04-07 13:05:39,673 INFO L290 TraceCheckUtils]: 2: Hoare triple {5529#true} assume true; {5529#true} is VALID [2022-04-07 13:05:39,674 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5529#true} {5534#(<= ~counter~0 0)} #82#return; {5534#(<= ~counter~0 0)} is VALID [2022-04-07 13:05:39,674 INFO L272 TraceCheckUtils]: 0: Hoare triple {5529#true} call ULTIMATE.init(); {5544#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 13:05:39,675 INFO L290 TraceCheckUtils]: 1: Hoare triple {5544#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {5534#(<= ~counter~0 0)} is VALID [2022-04-07 13:05:39,675 INFO L290 TraceCheckUtils]: 2: Hoare triple {5534#(<= ~counter~0 0)} assume true; {5534#(<= ~counter~0 0)} is VALID [2022-04-07 13:05:39,676 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5534#(<= ~counter~0 0)} {5529#true} #102#return; {5534#(<= ~counter~0 0)} is VALID [2022-04-07 13:05:39,676 INFO L272 TraceCheckUtils]: 4: Hoare triple {5534#(<= ~counter~0 0)} call #t~ret7 := main(); {5534#(<= ~counter~0 0)} is VALID [2022-04-07 13:05:39,676 INFO L290 TraceCheckUtils]: 5: Hoare triple {5534#(<= ~counter~0 0)} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {5534#(<= ~counter~0 0)} is VALID [2022-04-07 13:05:39,676 INFO L272 TraceCheckUtils]: 6: Hoare triple {5534#(<= ~counter~0 0)} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {5529#true} is VALID [2022-04-07 13:05:39,676 INFO L290 TraceCheckUtils]: 7: Hoare triple {5529#true} ~cond := #in~cond; {5529#true} is VALID [2022-04-07 13:05:39,677 INFO L290 TraceCheckUtils]: 8: Hoare triple {5529#true} assume !(0 == ~cond); {5529#true} is VALID [2022-04-07 13:05:39,677 INFO L290 TraceCheckUtils]: 9: Hoare triple {5529#true} assume true; {5529#true} is VALID [2022-04-07 13:05:39,677 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5529#true} {5534#(<= ~counter~0 0)} #82#return; {5534#(<= ~counter~0 0)} is VALID [2022-04-07 13:05:39,677 INFO L290 TraceCheckUtils]: 11: Hoare triple {5534#(<= ~counter~0 0)} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {5534#(<= ~counter~0 0)} is VALID [2022-04-07 13:05:39,678 INFO L290 TraceCheckUtils]: 12: Hoare triple {5534#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5539#(<= ~counter~0 1)} is VALID [2022-04-07 13:05:39,678 INFO L290 TraceCheckUtils]: 13: Hoare triple {5539#(<= ~counter~0 1)} assume !!(#t~post5 < 50);havoc #t~post5; {5539#(<= ~counter~0 1)} is VALID [2022-04-07 13:05:39,679 INFO L290 TraceCheckUtils]: 14: Hoare triple {5539#(<= ~counter~0 1)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {5539#(<= ~counter~0 1)} is VALID [2022-04-07 13:05:39,680 INFO L290 TraceCheckUtils]: 15: Hoare triple {5539#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5540#(<= ~counter~0 2)} is VALID [2022-04-07 13:05:39,680 INFO L290 TraceCheckUtils]: 16: Hoare triple {5540#(<= ~counter~0 2)} assume !!(#t~post5 < 50);havoc #t~post5; {5540#(<= ~counter~0 2)} is VALID [2022-04-07 13:05:39,680 INFO L290 TraceCheckUtils]: 17: Hoare triple {5540#(<= ~counter~0 2)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {5540#(<= ~counter~0 2)} is VALID [2022-04-07 13:05:39,681 INFO L290 TraceCheckUtils]: 18: Hoare triple {5540#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5541#(<= ~counter~0 3)} is VALID [2022-04-07 13:05:39,681 INFO L290 TraceCheckUtils]: 19: Hoare triple {5541#(<= ~counter~0 3)} assume !!(#t~post5 < 50);havoc #t~post5; {5541#(<= ~counter~0 3)} is VALID [2022-04-07 13:05:39,681 INFO L290 TraceCheckUtils]: 20: Hoare triple {5541#(<= ~counter~0 3)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {5541#(<= ~counter~0 3)} is VALID [2022-04-07 13:05:39,682 INFO L290 TraceCheckUtils]: 21: Hoare triple {5541#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5542#(<= ~counter~0 4)} is VALID [2022-04-07 13:05:39,682 INFO L290 TraceCheckUtils]: 22: Hoare triple {5542#(<= ~counter~0 4)} assume !!(#t~post5 < 50);havoc #t~post5; {5542#(<= ~counter~0 4)} is VALID [2022-04-07 13:05:39,683 INFO L290 TraceCheckUtils]: 23: Hoare triple {5542#(<= ~counter~0 4)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {5542#(<= ~counter~0 4)} is VALID [2022-04-07 13:05:39,683 INFO L290 TraceCheckUtils]: 24: Hoare triple {5542#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5543#(<= |main_#t~post5| 4)} is VALID [2022-04-07 13:05:39,683 INFO L290 TraceCheckUtils]: 25: Hoare triple {5543#(<= |main_#t~post5| 4)} assume !(#t~post5 < 50);havoc #t~post5; {5530#false} is VALID [2022-04-07 13:05:39,683 INFO L290 TraceCheckUtils]: 26: Hoare triple {5530#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5530#false} is VALID [2022-04-07 13:05:39,684 INFO L290 TraceCheckUtils]: 27: Hoare triple {5530#false} assume !!(#t~post6 < 50);havoc #t~post6; {5530#false} is VALID [2022-04-07 13:05:39,684 INFO L272 TraceCheckUtils]: 28: Hoare triple {5530#false} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {5530#false} is VALID [2022-04-07 13:05:39,684 INFO L290 TraceCheckUtils]: 29: Hoare triple {5530#false} ~cond := #in~cond; {5530#false} is VALID [2022-04-07 13:05:39,684 INFO L290 TraceCheckUtils]: 30: Hoare triple {5530#false} assume 0 == ~cond; {5530#false} is VALID [2022-04-07 13:05:39,684 INFO L290 TraceCheckUtils]: 31: Hoare triple {5530#false} assume !false; {5530#false} is VALID [2022-04-07 13:05:39,684 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 13:05:39,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 13:05:39,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939676591] [2022-04-07 13:05:39,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939676591] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 13:05:39,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1839094537] [2022-04-07 13:05:39,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 13:05:39,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 13:05:39,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 13:05:39,685 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 13:05:39,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-07 13:05:39,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:05:39,721 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-07 13:05:39,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:05:39,735 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 13:05:39,949 INFO L272 TraceCheckUtils]: 0: Hoare triple {5529#true} call ULTIMATE.init(); {5529#true} is VALID [2022-04-07 13:05:39,950 INFO L290 TraceCheckUtils]: 1: Hoare triple {5529#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {5534#(<= ~counter~0 0)} is VALID [2022-04-07 13:05:39,950 INFO L290 TraceCheckUtils]: 2: Hoare triple {5534#(<= ~counter~0 0)} assume true; {5534#(<= ~counter~0 0)} is VALID [2022-04-07 13:05:39,951 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5534#(<= ~counter~0 0)} {5529#true} #102#return; {5534#(<= ~counter~0 0)} is VALID [2022-04-07 13:05:39,951 INFO L272 TraceCheckUtils]: 4: Hoare triple {5534#(<= ~counter~0 0)} call #t~ret7 := main(); {5534#(<= ~counter~0 0)} is VALID [2022-04-07 13:05:39,951 INFO L290 TraceCheckUtils]: 5: Hoare triple {5534#(<= ~counter~0 0)} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {5534#(<= ~counter~0 0)} is VALID [2022-04-07 13:05:39,954 INFO L272 TraceCheckUtils]: 6: Hoare triple {5534#(<= ~counter~0 0)} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {5534#(<= ~counter~0 0)} is VALID [2022-04-07 13:05:39,955 INFO L290 TraceCheckUtils]: 7: Hoare triple {5534#(<= ~counter~0 0)} ~cond := #in~cond; {5534#(<= ~counter~0 0)} is VALID [2022-04-07 13:05:39,960 INFO L290 TraceCheckUtils]: 8: Hoare triple {5534#(<= ~counter~0 0)} assume !(0 == ~cond); {5534#(<= ~counter~0 0)} is VALID [2022-04-07 13:05:39,961 INFO L290 TraceCheckUtils]: 9: Hoare triple {5534#(<= ~counter~0 0)} assume true; {5534#(<= ~counter~0 0)} is VALID [2022-04-07 13:05:39,962 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5534#(<= ~counter~0 0)} {5534#(<= ~counter~0 0)} #82#return; {5534#(<= ~counter~0 0)} is VALID [2022-04-07 13:05:39,962 INFO L290 TraceCheckUtils]: 11: Hoare triple {5534#(<= ~counter~0 0)} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {5534#(<= ~counter~0 0)} is VALID [2022-04-07 13:05:39,963 INFO L290 TraceCheckUtils]: 12: Hoare triple {5534#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5539#(<= ~counter~0 1)} is VALID [2022-04-07 13:05:39,963 INFO L290 TraceCheckUtils]: 13: Hoare triple {5539#(<= ~counter~0 1)} assume !!(#t~post5 < 50);havoc #t~post5; {5539#(<= ~counter~0 1)} is VALID [2022-04-07 13:05:39,963 INFO L290 TraceCheckUtils]: 14: Hoare triple {5539#(<= ~counter~0 1)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {5539#(<= ~counter~0 1)} is VALID [2022-04-07 13:05:39,964 INFO L290 TraceCheckUtils]: 15: Hoare triple {5539#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5540#(<= ~counter~0 2)} is VALID [2022-04-07 13:05:39,964 INFO L290 TraceCheckUtils]: 16: Hoare triple {5540#(<= ~counter~0 2)} assume !!(#t~post5 < 50);havoc #t~post5; {5540#(<= ~counter~0 2)} is VALID [2022-04-07 13:05:39,965 INFO L290 TraceCheckUtils]: 17: Hoare triple {5540#(<= ~counter~0 2)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {5540#(<= ~counter~0 2)} is VALID [2022-04-07 13:05:39,965 INFO L290 TraceCheckUtils]: 18: Hoare triple {5540#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5541#(<= ~counter~0 3)} is VALID [2022-04-07 13:05:39,965 INFO L290 TraceCheckUtils]: 19: Hoare triple {5541#(<= ~counter~0 3)} assume !!(#t~post5 < 50);havoc #t~post5; {5541#(<= ~counter~0 3)} is VALID [2022-04-07 13:05:39,966 INFO L290 TraceCheckUtils]: 20: Hoare triple {5541#(<= ~counter~0 3)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {5541#(<= ~counter~0 3)} is VALID [2022-04-07 13:05:39,966 INFO L290 TraceCheckUtils]: 21: Hoare triple {5541#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5542#(<= ~counter~0 4)} is VALID [2022-04-07 13:05:39,967 INFO L290 TraceCheckUtils]: 22: Hoare triple {5542#(<= ~counter~0 4)} assume !!(#t~post5 < 50);havoc #t~post5; {5542#(<= ~counter~0 4)} is VALID [2022-04-07 13:05:39,967 INFO L290 TraceCheckUtils]: 23: Hoare triple {5542#(<= ~counter~0 4)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {5542#(<= ~counter~0 4)} is VALID [2022-04-07 13:05:39,967 INFO L290 TraceCheckUtils]: 24: Hoare triple {5542#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5543#(<= |main_#t~post5| 4)} is VALID [2022-04-07 13:05:39,968 INFO L290 TraceCheckUtils]: 25: Hoare triple {5543#(<= |main_#t~post5| 4)} assume !(#t~post5 < 50);havoc #t~post5; {5530#false} is VALID [2022-04-07 13:05:39,968 INFO L290 TraceCheckUtils]: 26: Hoare triple {5530#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5530#false} is VALID [2022-04-07 13:05:39,968 INFO L290 TraceCheckUtils]: 27: Hoare triple {5530#false} assume !!(#t~post6 < 50);havoc #t~post6; {5530#false} is VALID [2022-04-07 13:05:39,968 INFO L272 TraceCheckUtils]: 28: Hoare triple {5530#false} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {5530#false} is VALID [2022-04-07 13:05:39,968 INFO L290 TraceCheckUtils]: 29: Hoare triple {5530#false} ~cond := #in~cond; {5530#false} is VALID [2022-04-07 13:05:39,968 INFO L290 TraceCheckUtils]: 30: Hoare triple {5530#false} assume 0 == ~cond; {5530#false} is VALID [2022-04-07 13:05:39,968 INFO L290 TraceCheckUtils]: 31: Hoare triple {5530#false} assume !false; {5530#false} is VALID [2022-04-07 13:05:39,968 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 13:05:39,968 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 13:05:40,220 INFO L290 TraceCheckUtils]: 31: Hoare triple {5530#false} assume !false; {5530#false} is VALID [2022-04-07 13:05:40,220 INFO L290 TraceCheckUtils]: 30: Hoare triple {5530#false} assume 0 == ~cond; {5530#false} is VALID [2022-04-07 13:05:40,220 INFO L290 TraceCheckUtils]: 29: Hoare triple {5530#false} ~cond := #in~cond; {5530#false} is VALID [2022-04-07 13:05:40,220 INFO L272 TraceCheckUtils]: 28: Hoare triple {5530#false} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {5530#false} is VALID [2022-04-07 13:05:40,220 INFO L290 TraceCheckUtils]: 27: Hoare triple {5530#false} assume !!(#t~post6 < 50);havoc #t~post6; {5530#false} is VALID [2022-04-07 13:05:40,220 INFO L290 TraceCheckUtils]: 26: Hoare triple {5530#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5530#false} is VALID [2022-04-07 13:05:40,221 INFO L290 TraceCheckUtils]: 25: Hoare triple {5659#(< |main_#t~post5| 50)} assume !(#t~post5 < 50);havoc #t~post5; {5530#false} is VALID [2022-04-07 13:05:40,221 INFO L290 TraceCheckUtils]: 24: Hoare triple {5663#(< ~counter~0 50)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5659#(< |main_#t~post5| 50)} is VALID [2022-04-07 13:05:40,221 INFO L290 TraceCheckUtils]: 23: Hoare triple {5663#(< ~counter~0 50)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {5663#(< ~counter~0 50)} is VALID [2022-04-07 13:05:40,221 INFO L290 TraceCheckUtils]: 22: Hoare triple {5663#(< ~counter~0 50)} assume !!(#t~post5 < 50);havoc #t~post5; {5663#(< ~counter~0 50)} is VALID [2022-04-07 13:05:40,222 INFO L290 TraceCheckUtils]: 21: Hoare triple {5673#(< ~counter~0 49)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5663#(< ~counter~0 50)} is VALID [2022-04-07 13:05:40,222 INFO L290 TraceCheckUtils]: 20: Hoare triple {5673#(< ~counter~0 49)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {5673#(< ~counter~0 49)} is VALID [2022-04-07 13:05:40,223 INFO L290 TraceCheckUtils]: 19: Hoare triple {5673#(< ~counter~0 49)} assume !!(#t~post5 < 50);havoc #t~post5; {5673#(< ~counter~0 49)} is VALID [2022-04-07 13:05:40,223 INFO L290 TraceCheckUtils]: 18: Hoare triple {5683#(< ~counter~0 48)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5673#(< ~counter~0 49)} is VALID [2022-04-07 13:05:40,223 INFO L290 TraceCheckUtils]: 17: Hoare triple {5683#(< ~counter~0 48)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {5683#(< ~counter~0 48)} is VALID [2022-04-07 13:05:40,224 INFO L290 TraceCheckUtils]: 16: Hoare triple {5683#(< ~counter~0 48)} assume !!(#t~post5 < 50);havoc #t~post5; {5683#(< ~counter~0 48)} is VALID [2022-04-07 13:05:40,224 INFO L290 TraceCheckUtils]: 15: Hoare triple {5693#(< ~counter~0 47)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5683#(< ~counter~0 48)} is VALID [2022-04-07 13:05:40,225 INFO L290 TraceCheckUtils]: 14: Hoare triple {5693#(< ~counter~0 47)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {5693#(< ~counter~0 47)} is VALID [2022-04-07 13:05:40,225 INFO L290 TraceCheckUtils]: 13: Hoare triple {5693#(< ~counter~0 47)} assume !!(#t~post5 < 50);havoc #t~post5; {5693#(< ~counter~0 47)} is VALID [2022-04-07 13:05:40,225 INFO L290 TraceCheckUtils]: 12: Hoare triple {5703#(< ~counter~0 46)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5693#(< ~counter~0 47)} is VALID [2022-04-07 13:05:40,226 INFO L290 TraceCheckUtils]: 11: Hoare triple {5703#(< ~counter~0 46)} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {5703#(< ~counter~0 46)} is VALID [2022-04-07 13:05:40,226 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5529#true} {5703#(< ~counter~0 46)} #82#return; {5703#(< ~counter~0 46)} is VALID [2022-04-07 13:05:40,226 INFO L290 TraceCheckUtils]: 9: Hoare triple {5529#true} assume true; {5529#true} is VALID [2022-04-07 13:05:40,226 INFO L290 TraceCheckUtils]: 8: Hoare triple {5529#true} assume !(0 == ~cond); {5529#true} is VALID [2022-04-07 13:05:40,226 INFO L290 TraceCheckUtils]: 7: Hoare triple {5529#true} ~cond := #in~cond; {5529#true} is VALID [2022-04-07 13:05:40,226 INFO L272 TraceCheckUtils]: 6: Hoare triple {5703#(< ~counter~0 46)} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {5529#true} is VALID [2022-04-07 13:05:40,227 INFO L290 TraceCheckUtils]: 5: Hoare triple {5703#(< ~counter~0 46)} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {5703#(< ~counter~0 46)} is VALID [2022-04-07 13:05:40,227 INFO L272 TraceCheckUtils]: 4: Hoare triple {5703#(< ~counter~0 46)} call #t~ret7 := main(); {5703#(< ~counter~0 46)} is VALID [2022-04-07 13:05:40,227 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5703#(< ~counter~0 46)} {5529#true} #102#return; {5703#(< ~counter~0 46)} is VALID [2022-04-07 13:05:40,228 INFO L290 TraceCheckUtils]: 2: Hoare triple {5703#(< ~counter~0 46)} assume true; {5703#(< ~counter~0 46)} is VALID [2022-04-07 13:05:40,228 INFO L290 TraceCheckUtils]: 1: Hoare triple {5529#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {5703#(< ~counter~0 46)} is VALID [2022-04-07 13:05:40,228 INFO L272 TraceCheckUtils]: 0: Hoare triple {5529#true} call ULTIMATE.init(); {5529#true} is VALID [2022-04-07 13:05:40,228 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 13:05:40,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1839094537] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 13:05:40,229 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 13:05:40,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 15 [2022-04-07 13:05:40,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342439147] [2022-04-07 13:05:40,229 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 13:05:40,229 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.2) internal successors, (48), 14 states have internal predecessors, (48), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 32 [2022-04-07 13:05:40,230 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 13:05:40,230 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 3.2) internal successors, (48), 14 states have internal predecessors, (48), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-07 13:05:40,272 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 13:05:40,272 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-07 13:05:40,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 13:05:40,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-07 13:05:40,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2022-04-07 13:05:40,273 INFO L87 Difference]: Start difference. First operand 170 states and 219 transitions. Second operand has 15 states, 15 states have (on average 3.2) internal successors, (48), 14 states have internal predecessors, (48), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-07 13:05:46,194 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 13:05:48,558 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 13:05:50,595 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 13:05:52,891 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 13:05:54,927 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 13:05:59,184 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 13:06:01,188 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 13:06:09,396 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 6.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 13:06:14,686 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.29s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 13:06:18,822 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 13:06:23,087 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 13:06:25,090 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 13:06:27,895 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 13:06:34,523 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 13:06:39,228 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 13:06:42,053 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 13:06:44,134 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 13:06:46,794 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 13:06:49,076 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 13:06:51,223 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 13:07:00,202 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 13:07:02,204 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 13:07:05,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:07:05,345 INFO L93 Difference]: Finished difference Result 352 states and 455 transitions. [2022-04-07 13:07:05,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-07 13:07:05,346 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.2) internal successors, (48), 14 states have internal predecessors, (48), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 32 [2022-04-07 13:07:05,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 13:07:05,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 3.2) internal successors, (48), 14 states have internal predecessors, (48), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-07 13:07:05,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 254 transitions. [2022-04-07 13:07:05,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 3.2) internal successors, (48), 14 states have internal predecessors, (48), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-07 13:07:05,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 254 transitions. [2022-04-07 13:07:05,351 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 254 transitions. [2022-04-07 13:07:05,621 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 254 edges. 254 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 13:07:05,628 INFO L225 Difference]: With dead ends: 352 [2022-04-07 13:07:05,628 INFO L226 Difference]: Without dead ends: 312 [2022-04-07 13:07:05,629 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=276, Invalid=716, Unknown=0, NotChecked=0, Total=992 [2022-04-07 13:07:05,633 INFO L913 BasicCegarLoop]: 56 mSDtfsCounter, 198 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 454 mSolverCounterSat, 130 mSolverCounterUnsat, 19 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 71.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 454 IncrementalHoareTripleChecker+Invalid, 19 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 71.0s IncrementalHoareTripleChecker+Time [2022-04-07 13:07:05,634 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [234 Valid, 231 Invalid, 603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 454 Invalid, 19 Unknown, 0 Unchecked, 71.0s Time] [2022-04-07 13:07:05,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2022-04-07 13:07:05,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 268. [2022-04-07 13:07:05,748 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 13:07:05,749 INFO L82 GeneralOperation]: Start isEquivalent. First operand 312 states. Second operand has 268 states, 156 states have (on average 1.185897435897436) internal successors, (185), 165 states have internal predecessors, (185), 85 states have call successors, (85), 27 states have call predecessors, (85), 26 states have return successors, (79), 75 states have call predecessors, (79), 79 states have call successors, (79) [2022-04-07 13:07:05,749 INFO L74 IsIncluded]: Start isIncluded. First operand 312 states. Second operand has 268 states, 156 states have (on average 1.185897435897436) internal successors, (185), 165 states have internal predecessors, (185), 85 states have call successors, (85), 27 states have call predecessors, (85), 26 states have return successors, (79), 75 states have call predecessors, (79), 79 states have call successors, (79) [2022-04-07 13:07:05,751 INFO L87 Difference]: Start difference. First operand 312 states. Second operand has 268 states, 156 states have (on average 1.185897435897436) internal successors, (185), 165 states have internal predecessors, (185), 85 states have call successors, (85), 27 states have call predecessors, (85), 26 states have return successors, (79), 75 states have call predecessors, (79), 79 states have call successors, (79) [2022-04-07 13:07:05,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:07:05,758 INFO L93 Difference]: Finished difference Result 312 states and 396 transitions. [2022-04-07 13:07:05,758 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 396 transitions. [2022-04-07 13:07:05,759 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:07:05,759 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:07:05,759 INFO L74 IsIncluded]: Start isIncluded. First operand has 268 states, 156 states have (on average 1.185897435897436) internal successors, (185), 165 states have internal predecessors, (185), 85 states have call successors, (85), 27 states have call predecessors, (85), 26 states have return successors, (79), 75 states have call predecessors, (79), 79 states have call successors, (79) Second operand 312 states. [2022-04-07 13:07:05,760 INFO L87 Difference]: Start difference. First operand has 268 states, 156 states have (on average 1.185897435897436) internal successors, (185), 165 states have internal predecessors, (185), 85 states have call successors, (85), 27 states have call predecessors, (85), 26 states have return successors, (79), 75 states have call predecessors, (79), 79 states have call successors, (79) Second operand 312 states. [2022-04-07 13:07:05,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:07:05,767 INFO L93 Difference]: Finished difference Result 312 states and 396 transitions. [2022-04-07 13:07:05,767 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 396 transitions. [2022-04-07 13:07:05,768 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:07:05,768 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:07:05,768 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 13:07:05,768 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 13:07:05,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 156 states have (on average 1.185897435897436) internal successors, (185), 165 states have internal predecessors, (185), 85 states have call successors, (85), 27 states have call predecessors, (85), 26 states have return successors, (79), 75 states have call predecessors, (79), 79 states have call successors, (79) [2022-04-07 13:07:05,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 349 transitions. [2022-04-07 13:07:05,781 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 349 transitions. Word has length 32 [2022-04-07 13:07:05,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 13:07:05,781 INFO L478 AbstractCegarLoop]: Abstraction has 268 states and 349 transitions. [2022-04-07 13:07:05,781 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.2) internal successors, (48), 14 states have internal predecessors, (48), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-07 13:07:05,781 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 349 transitions. [2022-04-07 13:07:05,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-07 13:07:05,782 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 13:07:05,782 INFO L499 BasicCegarLoop]: trace histogram [11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 13:07:05,800 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-07 13:07:05,987 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-07 13:07:05,988 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 13:07:05,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 13:07:05,988 INFO L85 PathProgramCache]: Analyzing trace with hash -271152338, now seen corresponding path program 2 times [2022-04-07 13:07:05,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 13:07:05,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812603394] [2022-04-07 13:07:05,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 13:07:05,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 13:07:06,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:07:06,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 13:07:06,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:07:06,178 INFO L290 TraceCheckUtils]: 0: Hoare triple {7322#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {7306#(<= ~counter~0 0)} is VALID [2022-04-07 13:07:06,178 INFO L290 TraceCheckUtils]: 1: Hoare triple {7306#(<= ~counter~0 0)} assume true; {7306#(<= ~counter~0 0)} is VALID [2022-04-07 13:07:06,178 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7306#(<= ~counter~0 0)} {7301#true} #102#return; {7306#(<= ~counter~0 0)} is VALID [2022-04-07 13:07:06,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-07 13:07:06,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:07:06,184 INFO L290 TraceCheckUtils]: 0: Hoare triple {7301#true} ~cond := #in~cond; {7301#true} is VALID [2022-04-07 13:07:06,184 INFO L290 TraceCheckUtils]: 1: Hoare triple {7301#true} assume !(0 == ~cond); {7301#true} is VALID [2022-04-07 13:07:06,184 INFO L290 TraceCheckUtils]: 2: Hoare triple {7301#true} assume true; {7301#true} is VALID [2022-04-07 13:07:06,184 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7301#true} {7306#(<= ~counter~0 0)} #82#return; {7306#(<= ~counter~0 0)} is VALID [2022-04-07 13:07:06,185 INFO L272 TraceCheckUtils]: 0: Hoare triple {7301#true} call ULTIMATE.init(); {7322#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 13:07:06,185 INFO L290 TraceCheckUtils]: 1: Hoare triple {7322#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {7306#(<= ~counter~0 0)} is VALID [2022-04-07 13:07:06,186 INFO L290 TraceCheckUtils]: 2: Hoare triple {7306#(<= ~counter~0 0)} assume true; {7306#(<= ~counter~0 0)} is VALID [2022-04-07 13:07:06,186 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7306#(<= ~counter~0 0)} {7301#true} #102#return; {7306#(<= ~counter~0 0)} is VALID [2022-04-07 13:07:06,186 INFO L272 TraceCheckUtils]: 4: Hoare triple {7306#(<= ~counter~0 0)} call #t~ret7 := main(); {7306#(<= ~counter~0 0)} is VALID [2022-04-07 13:07:06,187 INFO L290 TraceCheckUtils]: 5: Hoare triple {7306#(<= ~counter~0 0)} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {7306#(<= ~counter~0 0)} is VALID [2022-04-07 13:07:06,187 INFO L272 TraceCheckUtils]: 6: Hoare triple {7306#(<= ~counter~0 0)} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {7301#true} is VALID [2022-04-07 13:07:06,187 INFO L290 TraceCheckUtils]: 7: Hoare triple {7301#true} ~cond := #in~cond; {7301#true} is VALID [2022-04-07 13:07:06,187 INFO L290 TraceCheckUtils]: 8: Hoare triple {7301#true} assume !(0 == ~cond); {7301#true} is VALID [2022-04-07 13:07:06,187 INFO L290 TraceCheckUtils]: 9: Hoare triple {7301#true} assume true; {7301#true} is VALID [2022-04-07 13:07:06,187 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7301#true} {7306#(<= ~counter~0 0)} #82#return; {7306#(<= ~counter~0 0)} is VALID [2022-04-07 13:07:06,188 INFO L290 TraceCheckUtils]: 11: Hoare triple {7306#(<= ~counter~0 0)} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {7306#(<= ~counter~0 0)} is VALID [2022-04-07 13:07:06,188 INFO L290 TraceCheckUtils]: 12: Hoare triple {7306#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7311#(<= ~counter~0 1)} is VALID [2022-04-07 13:07:06,189 INFO L290 TraceCheckUtils]: 13: Hoare triple {7311#(<= ~counter~0 1)} assume !!(#t~post5 < 50);havoc #t~post5; {7311#(<= ~counter~0 1)} is VALID [2022-04-07 13:07:06,189 INFO L290 TraceCheckUtils]: 14: Hoare triple {7311#(<= ~counter~0 1)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7311#(<= ~counter~0 1)} is VALID [2022-04-07 13:07:06,189 INFO L290 TraceCheckUtils]: 15: Hoare triple {7311#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7312#(<= ~counter~0 2)} is VALID [2022-04-07 13:07:06,190 INFO L290 TraceCheckUtils]: 16: Hoare triple {7312#(<= ~counter~0 2)} assume !!(#t~post5 < 50);havoc #t~post5; {7312#(<= ~counter~0 2)} is VALID [2022-04-07 13:07:06,190 INFO L290 TraceCheckUtils]: 17: Hoare triple {7312#(<= ~counter~0 2)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7312#(<= ~counter~0 2)} is VALID [2022-04-07 13:07:06,190 INFO L290 TraceCheckUtils]: 18: Hoare triple {7312#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7313#(<= ~counter~0 3)} is VALID [2022-04-07 13:07:06,191 INFO L290 TraceCheckUtils]: 19: Hoare triple {7313#(<= ~counter~0 3)} assume !!(#t~post5 < 50);havoc #t~post5; {7313#(<= ~counter~0 3)} is VALID [2022-04-07 13:07:06,191 INFO L290 TraceCheckUtils]: 20: Hoare triple {7313#(<= ~counter~0 3)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7313#(<= ~counter~0 3)} is VALID [2022-04-07 13:07:06,191 INFO L290 TraceCheckUtils]: 21: Hoare triple {7313#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7314#(<= ~counter~0 4)} is VALID [2022-04-07 13:07:06,192 INFO L290 TraceCheckUtils]: 22: Hoare triple {7314#(<= ~counter~0 4)} assume !!(#t~post5 < 50);havoc #t~post5; {7314#(<= ~counter~0 4)} is VALID [2022-04-07 13:07:06,192 INFO L290 TraceCheckUtils]: 23: Hoare triple {7314#(<= ~counter~0 4)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7314#(<= ~counter~0 4)} is VALID [2022-04-07 13:07:06,192 INFO L290 TraceCheckUtils]: 24: Hoare triple {7314#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7315#(<= ~counter~0 5)} is VALID [2022-04-07 13:07:06,193 INFO L290 TraceCheckUtils]: 25: Hoare triple {7315#(<= ~counter~0 5)} assume !!(#t~post5 < 50);havoc #t~post5; {7315#(<= ~counter~0 5)} is VALID [2022-04-07 13:07:06,193 INFO L290 TraceCheckUtils]: 26: Hoare triple {7315#(<= ~counter~0 5)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7315#(<= ~counter~0 5)} is VALID [2022-04-07 13:07:06,193 INFO L290 TraceCheckUtils]: 27: Hoare triple {7315#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7316#(<= ~counter~0 6)} is VALID [2022-04-07 13:07:06,194 INFO L290 TraceCheckUtils]: 28: Hoare triple {7316#(<= ~counter~0 6)} assume !!(#t~post5 < 50);havoc #t~post5; {7316#(<= ~counter~0 6)} is VALID [2022-04-07 13:07:06,194 INFO L290 TraceCheckUtils]: 29: Hoare triple {7316#(<= ~counter~0 6)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7316#(<= ~counter~0 6)} is VALID [2022-04-07 13:07:06,194 INFO L290 TraceCheckUtils]: 30: Hoare triple {7316#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7317#(<= ~counter~0 7)} is VALID [2022-04-07 13:07:06,195 INFO L290 TraceCheckUtils]: 31: Hoare triple {7317#(<= ~counter~0 7)} assume !!(#t~post5 < 50);havoc #t~post5; {7317#(<= ~counter~0 7)} is VALID [2022-04-07 13:07:06,195 INFO L290 TraceCheckUtils]: 32: Hoare triple {7317#(<= ~counter~0 7)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7317#(<= ~counter~0 7)} is VALID [2022-04-07 13:07:06,195 INFO L290 TraceCheckUtils]: 33: Hoare triple {7317#(<= ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7318#(<= ~counter~0 8)} is VALID [2022-04-07 13:07:06,196 INFO L290 TraceCheckUtils]: 34: Hoare triple {7318#(<= ~counter~0 8)} assume !!(#t~post5 < 50);havoc #t~post5; {7318#(<= ~counter~0 8)} is VALID [2022-04-07 13:07:06,196 INFO L290 TraceCheckUtils]: 35: Hoare triple {7318#(<= ~counter~0 8)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7318#(<= ~counter~0 8)} is VALID [2022-04-07 13:07:06,197 INFO L290 TraceCheckUtils]: 36: Hoare triple {7318#(<= ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7319#(<= ~counter~0 9)} is VALID [2022-04-07 13:07:06,197 INFO L290 TraceCheckUtils]: 37: Hoare triple {7319#(<= ~counter~0 9)} assume !!(#t~post5 < 50);havoc #t~post5; {7319#(<= ~counter~0 9)} is VALID [2022-04-07 13:07:06,197 INFO L290 TraceCheckUtils]: 38: Hoare triple {7319#(<= ~counter~0 9)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7319#(<= ~counter~0 9)} is VALID [2022-04-07 13:07:06,198 INFO L290 TraceCheckUtils]: 39: Hoare triple {7319#(<= ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7320#(<= ~counter~0 10)} is VALID [2022-04-07 13:07:06,198 INFO L290 TraceCheckUtils]: 40: Hoare triple {7320#(<= ~counter~0 10)} assume !!(#t~post5 < 50);havoc #t~post5; {7320#(<= ~counter~0 10)} is VALID [2022-04-07 13:07:06,198 INFO L290 TraceCheckUtils]: 41: Hoare triple {7320#(<= ~counter~0 10)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7320#(<= ~counter~0 10)} is VALID [2022-04-07 13:07:06,198 INFO L290 TraceCheckUtils]: 42: Hoare triple {7320#(<= ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7321#(<= |main_#t~post5| 10)} is VALID [2022-04-07 13:07:06,199 INFO L290 TraceCheckUtils]: 43: Hoare triple {7321#(<= |main_#t~post5| 10)} assume !(#t~post5 < 50);havoc #t~post5; {7302#false} is VALID [2022-04-07 13:07:06,199 INFO L290 TraceCheckUtils]: 44: Hoare triple {7302#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7302#false} is VALID [2022-04-07 13:07:06,199 INFO L290 TraceCheckUtils]: 45: Hoare triple {7302#false} assume !!(#t~post6 < 50);havoc #t~post6; {7302#false} is VALID [2022-04-07 13:07:06,199 INFO L272 TraceCheckUtils]: 46: Hoare triple {7302#false} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {7302#false} is VALID [2022-04-07 13:07:06,199 INFO L290 TraceCheckUtils]: 47: Hoare triple {7302#false} ~cond := #in~cond; {7302#false} is VALID [2022-04-07 13:07:06,199 INFO L290 TraceCheckUtils]: 48: Hoare triple {7302#false} assume 0 == ~cond; {7302#false} is VALID [2022-04-07 13:07:06,199 INFO L290 TraceCheckUtils]: 49: Hoare triple {7302#false} assume !false; {7302#false} is VALID [2022-04-07 13:07:06,200 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 13:07:06,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 13:07:06,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812603394] [2022-04-07 13:07:06,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812603394] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 13:07:06,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [993342441] [2022-04-07 13:07:06,201 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-07 13:07:06,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 13:07:06,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 13:07:06,202 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 13:07:06,202 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-07 13:07:06,238 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-07 13:07:06,238 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 13:07:06,239 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-07 13:07:06,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:07:06,250 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 13:07:06,379 INFO L272 TraceCheckUtils]: 0: Hoare triple {7301#true} call ULTIMATE.init(); {7301#true} is VALID [2022-04-07 13:07:06,380 INFO L290 TraceCheckUtils]: 1: Hoare triple {7301#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {7301#true} is VALID [2022-04-07 13:07:06,380 INFO L290 TraceCheckUtils]: 2: Hoare triple {7301#true} assume true; {7301#true} is VALID [2022-04-07 13:07:06,380 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7301#true} {7301#true} #102#return; {7301#true} is VALID [2022-04-07 13:07:06,380 INFO L272 TraceCheckUtils]: 4: Hoare triple {7301#true} call #t~ret7 := main(); {7301#true} is VALID [2022-04-07 13:07:06,380 INFO L290 TraceCheckUtils]: 5: Hoare triple {7301#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {7301#true} is VALID [2022-04-07 13:07:06,380 INFO L272 TraceCheckUtils]: 6: Hoare triple {7301#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {7301#true} is VALID [2022-04-07 13:07:06,380 INFO L290 TraceCheckUtils]: 7: Hoare triple {7301#true} ~cond := #in~cond; {7301#true} is VALID [2022-04-07 13:07:06,380 INFO L290 TraceCheckUtils]: 8: Hoare triple {7301#true} assume !(0 == ~cond); {7301#true} is VALID [2022-04-07 13:07:06,380 INFO L290 TraceCheckUtils]: 9: Hoare triple {7301#true} assume true; {7301#true} is VALID [2022-04-07 13:07:06,380 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7301#true} {7301#true} #82#return; {7301#true} is VALID [2022-04-07 13:07:06,380 INFO L290 TraceCheckUtils]: 11: Hoare triple {7301#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {7301#true} is VALID [2022-04-07 13:07:06,380 INFO L290 TraceCheckUtils]: 12: Hoare triple {7301#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7301#true} is VALID [2022-04-07 13:07:06,380 INFO L290 TraceCheckUtils]: 13: Hoare triple {7301#true} assume !!(#t~post5 < 50);havoc #t~post5; {7301#true} is VALID [2022-04-07 13:07:06,381 INFO L290 TraceCheckUtils]: 14: Hoare triple {7301#true} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7301#true} is VALID [2022-04-07 13:07:06,381 INFO L290 TraceCheckUtils]: 15: Hoare triple {7301#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7301#true} is VALID [2022-04-07 13:07:06,381 INFO L290 TraceCheckUtils]: 16: Hoare triple {7301#true} assume !!(#t~post5 < 50);havoc #t~post5; {7301#true} is VALID [2022-04-07 13:07:06,381 INFO L290 TraceCheckUtils]: 17: Hoare triple {7301#true} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7301#true} is VALID [2022-04-07 13:07:06,381 INFO L290 TraceCheckUtils]: 18: Hoare triple {7301#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7301#true} is VALID [2022-04-07 13:07:06,381 INFO L290 TraceCheckUtils]: 19: Hoare triple {7301#true} assume !!(#t~post5 < 50);havoc #t~post5; {7301#true} is VALID [2022-04-07 13:07:06,381 INFO L290 TraceCheckUtils]: 20: Hoare triple {7301#true} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7301#true} is VALID [2022-04-07 13:07:06,381 INFO L290 TraceCheckUtils]: 21: Hoare triple {7301#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7301#true} is VALID [2022-04-07 13:07:06,381 INFO L290 TraceCheckUtils]: 22: Hoare triple {7301#true} assume !!(#t~post5 < 50);havoc #t~post5; {7301#true} is VALID [2022-04-07 13:07:06,381 INFO L290 TraceCheckUtils]: 23: Hoare triple {7301#true} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7301#true} is VALID [2022-04-07 13:07:06,381 INFO L290 TraceCheckUtils]: 24: Hoare triple {7301#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7301#true} is VALID [2022-04-07 13:07:06,381 INFO L290 TraceCheckUtils]: 25: Hoare triple {7301#true} assume !!(#t~post5 < 50);havoc #t~post5; {7301#true} is VALID [2022-04-07 13:07:06,381 INFO L290 TraceCheckUtils]: 26: Hoare triple {7301#true} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7301#true} is VALID [2022-04-07 13:07:06,381 INFO L290 TraceCheckUtils]: 27: Hoare triple {7301#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7301#true} is VALID [2022-04-07 13:07:06,382 INFO L290 TraceCheckUtils]: 28: Hoare triple {7301#true} assume !!(#t~post5 < 50);havoc #t~post5; {7301#true} is VALID [2022-04-07 13:07:06,382 INFO L290 TraceCheckUtils]: 29: Hoare triple {7301#true} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7301#true} is VALID [2022-04-07 13:07:06,382 INFO L290 TraceCheckUtils]: 30: Hoare triple {7301#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7301#true} is VALID [2022-04-07 13:07:06,382 INFO L290 TraceCheckUtils]: 31: Hoare triple {7301#true} assume !!(#t~post5 < 50);havoc #t~post5; {7301#true} is VALID [2022-04-07 13:07:06,382 INFO L290 TraceCheckUtils]: 32: Hoare triple {7301#true} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7301#true} is VALID [2022-04-07 13:07:06,382 INFO L290 TraceCheckUtils]: 33: Hoare triple {7301#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7301#true} is VALID [2022-04-07 13:07:06,382 INFO L290 TraceCheckUtils]: 34: Hoare triple {7301#true} assume !!(#t~post5 < 50);havoc #t~post5; {7301#true} is VALID [2022-04-07 13:07:06,382 INFO L290 TraceCheckUtils]: 35: Hoare triple {7301#true} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7301#true} is VALID [2022-04-07 13:07:06,382 INFO L290 TraceCheckUtils]: 36: Hoare triple {7301#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7301#true} is VALID [2022-04-07 13:07:06,382 INFO L290 TraceCheckUtils]: 37: Hoare triple {7301#true} assume !!(#t~post5 < 50);havoc #t~post5; {7301#true} is VALID [2022-04-07 13:07:06,382 INFO L290 TraceCheckUtils]: 38: Hoare triple {7301#true} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7301#true} is VALID [2022-04-07 13:07:06,382 INFO L290 TraceCheckUtils]: 39: Hoare triple {7301#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7301#true} is VALID [2022-04-07 13:07:06,382 INFO L290 TraceCheckUtils]: 40: Hoare triple {7301#true} assume !!(#t~post5 < 50);havoc #t~post5; {7301#true} is VALID [2022-04-07 13:07:06,382 INFO L290 TraceCheckUtils]: 41: Hoare triple {7301#true} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7301#true} is VALID [2022-04-07 13:07:06,385 INFO L290 TraceCheckUtils]: 42: Hoare triple {7301#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7452#(<= (+ |main_#t~post5| 1) ~counter~0)} is VALID [2022-04-07 13:07:06,386 INFO L290 TraceCheckUtils]: 43: Hoare triple {7452#(<= (+ |main_#t~post5| 1) ~counter~0)} assume !(#t~post5 < 50);havoc #t~post5; {7456#(<= 51 ~counter~0)} is VALID [2022-04-07 13:07:06,386 INFO L290 TraceCheckUtils]: 44: Hoare triple {7456#(<= 51 ~counter~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7460#(<= 51 |main_#t~post6|)} is VALID [2022-04-07 13:07:06,386 INFO L290 TraceCheckUtils]: 45: Hoare triple {7460#(<= 51 |main_#t~post6|)} assume !!(#t~post6 < 50);havoc #t~post6; {7302#false} is VALID [2022-04-07 13:07:06,387 INFO L272 TraceCheckUtils]: 46: Hoare triple {7302#false} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {7302#false} is VALID [2022-04-07 13:07:06,387 INFO L290 TraceCheckUtils]: 47: Hoare triple {7302#false} ~cond := #in~cond; {7302#false} is VALID [2022-04-07 13:07:06,387 INFO L290 TraceCheckUtils]: 48: Hoare triple {7302#false} assume 0 == ~cond; {7302#false} is VALID [2022-04-07 13:07:06,387 INFO L290 TraceCheckUtils]: 49: Hoare triple {7302#false} assume !false; {7302#false} is VALID [2022-04-07 13:07:06,387 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2022-04-07 13:07:06,387 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 13:07:06,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [993342441] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 13:07:06,387 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-07 13:07:06,387 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [15] total 18 [2022-04-07 13:07:06,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527290483] [2022-04-07 13:07:06,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 13:07:06,389 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 50 [2022-04-07 13:07:06,389 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 13:07:06,389 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 13:07:06,405 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 13:07:06,405 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 13:07:06,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 13:07:06,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 13:07:06,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2022-04-07 13:07:06,406 INFO L87 Difference]: Start difference. First operand 268 states and 349 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 13:07:09,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:07:09,987 INFO L93 Difference]: Finished difference Result 305 states and 398 transitions. [2022-04-07 13:07:09,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 13:07:09,987 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 50 [2022-04-07 13:07:09,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 13:07:09,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 13:07:09,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 77 transitions. [2022-04-07 13:07:09,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 13:07:09,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 77 transitions. [2022-04-07 13:07:09,990 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 77 transitions. [2022-04-07 13:07:10,095 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-07 13:07:10,100 INFO L225 Difference]: With dead ends: 305 [2022-04-07 13:07:10,100 INFO L226 Difference]: Without dead ends: 265 [2022-04-07 13:07:10,101 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2022-04-07 13:07:10,101 INFO L913 BasicCegarLoop]: 44 mSDtfsCounter, 0 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 13:07:10,101 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 167 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 13:07:10,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2022-04-07 13:07:10,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 257. [2022-04-07 13:07:10,222 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 13:07:10,223 INFO L82 GeneralOperation]: Start isEquivalent. First operand 265 states. Second operand has 257 states, 146 states have (on average 1.178082191780822) internal successors, (172), 154 states have internal predecessors, (172), 84 states have call successors, (84), 27 states have call predecessors, (84), 26 states have return successors, (78), 75 states have call predecessors, (78), 78 states have call successors, (78) [2022-04-07 13:07:10,223 INFO L74 IsIncluded]: Start isIncluded. First operand 265 states. Second operand has 257 states, 146 states have (on average 1.178082191780822) internal successors, (172), 154 states have internal predecessors, (172), 84 states have call successors, (84), 27 states have call predecessors, (84), 26 states have return successors, (78), 75 states have call predecessors, (78), 78 states have call successors, (78) [2022-04-07 13:07:10,224 INFO L87 Difference]: Start difference. First operand 265 states. Second operand has 257 states, 146 states have (on average 1.178082191780822) internal successors, (172), 154 states have internal predecessors, (172), 84 states have call successors, (84), 27 states have call predecessors, (84), 26 states have return successors, (78), 75 states have call predecessors, (78), 78 states have call successors, (78) [2022-04-07 13:07:10,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:07:10,230 INFO L93 Difference]: Finished difference Result 265 states and 344 transitions. [2022-04-07 13:07:10,231 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 344 transitions. [2022-04-07 13:07:10,231 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:07:10,231 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:07:10,232 INFO L74 IsIncluded]: Start isIncluded. First operand has 257 states, 146 states have (on average 1.178082191780822) internal successors, (172), 154 states have internal predecessors, (172), 84 states have call successors, (84), 27 states have call predecessors, (84), 26 states have return successors, (78), 75 states have call predecessors, (78), 78 states have call successors, (78) Second operand 265 states. [2022-04-07 13:07:10,232 INFO L87 Difference]: Start difference. First operand has 257 states, 146 states have (on average 1.178082191780822) internal successors, (172), 154 states have internal predecessors, (172), 84 states have call successors, (84), 27 states have call predecessors, (84), 26 states have return successors, (78), 75 states have call predecessors, (78), 78 states have call successors, (78) Second operand 265 states. [2022-04-07 13:07:10,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:07:10,239 INFO L93 Difference]: Finished difference Result 265 states and 344 transitions. [2022-04-07 13:07:10,240 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 344 transitions. [2022-04-07 13:07:10,240 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:07:10,240 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:07:10,240 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 13:07:10,240 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 13:07:10,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 146 states have (on average 1.178082191780822) internal successors, (172), 154 states have internal predecessors, (172), 84 states have call successors, (84), 27 states have call predecessors, (84), 26 states have return successors, (78), 75 states have call predecessors, (78), 78 states have call successors, (78) [2022-04-07 13:07:10,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 334 transitions. [2022-04-07 13:07:10,247 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 334 transitions. Word has length 50 [2022-04-07 13:07:10,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 13:07:10,248 INFO L478 AbstractCegarLoop]: Abstraction has 257 states and 334 transitions. [2022-04-07 13:07:10,248 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 13:07:10,248 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 334 transitions. [2022-04-07 13:07:10,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-04-07 13:07:10,249 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 13:07:10,249 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 13:07:10,291 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-04-07 13:07:10,491 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 13:07:10,492 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 13:07:10,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 13:07:10,492 INFO L85 PathProgramCache]: Analyzing trace with hash 109392637, now seen corresponding path program 1 times [2022-04-07 13:07:10,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 13:07:10,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495554537] [2022-04-07 13:07:10,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 13:07:10,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 13:07:10,504 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 13:07:10,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1059482886] [2022-04-07 13:07:10,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 13:07:10,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 13:07:10,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 13:07:10,520 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 13:07:10,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process