/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_unwindbound5.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 12:17:44,090 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 12:17:44,091 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 12:17:44,159 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 12:17:44,159 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 12:17:44,160 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 12:17:44,162 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 12:17:44,166 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 12:17:44,169 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 12:17:44,172 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 12:17:44,173 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 12:17:44,174 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 12:17:44,174 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 12:17:44,176 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 12:17:44,177 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 12:17:44,179 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 12:17:44,179 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 12:17:44,180 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 12:17:44,187 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 12:17:44,191 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 12:17:44,192 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 12:17:44,193 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 12:17:44,194 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 12:17:44,194 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 12:17:44,195 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 12:17:44,202 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 12:17:44,202 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 12:17:44,203 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 12:17:44,212 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 12:17:44,212 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 12:17:44,213 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 12:17:44,213 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 12:17:44,214 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 12:17:44,215 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 12:17:44,215 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 12:17:44,215 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 12:17:44,216 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 12:17:44,216 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 12:17:44,216 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 12:17:44,216 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 12:17:44,217 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 12:17:44,218 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 12:17:44,218 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-27 12:17:44,258 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 12:17:44,259 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 12:17:44,259 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 12:17:44,259 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 12:17:44,260 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 12:17:44,260 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 12:17:44,260 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 12:17:44,260 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 12:17:44,260 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 12:17:44,275 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 12:17:44,275 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 12:17:44,275 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 12:17:44,276 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 12:17:44,276 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 12:17:44,276 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 12:17:44,276 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 12:17:44,276 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 12:17:44,276 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 12:17:44,276 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 12:17:44,276 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 12:17:44,276 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 12:17:44,276 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 12:17:44,276 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 12:17:44,276 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 12:17:44,277 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 12:17:44,277 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 12:17:44,277 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 12:17:44,277 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 12:17:44,277 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 12:17:44,277 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 12:17:44,277 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 12:17:44,277 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 12:17:44,278 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 12:17:44,278 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 12:17:44,631 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 12:17:44,663 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 12:17:44,665 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 12:17:44,666 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 12:17:44,679 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 12:17:44,680 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_unwindbound5.c [2022-04-27 12:17:44,745 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd5987dab/23b3611b3ac94510b46dd1b60bda6b5c/FLAG0142ed0b8 [2022-04-27 12:17:45,085 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 12:17:45,085 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_unwindbound5.c [2022-04-27 12:17:45,111 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd5987dab/23b3611b3ac94510b46dd1b60bda6b5c/FLAG0142ed0b8 [2022-04-27 12:17:45,135 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd5987dab/23b3611b3ac94510b46dd1b60bda6b5c [2022-04-27 12:17:45,137 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 12:17:45,138 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 12:17:45,139 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 12:17:45,139 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 12:17:45,159 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 12:17:45,160 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 12:17:45" (1/1) ... [2022-04-27 12:17:45,161 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63978510 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:17:45, skipping insertion in model container [2022-04-27 12:17:45,161 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 12:17:45" (1/1) ... [2022-04-27 12:17:45,165 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 12:17:45,197 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 12:17:45,441 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_unwindbound5.c[525,538] [2022-04-27 12:17:45,496 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 12:17:45,503 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 12:17:45,511 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_unwindbound5.c[525,538] [2022-04-27 12:17:45,536 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 12:17:45,549 INFO L208 MainTranslator]: Completed translation [2022-04-27 12:17:45,549 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:17:45 WrapperNode [2022-04-27 12:17:45,550 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 12:17:45,551 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 12:17:45,551 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 12:17:45,551 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 12:17:45,558 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:17:45" (1/1) ... [2022-04-27 12:17:45,559 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:17:45" (1/1) ... [2022-04-27 12:17:45,575 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:17:45" (1/1) ... [2022-04-27 12:17:45,575 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:17:45" (1/1) ... [2022-04-27 12:17:45,580 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:17:45" (1/1) ... [2022-04-27 12:17:45,583 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:17:45" (1/1) ... [2022-04-27 12:17:45,584 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:17:45" (1/1) ... [2022-04-27 12:17:45,586 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 12:17:45,586 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 12:17:45,586 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 12:17:45,587 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 12:17:45,587 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:17:45" (1/1) ... [2022-04-27 12:17:45,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 12:17:45,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:17:45,618 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-27 12:17:45,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-27 12:17:45,685 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 12:17:45,685 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 12:17:45,685 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 12:17:45,685 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 12:17:45,685 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 12:17:45,685 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 12:17:45,685 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 12:17:45,685 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 12:17:45,686 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 12:17:45,686 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 12:17:45,686 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-27 12:17:45,686 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 12:17:45,686 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 12:17:45,686 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 12:17:45,686 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 12:17:45,686 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 12:17:45,686 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 12:17:45,686 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 12:17:45,686 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 12:17:45,686 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 12:17:45,780 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 12:17:45,782 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 12:17:45,983 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 12:17:45,999 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 12:17:45,999 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-27 12:17:46,001 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 12:17:46 BoogieIcfgContainer [2022-04-27 12:17:46,001 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 12:17:46,002 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 12:17:46,002 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 12:17:46,005 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 12:17:46,005 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 12:17:45" (1/3) ... [2022-04-27 12:17:46,005 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9b537a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 12:17:46, skipping insertion in model container [2022-04-27 12:17:46,005 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:17:45" (2/3) ... [2022-04-27 12:17:46,006 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9b537a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 12:17:46, skipping insertion in model container [2022-04-27 12:17:46,006 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 12:17:46" (3/3) ... [2022-04-27 12:17:46,007 INFO L111 eAbstractionObserver]: Analyzing ICFG dijkstra-u_unwindbound5.c [2022-04-27 12:17:46,031 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 12:17:46,031 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 12:17:46,079 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 12:17:46,096 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@39519fed, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7e1b3259 [2022-04-27 12:17:46,096 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 12:17:46,102 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-27 12:17:46,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-27 12:17:46,106 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:17:46,107 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:17:46,107 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:17:46,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:17:46,126 INFO L85 PathProgramCache]: Analyzing trace with hash -2024343623, now seen corresponding path program 1 times [2022-04-27 12:17:46,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:17:46,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216771451] [2022-04-27 12:17:46,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:17:46,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:17:46,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:17:46,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 12:17:46,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:17:46,358 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-27 12:17:46,358 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} assume true; {42#true} is VALID [2022-04-27 12:17:46,359 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {42#true} {42#true} #102#return; {42#true} is VALID [2022-04-27 12:17:46,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 12:17:46,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:17:46,376 INFO L290 TraceCheckUtils]: 0: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-27 12:17:46,376 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-27 12:17:46,376 INFO L290 TraceCheckUtils]: 2: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-27 12:17:46,377 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43#false} {42#true} #82#return; {43#false} is VALID [2022-04-27 12:17:46,378 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-27 12:17:46,378 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-27 12:17:46,378 INFO L290 TraceCheckUtils]: 2: Hoare triple {42#true} assume true; {42#true} is VALID [2022-04-27 12:17:46,378 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42#true} {42#true} #102#return; {42#true} is VALID [2022-04-27 12:17:46,378 INFO L272 TraceCheckUtils]: 4: Hoare triple {42#true} call #t~ret7 := main(); {42#true} is VALID [2022-04-27 12:17:46,378 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-27 12:17:46,379 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-27 12:17:46,379 INFO L290 TraceCheckUtils]: 7: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-27 12:17:46,388 INFO L290 TraceCheckUtils]: 8: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-27 12:17:46,388 INFO L290 TraceCheckUtils]: 9: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-27 12:17:46,388 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {43#false} {42#true} #82#return; {43#false} is VALID [2022-04-27 12:17:46,388 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-27 12:17:46,389 INFO L290 TraceCheckUtils]: 12: Hoare triple {43#false} assume !true; {43#false} is VALID [2022-04-27 12:17:46,389 INFO L290 TraceCheckUtils]: 13: Hoare triple {43#false} assume !true; {43#false} is VALID [2022-04-27 12:17:46,389 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-27 12:17:46,389 INFO L290 TraceCheckUtils]: 15: Hoare triple {43#false} ~cond := #in~cond; {43#false} is VALID [2022-04-27 12:17:46,389 INFO L290 TraceCheckUtils]: 16: Hoare triple {43#false} assume 0 == ~cond; {43#false} is VALID [2022-04-27 12:17:46,390 INFO L290 TraceCheckUtils]: 17: Hoare triple {43#false} assume !false; {43#false} is VALID [2022-04-27 12:17:46,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 12:17:46,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:17:46,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216771451] [2022-04-27 12:17:46,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216771451] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:17:46,391 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:17:46,391 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 12:17:46,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20648128] [2022-04-27 12:17:46,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:17:46,396 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (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-27 12:17:46,397 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:17:46,405 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-27 12:17:46,443 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:17:46,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 12:17:46,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:17:46,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 12:17:46,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 12:17:46,478 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-27 12:17:51,938 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-27 12:17:52,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:17:52,271 INFO L93 Difference]: Finished difference Result 70 states and 111 transitions. [2022-04-27 12:17:52,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 12:17:52,271 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-27 12:17:52,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:17:52,272 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-27 12:17:52,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2022-04-27 12:17:52,287 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-27 12:17:52,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2022-04-27 12:17:52,291 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 111 transitions. [2022-04-27 12:17:52,463 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-27 12:17:52,472 INFO L225 Difference]: With dead ends: 70 [2022-04-27 12:17:52,472 INFO L226 Difference]: Without dead ends: 35 [2022-04-27 12:17:52,474 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 12:17:52,476 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 11 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-27 12:17:52,477 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 53 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 25 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-27 12:17:52,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-27 12:17:52,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2022-04-27 12:17:52,527 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:17:52,527 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-27 12:17:52,528 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-27 12:17:52,528 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-27 12:17:52,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:17:52,537 INFO L93 Difference]: Finished difference Result 35 states and 47 transitions. [2022-04-27 12:17:52,537 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 47 transitions. [2022-04-27 12:17:52,539 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:17:52,540 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:17:52,546 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-27 12:17:52,547 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-27 12:17:52,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:17:52,550 INFO L93 Difference]: Finished difference Result 35 states and 47 transitions. [2022-04-27 12:17:52,550 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 47 transitions. [2022-04-27 12:17:52,550 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:17:52,551 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:17:52,551 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:17:52,551 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:17:52,551 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-27 12:17:52,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 46 transitions. [2022-04-27 12:17:52,557 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 46 transitions. Word has length 18 [2022-04-27 12:17:52,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:17:52,557 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 46 transitions. [2022-04-27 12:17:52,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 12:17:52,558 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 46 transitions. [2022-04-27 12:17:52,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-27 12:17:52,558 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:17:52,558 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:17:52,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 12:17:52,559 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:17:52,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:17:52,559 INFO L85 PathProgramCache]: Analyzing trace with hash -96361696, now seen corresponding path program 1 times [2022-04-27 12:17:52,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:17:52,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198726149] [2022-04-27 12:17:52,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:17:52,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:17:52,594 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:17:52,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1649325739] [2022-04-27 12:17:52,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:17:52,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:17:52,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:17:52,599 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:17:52,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-27 12:17:52,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:17:52,650 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-27 12:17:52,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:17:52,660 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:17:52,804 INFO L272 TraceCheckUtils]: 0: Hoare triple {274#true} call ULTIMATE.init(); {274#true} is VALID [2022-04-27 12:17:52,805 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-27 12:17:52,805 INFO L290 TraceCheckUtils]: 2: Hoare triple {282#(<= ~counter~0 0)} assume true; {282#(<= ~counter~0 0)} is VALID [2022-04-27 12:17:52,806 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {282#(<= ~counter~0 0)} {274#true} #102#return; {282#(<= ~counter~0 0)} is VALID [2022-04-27 12:17:52,806 INFO L272 TraceCheckUtils]: 4: Hoare triple {282#(<= ~counter~0 0)} call #t~ret7 := main(); {282#(<= ~counter~0 0)} is VALID [2022-04-27 12:17:52,807 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-27 12:17:52,807 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-27 12:17:52,807 INFO L290 TraceCheckUtils]: 7: Hoare triple {282#(<= ~counter~0 0)} ~cond := #in~cond; {282#(<= ~counter~0 0)} is VALID [2022-04-27 12:17:52,808 INFO L290 TraceCheckUtils]: 8: Hoare triple {282#(<= ~counter~0 0)} assume !(0 == ~cond); {282#(<= ~counter~0 0)} is VALID [2022-04-27 12:17:52,808 INFO L290 TraceCheckUtils]: 9: Hoare triple {282#(<= ~counter~0 0)} assume true; {282#(<= ~counter~0 0)} is VALID [2022-04-27 12:17:52,808 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {282#(<= ~counter~0 0)} {282#(<= ~counter~0 0)} #82#return; {282#(<= ~counter~0 0)} is VALID [2022-04-27 12:17:52,809 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-27 12:17:52,810 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-27 12:17:52,810 INFO L290 TraceCheckUtils]: 13: Hoare triple {316#(<= |main_#t~post5| 0)} assume !(#t~post5 < 5);havoc #t~post5; {275#false} is VALID [2022-04-27 12:17:52,811 INFO L290 TraceCheckUtils]: 14: Hoare triple {275#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {275#false} is VALID [2022-04-27 12:17:52,811 INFO L290 TraceCheckUtils]: 15: Hoare triple {275#false} assume !(#t~post6 < 5);havoc #t~post6; {275#false} is VALID [2022-04-27 12:17:52,811 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-27 12:17:52,811 INFO L290 TraceCheckUtils]: 17: Hoare triple {275#false} ~cond := #in~cond; {275#false} is VALID [2022-04-27 12:17:52,811 INFO L290 TraceCheckUtils]: 18: Hoare triple {275#false} assume 0 == ~cond; {275#false} is VALID [2022-04-27 12:17:52,811 INFO L290 TraceCheckUtils]: 19: Hoare triple {275#false} assume !false; {275#false} is VALID [2022-04-27 12:17:52,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 12:17:52,812 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 12:17:52,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:17:52,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198726149] [2022-04-27 12:17:52,815 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:17:52,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1649325739] [2022-04-27 12:17:52,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1649325739] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:17:52,817 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:17:52,817 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 12:17:52,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149431613] [2022-04-27 12:17:52,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:17:52,819 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-27 12:17:52,819 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:17:52,819 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-27 12:17:52,834 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-27 12:17:52,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 12:17:52,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:17:52,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 12:17:52,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 12:17:52,836 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-27 12:17:57,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:17:57,684 INFO L93 Difference]: Finished difference Result 55 states and 78 transitions. [2022-04-27 12:17:57,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 12:17:57,684 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-27 12:17:57,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:17:57,685 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-27 12:17:57,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2022-04-27 12:17:57,687 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-27 12:17:57,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2022-04-27 12:17:57,689 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 78 transitions. [2022-04-27 12:17:57,758 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-27 12:17:57,759 INFO L225 Difference]: With dead ends: 55 [2022-04-27 12:17:57,759 INFO L226 Difference]: Without dead ends: 36 [2022-04-27 12:17:57,760 INFO L412 NwaCegarLoop]: 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-27 12:17:57,760 INFO L413 NwaCegarLoop]: 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-27 12:17:57,761 INFO L414 NwaCegarLoop]: 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-27 12:17:57,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-27 12:17:57,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-04-27 12:17:57,767 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:17:57,767 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-27 12:17:57,768 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-27 12:17:57,768 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-27 12:17:57,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:17:57,770 INFO L93 Difference]: Finished difference Result 36 states and 48 transitions. [2022-04-27 12:17:57,770 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 48 transitions. [2022-04-27 12:17:57,770 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:17:57,770 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:17:57,771 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-27 12:17:57,771 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-27 12:17:57,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:17:57,773 INFO L93 Difference]: Finished difference Result 36 states and 48 transitions. [2022-04-27 12:17:57,773 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 48 transitions. [2022-04-27 12:17:57,773 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:17:57,774 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:17:57,774 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:17:57,774 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:17:57,774 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-27 12:17:57,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 48 transitions. [2022-04-27 12:17:57,780 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 48 transitions. Word has length 20 [2022-04-27 12:17:57,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:17:57,781 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 48 transitions. [2022-04-27 12:17:57,781 INFO L496 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-27 12:17:57,781 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 48 transitions. [2022-04-27 12:17:57,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-27 12:17:57,782 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:17:57,782 INFO L195 NwaCegarLoop]: 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-27 12:17:57,807 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-27 12:17:58,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:17:58,004 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:17:58,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:17:58,004 INFO L85 PathProgramCache]: Analyzing trace with hash 962099791, now seen corresponding path program 1 times [2022-04-27 12:17:58,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:17:58,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106838231] [2022-04-27 12:17:58,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:17:58,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:17:58,016 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:17:58,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [538692427] [2022-04-27 12:17:58,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:17:58,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:17:58,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:17:58,023 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:17:58,024 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-27 12:17:58,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:17:58,072 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 12:17:58,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:17:58,081 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:17:58,198 INFO L272 TraceCheckUtils]: 0: Hoare triple {546#true} call ULTIMATE.init(); {546#true} is VALID [2022-04-27 12:17:58,199 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-27 12:17:58,199 INFO L290 TraceCheckUtils]: 2: Hoare triple {554#(<= ~counter~0 0)} assume true; {554#(<= ~counter~0 0)} is VALID [2022-04-27 12:17:58,200 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {554#(<= ~counter~0 0)} {546#true} #102#return; {554#(<= ~counter~0 0)} is VALID [2022-04-27 12:17:58,200 INFO L272 TraceCheckUtils]: 4: Hoare triple {554#(<= ~counter~0 0)} call #t~ret7 := main(); {554#(<= ~counter~0 0)} is VALID [2022-04-27 12:17:58,203 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-27 12:17:58,204 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-27 12:17:58,204 INFO L290 TraceCheckUtils]: 7: Hoare triple {554#(<= ~counter~0 0)} ~cond := #in~cond; {554#(<= ~counter~0 0)} is VALID [2022-04-27 12:17:58,204 INFO L290 TraceCheckUtils]: 8: Hoare triple {554#(<= ~counter~0 0)} assume !(0 == ~cond); {554#(<= ~counter~0 0)} is VALID [2022-04-27 12:17:58,205 INFO L290 TraceCheckUtils]: 9: Hoare triple {554#(<= ~counter~0 0)} assume true; {554#(<= ~counter~0 0)} is VALID [2022-04-27 12:17:58,205 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {554#(<= ~counter~0 0)} {554#(<= ~counter~0 0)} #82#return; {554#(<= ~counter~0 0)} is VALID [2022-04-27 12:17:58,207 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-27 12:17:58,208 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-27 12:17:58,208 INFO L290 TraceCheckUtils]: 13: Hoare triple {588#(<= ~counter~0 1)} assume !!(#t~post5 < 5);havoc #t~post5; {588#(<= ~counter~0 1)} is VALID [2022-04-27 12:17:58,208 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-27 12:17:58,209 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-27 12:17:58,209 INFO L290 TraceCheckUtils]: 16: Hoare triple {598#(<= |main_#t~post6| 1)} assume !(#t~post6 < 5);havoc #t~post6; {547#false} is VALID [2022-04-27 12:17:58,209 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-27 12:17:58,209 INFO L290 TraceCheckUtils]: 18: Hoare triple {547#false} ~cond := #in~cond; {547#false} is VALID [2022-04-27 12:17:58,209 INFO L290 TraceCheckUtils]: 19: Hoare triple {547#false} assume 0 == ~cond; {547#false} is VALID [2022-04-27 12:17:58,210 INFO L290 TraceCheckUtils]: 20: Hoare triple {547#false} assume !false; {547#false} is VALID [2022-04-27 12:17:58,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 12:17:58,210 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 12:17:58,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:17:58,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106838231] [2022-04-27 12:17:58,210 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:17:58,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [538692427] [2022-04-27 12:17:58,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [538692427] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:17:58,210 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:17:58,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 12:17:58,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199524591] [2022-04-27 12:17:58,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:17:58,211 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-27 12:17:58,211 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:17:58,211 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-27 12:17:58,225 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-27 12:17:58,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 12:17:58,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:17:58,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 12:17:58,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-27 12:17:58,226 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-27 12:18:01,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:18:01,642 INFO L93 Difference]: Finished difference Result 49 states and 64 transitions. [2022-04-27 12:18:01,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 12:18:01,643 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-27 12:18:01,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:18:01,643 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-27 12:18:01,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-27 12:18:01,644 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-27 12:18:01,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-27 12:18:01,646 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 64 transitions. [2022-04-27 12:18:01,696 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-27 12:18:01,697 INFO L225 Difference]: With dead ends: 49 [2022-04-27 12:18:01,697 INFO L226 Difference]: Without dead ends: 40 [2022-04-27 12:18:01,697 INFO L412 NwaCegarLoop]: 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-27 12:18:01,698 INFO L413 NwaCegarLoop]: 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-27 12:18:01,698 INFO L414 NwaCegarLoop]: 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-27 12:18:01,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-27 12:18:01,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2022-04-27 12:18:01,704 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:18:01,704 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-27 12:18:01,705 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-27 12:18:01,705 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-27 12:18:01,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:18:01,707 INFO L93 Difference]: Finished difference Result 40 states and 53 transitions. [2022-04-27 12:18:01,707 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 53 transitions. [2022-04-27 12:18:01,707 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:18:01,707 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:18:01,707 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-27 12:18:01,708 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-27 12:18:01,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:18:01,709 INFO L93 Difference]: Finished difference Result 40 states and 53 transitions. [2022-04-27 12:18:01,709 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 53 transitions. [2022-04-27 12:18:01,710 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:18:01,710 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:18:01,710 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:18:01,710 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:18:01,710 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-27 12:18:01,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 52 transitions. [2022-04-27 12:18:01,720 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 52 transitions. Word has length 21 [2022-04-27 12:18:01,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:18:01,720 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 52 transitions. [2022-04-27 12:18:01,720 INFO L496 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-27 12:18:01,720 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 52 transitions. [2022-04-27 12:18:01,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-27 12:18:01,721 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:18:01,721 INFO L195 NwaCegarLoop]: 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-27 12:18:01,739 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-27 12:18:01,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-27 12:18:01,922 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:18:01,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:18:01,923 INFO L85 PathProgramCache]: Analyzing trace with hash 963589341, now seen corresponding path program 1 times [2022-04-27 12:18:01,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:18:01,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408457718] [2022-04-27 12:18:01,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:18:01,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:18:01,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:18:02,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 12:18:02,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:18:02,100 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-27 12:18:02,100 INFO L290 TraceCheckUtils]: 1: Hoare triple {822#true} assume true; {822#true} is VALID [2022-04-27 12:18:02,100 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {822#true} {822#true} #102#return; {822#true} is VALID [2022-04-27 12:18:02,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 12:18:02,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:18:02,105 INFO L290 TraceCheckUtils]: 0: Hoare triple {822#true} ~cond := #in~cond; {822#true} is VALID [2022-04-27 12:18:02,105 INFO L290 TraceCheckUtils]: 1: Hoare triple {822#true} assume !(0 == ~cond); {822#true} is VALID [2022-04-27 12:18:02,106 INFO L290 TraceCheckUtils]: 2: Hoare triple {822#true} assume true; {822#true} is VALID [2022-04-27 12:18:02,106 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {822#true} {822#true} #82#return; {822#true} is VALID [2022-04-27 12:18:02,106 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-27 12:18:02,106 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-27 12:18:02,107 INFO L290 TraceCheckUtils]: 2: Hoare triple {822#true} assume true; {822#true} is VALID [2022-04-27 12:18:02,107 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {822#true} {822#true} #102#return; {822#true} is VALID [2022-04-27 12:18:02,107 INFO L272 TraceCheckUtils]: 4: Hoare triple {822#true} call #t~ret7 := main(); {822#true} is VALID [2022-04-27 12:18:02,107 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-27 12:18:02,107 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-27 12:18:02,108 INFO L290 TraceCheckUtils]: 7: Hoare triple {822#true} ~cond := #in~cond; {822#true} is VALID [2022-04-27 12:18:02,109 INFO L290 TraceCheckUtils]: 8: Hoare triple {822#true} assume !(0 == ~cond); {822#true} is VALID [2022-04-27 12:18:02,111 INFO L290 TraceCheckUtils]: 9: Hoare triple {822#true} assume true; {822#true} is VALID [2022-04-27 12:18:02,111 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {822#true} {822#true} #82#return; {822#true} is VALID [2022-04-27 12:18:02,113 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-27 12:18:02,114 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-27 12:18:02,116 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 < 5);havoc #t~post5; {831#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} is VALID [2022-04-27 12:18:02,117 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-27 12:18:02,117 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-27 12:18:02,118 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 < 5);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-27 12:18:02,119 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-27 12:18:02,119 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-27 12:18:02,119 INFO L290 TraceCheckUtils]: 19: Hoare triple {834#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {823#false} is VALID [2022-04-27 12:18:02,120 INFO L290 TraceCheckUtils]: 20: Hoare triple {823#false} assume !false; {823#false} is VALID [2022-04-27 12:18:02,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 12:18:02,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:18:02,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408457718] [2022-04-27 12:18:02,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408457718] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:18:02,122 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:18:02,122 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-27 12:18:02,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379746412] [2022-04-27 12:18:02,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:18:02,123 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-27 12:18:02,123 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:18:02,123 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-27 12:18:02,144 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-27 12:18:02,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 12:18:02,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:18:02,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 12:18:02,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-27 12:18:02,145 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-27 12:18:11,078 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:18:21,863 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-27 12:18:23,643 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 12:18:23,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:18:23,715 INFO L93 Difference]: Finished difference Result 72 states and 104 transitions. [2022-04-27 12:18:23,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 12:18:23,716 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-27 12:18:23,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:18:23,716 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-27 12:18:23,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 104 transitions. [2022-04-27 12:18:23,718 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-27 12:18:23,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 104 transitions. [2022-04-27 12:18:23,720 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 104 transitions. [2022-04-27 12:18:23,959 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-27 12:18:23,961 INFO L225 Difference]: With dead ends: 72 [2022-04-27 12:18:23,961 INFO L226 Difference]: Without dead ends: 51 [2022-04-27 12:18:23,961 INFO L412 NwaCegarLoop]: 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-27 12:18:23,962 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 24 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 37 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.9s IncrementalHoareTripleChecker+Time [2022-04-27 12:18:23,962 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 107 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 207 Invalid, 2 Unknown, 0 Unchecked, 12.9s Time] [2022-04-27 12:18:23,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-27 12:18:23,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-04-27 12:18:23,977 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:18:23,978 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-27 12:18:23,979 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-27 12:18:23,982 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-27 12:18:23,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:18:23,987 INFO L93 Difference]: Finished difference Result 51 states and 69 transitions. [2022-04-27 12:18:23,987 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 69 transitions. [2022-04-27 12:18:23,988 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:18:23,988 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:18:23,988 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-27 12:18:23,988 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-27 12:18:23,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:18:23,990 INFO L93 Difference]: Finished difference Result 51 states and 69 transitions. [2022-04-27 12:18:23,990 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 69 transitions. [2022-04-27 12:18:23,991 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:18:23,991 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:18:23,991 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:18:23,991 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:18:23,991 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-27 12:18:23,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 69 transitions. [2022-04-27 12:18:23,993 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 69 transitions. Word has length 21 [2022-04-27 12:18:23,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:18:23,993 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 69 transitions. [2022-04-27 12:18:23,993 INFO L496 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-27 12:18:23,993 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 69 transitions. [2022-04-27 12:18:23,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-27 12:18:23,993 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:18:23,994 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:18:23,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-27 12:18:23,994 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:18:23,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:18:23,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1701877900, now seen corresponding path program 1 times [2022-04-27 12:18:23,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:18:23,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604864818] [2022-04-27 12:18:23,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:18:23,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:18:24,011 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:18:24,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1402031480] [2022-04-27 12:18:24,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:18:24,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:18:24,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:18:24,012 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:18:24,013 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-27 12:18:24,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:18:24,044 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 12:18:24,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:18:24,052 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:18:24,153 INFO L272 TraceCheckUtils]: 0: Hoare triple {1137#true} call ULTIMATE.init(); {1137#true} is VALID [2022-04-27 12:18:24,154 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-27 12:18:24,154 INFO L290 TraceCheckUtils]: 2: Hoare triple {1145#(<= ~counter~0 0)} assume true; {1145#(<= ~counter~0 0)} is VALID [2022-04-27 12:18:24,154 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1145#(<= ~counter~0 0)} {1137#true} #102#return; {1145#(<= ~counter~0 0)} is VALID [2022-04-27 12:18:24,155 INFO L272 TraceCheckUtils]: 4: Hoare triple {1145#(<= ~counter~0 0)} call #t~ret7 := main(); {1145#(<= ~counter~0 0)} is VALID [2022-04-27 12:18:24,155 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-27 12:18:24,156 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-27 12:18:24,156 INFO L290 TraceCheckUtils]: 7: Hoare triple {1145#(<= ~counter~0 0)} ~cond := #in~cond; {1145#(<= ~counter~0 0)} is VALID [2022-04-27 12:18:24,156 INFO L290 TraceCheckUtils]: 8: Hoare triple {1145#(<= ~counter~0 0)} assume !(0 == ~cond); {1145#(<= ~counter~0 0)} is VALID [2022-04-27 12:18:24,158 INFO L290 TraceCheckUtils]: 9: Hoare triple {1145#(<= ~counter~0 0)} assume true; {1145#(<= ~counter~0 0)} is VALID [2022-04-27 12:18:24,159 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1145#(<= ~counter~0 0)} {1145#(<= ~counter~0 0)} #82#return; {1145#(<= ~counter~0 0)} is VALID [2022-04-27 12:18:24,159 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-27 12:18:24,160 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-27 12:18:24,160 INFO L290 TraceCheckUtils]: 13: Hoare triple {1179#(<= ~counter~0 1)} assume !!(#t~post5 < 5);havoc #t~post5; {1179#(<= ~counter~0 1)} is VALID [2022-04-27 12:18:24,160 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-27 12:18:24,166 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-27 12:18:24,166 INFO L290 TraceCheckUtils]: 16: Hoare triple {1189#(<= |main_#t~post5| 1)} assume !(#t~post5 < 5);havoc #t~post5; {1138#false} is VALID [2022-04-27 12:18:24,166 INFO L290 TraceCheckUtils]: 17: Hoare triple {1138#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1138#false} is VALID [2022-04-27 12:18:24,166 INFO L290 TraceCheckUtils]: 18: Hoare triple {1138#false} assume !(#t~post6 < 5);havoc #t~post6; {1138#false} is VALID [2022-04-27 12:18:24,167 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-27 12:18:24,167 INFO L290 TraceCheckUtils]: 20: Hoare triple {1138#false} ~cond := #in~cond; {1138#false} is VALID [2022-04-27 12:18:24,167 INFO L290 TraceCheckUtils]: 21: Hoare triple {1138#false} assume 0 == ~cond; {1138#false} is VALID [2022-04-27 12:18:24,167 INFO L290 TraceCheckUtils]: 22: Hoare triple {1138#false} assume !false; {1138#false} is VALID [2022-04-27 12:18:24,167 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-27 12:18:24,167 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:18:24,302 INFO L290 TraceCheckUtils]: 22: Hoare triple {1138#false} assume !false; {1138#false} is VALID [2022-04-27 12:18:24,302 INFO L290 TraceCheckUtils]: 21: Hoare triple {1138#false} assume 0 == ~cond; {1138#false} is VALID [2022-04-27 12:18:24,302 INFO L290 TraceCheckUtils]: 20: Hoare triple {1138#false} ~cond := #in~cond; {1138#false} is VALID [2022-04-27 12:18:24,302 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-27 12:18:24,302 INFO L290 TraceCheckUtils]: 18: Hoare triple {1138#false} assume !(#t~post6 < 5);havoc #t~post6; {1138#false} is VALID [2022-04-27 12:18:24,303 INFO L290 TraceCheckUtils]: 17: Hoare triple {1138#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1138#false} is VALID [2022-04-27 12:18:24,315 INFO L290 TraceCheckUtils]: 16: Hoare triple {1229#(< |main_#t~post5| 5)} assume !(#t~post5 < 5);havoc #t~post5; {1138#false} is VALID [2022-04-27 12:18:24,315 INFO L290 TraceCheckUtils]: 15: Hoare triple {1233#(< ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1229#(< |main_#t~post5| 5)} is VALID [2022-04-27 12:18:24,315 INFO L290 TraceCheckUtils]: 14: Hoare triple {1233#(< ~counter~0 5)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {1233#(< ~counter~0 5)} is VALID [2022-04-27 12:18:24,316 INFO L290 TraceCheckUtils]: 13: Hoare triple {1233#(< ~counter~0 5)} assume !!(#t~post5 < 5);havoc #t~post5; {1233#(< ~counter~0 5)} is VALID [2022-04-27 12:18:24,316 INFO L290 TraceCheckUtils]: 12: Hoare triple {1243#(< ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1233#(< ~counter~0 5)} is VALID [2022-04-27 12:18:24,317 INFO L290 TraceCheckUtils]: 11: Hoare triple {1243#(< ~counter~0 4)} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {1243#(< ~counter~0 4)} is VALID [2022-04-27 12:18:24,317 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1137#true} {1243#(< ~counter~0 4)} #82#return; {1243#(< ~counter~0 4)} is VALID [2022-04-27 12:18:24,317 INFO L290 TraceCheckUtils]: 9: Hoare triple {1137#true} assume true; {1137#true} is VALID [2022-04-27 12:18:24,317 INFO L290 TraceCheckUtils]: 8: Hoare triple {1137#true} assume !(0 == ~cond); {1137#true} is VALID [2022-04-27 12:18:24,317 INFO L290 TraceCheckUtils]: 7: Hoare triple {1137#true} ~cond := #in~cond; {1137#true} is VALID [2022-04-27 12:18:24,317 INFO L272 TraceCheckUtils]: 6: Hoare triple {1243#(< ~counter~0 4)} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {1137#true} is VALID [2022-04-27 12:18:24,318 INFO L290 TraceCheckUtils]: 5: Hoare triple {1243#(< ~counter~0 4)} 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 4)} is VALID [2022-04-27 12:18:24,318 INFO L272 TraceCheckUtils]: 4: Hoare triple {1243#(< ~counter~0 4)} call #t~ret7 := main(); {1243#(< ~counter~0 4)} is VALID [2022-04-27 12:18:24,318 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1243#(< ~counter~0 4)} {1137#true} #102#return; {1243#(< ~counter~0 4)} is VALID [2022-04-27 12:18:24,318 INFO L290 TraceCheckUtils]: 2: Hoare triple {1243#(< ~counter~0 4)} assume true; {1243#(< ~counter~0 4)} is VALID [2022-04-27 12:18:24,319 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 4)} is VALID [2022-04-27 12:18:24,319 INFO L272 TraceCheckUtils]: 0: Hoare triple {1137#true} call ULTIMATE.init(); {1137#true} is VALID [2022-04-27 12:18:24,319 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-27 12:18:24,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:18:24,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604864818] [2022-04-27 12:18:24,319 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:18:24,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1402031480] [2022-04-27 12:18:24,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1402031480] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 12:18:24,320 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 12:18:24,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-27 12:18:24,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769924079] [2022-04-27 12:18:24,320 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 12:18:24,320 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-27 12:18:24,320 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:18:24,321 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-27 12:18:24,341 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-27 12:18:24,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 12:18:24,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:18:24,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 12:18:24,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-27 12:18:24,342 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-27 12:18:31,590 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:18:38,114 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-27 12:18:41,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:18:41,842 INFO L93 Difference]: Finished difference Result 108 states and 149 transitions. [2022-04-27 12:18:41,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 12:18:41,842 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-27 12:18:41,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:18:41,843 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-27 12:18:41,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 137 transitions. [2022-04-27 12:18:41,845 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-27 12:18:41,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 137 transitions. [2022-04-27 12:18:41,847 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 137 transitions. [2022-04-27 12:18:41,989 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-27 12:18:41,993 INFO L225 Difference]: With dead ends: 108 [2022-04-27 12:18:41,993 INFO L226 Difference]: Without dead ends: 89 [2022-04-27 12:18:41,993 INFO L412 NwaCegarLoop]: 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-27 12:18:41,995 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 64 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 24 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.8s IncrementalHoareTripleChecker+Time [2022-04-27 12:18:41,995 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 247 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 83 Invalid, 1 Unknown, 0 Unchecked, 7.8s Time] [2022-04-27 12:18:41,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-04-27 12:18:42,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 67. [2022-04-27 12:18:42,018 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:18:42,020 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 states. Second operand has 67 states, 41 states have (on average 1.2439024390243902) internal successors, (51), 43 states have internal predecessors, (51), 19 states have call successors, (19), 7 states have call predecessors, (19), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 12:18:42,021 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand has 67 states, 41 states have (on average 1.2439024390243902) internal successors, (51), 43 states have internal predecessors, (51), 19 states have call successors, (19), 7 states have call predecessors, (19), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 12:18:42,022 INFO L87 Difference]: Start difference. First operand 89 states. Second operand has 67 states, 41 states have (on average 1.2439024390243902) internal successors, (51), 43 states have internal predecessors, (51), 19 states have call successors, (19), 7 states have call predecessors, (19), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 12:18:42,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:18:42,027 INFO L93 Difference]: Finished difference Result 89 states and 117 transitions. [2022-04-27 12:18:42,027 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 117 transitions. [2022-04-27 12:18:42,028 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:18:42,028 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:18:42,028 INFO L74 IsIncluded]: Start isIncluded. First operand has 67 states, 41 states have (on average 1.2439024390243902) internal successors, (51), 43 states have internal predecessors, (51), 19 states have call successors, (19), 7 states have call predecessors, (19), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 89 states. [2022-04-27 12:18:42,029 INFO L87 Difference]: Start difference. First operand has 67 states, 41 states have (on average 1.2439024390243902) internal successors, (51), 43 states have internal predecessors, (51), 19 states have call successors, (19), 7 states have call predecessors, (19), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 89 states. [2022-04-27 12:18:42,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:18:42,032 INFO L93 Difference]: Finished difference Result 89 states and 117 transitions. [2022-04-27 12:18:42,032 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 117 transitions. [2022-04-27 12:18:42,032 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:18:42,033 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:18:42,033 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:18:42,033 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:18:42,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 41 states have (on average 1.2439024390243902) internal successors, (51), 43 states have internal predecessors, (51), 19 states have call successors, (19), 7 states have call predecessors, (19), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 12:18:42,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 86 transitions. [2022-04-27 12:18:42,035 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 86 transitions. Word has length 23 [2022-04-27 12:18:42,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:18:42,036 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 86 transitions. [2022-04-27 12:18:42,037 INFO L496 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-27 12:18:42,037 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 86 transitions. [2022-04-27 12:18:42,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-27 12:18:42,037 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:18:42,037 INFO L195 NwaCegarLoop]: 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-27 12:18:42,055 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-27 12:18:42,253 WARN L477 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-27 12:18:42,254 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:18:42,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:18:42,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1564262277, now seen corresponding path program 1 times [2022-04-27 12:18:42,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:18:42,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719119749] [2022-04-27 12:18:42,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:18:42,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:18:42,265 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:18:42,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1374836530] [2022-04-27 12:18:42,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:18:42,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:18:42,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:18:42,266 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:18:42,267 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-27 12:18:42,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:18:42,303 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-27 12:18:42,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:18:42,310 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:18:42,446 INFO L272 TraceCheckUtils]: 0: Hoare triple {1723#true} call ULTIMATE.init(); {1723#true} is VALID [2022-04-27 12:18:42,447 INFO L290 TraceCheckUtils]: 1: Hoare triple {1723#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; {1731#(<= ~counter~0 0)} is VALID [2022-04-27 12:18:42,447 INFO L290 TraceCheckUtils]: 2: Hoare triple {1731#(<= ~counter~0 0)} assume true; {1731#(<= ~counter~0 0)} is VALID [2022-04-27 12:18:42,448 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1731#(<= ~counter~0 0)} {1723#true} #102#return; {1731#(<= ~counter~0 0)} is VALID [2022-04-27 12:18:42,448 INFO L272 TraceCheckUtils]: 4: Hoare triple {1731#(<= ~counter~0 0)} call #t~ret7 := main(); {1731#(<= ~counter~0 0)} is VALID [2022-04-27 12:18:42,448 INFO L290 TraceCheckUtils]: 5: Hoare triple {1731#(<= ~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; {1731#(<= ~counter~0 0)} is VALID [2022-04-27 12:18:42,449 INFO L272 TraceCheckUtils]: 6: Hoare triple {1731#(<= ~counter~0 0)} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {1731#(<= ~counter~0 0)} is VALID [2022-04-27 12:18:42,449 INFO L290 TraceCheckUtils]: 7: Hoare triple {1731#(<= ~counter~0 0)} ~cond := #in~cond; {1731#(<= ~counter~0 0)} is VALID [2022-04-27 12:18:42,449 INFO L290 TraceCheckUtils]: 8: Hoare triple {1731#(<= ~counter~0 0)} assume !(0 == ~cond); {1731#(<= ~counter~0 0)} is VALID [2022-04-27 12:18:42,449 INFO L290 TraceCheckUtils]: 9: Hoare triple {1731#(<= ~counter~0 0)} assume true; {1731#(<= ~counter~0 0)} is VALID [2022-04-27 12:18:42,450 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1731#(<= ~counter~0 0)} {1731#(<= ~counter~0 0)} #82#return; {1731#(<= ~counter~0 0)} is VALID [2022-04-27 12:18:42,450 INFO L290 TraceCheckUtils]: 11: Hoare triple {1731#(<= ~counter~0 0)} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {1731#(<= ~counter~0 0)} is VALID [2022-04-27 12:18:42,451 INFO L290 TraceCheckUtils]: 12: Hoare triple {1731#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1765#(<= ~counter~0 1)} is VALID [2022-04-27 12:18:42,451 INFO L290 TraceCheckUtils]: 13: Hoare triple {1765#(<= ~counter~0 1)} assume !!(#t~post5 < 5);havoc #t~post5; {1765#(<= ~counter~0 1)} is VALID [2022-04-27 12:18:42,451 INFO L290 TraceCheckUtils]: 14: Hoare triple {1765#(<= ~counter~0 1)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {1765#(<= ~counter~0 1)} is VALID [2022-04-27 12:18:42,452 INFO L290 TraceCheckUtils]: 15: Hoare triple {1765#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1775#(<= ~counter~0 2)} is VALID [2022-04-27 12:18:42,452 INFO L290 TraceCheckUtils]: 16: Hoare triple {1775#(<= ~counter~0 2)} assume !!(#t~post5 < 5);havoc #t~post5; {1775#(<= ~counter~0 2)} is VALID [2022-04-27 12:18:42,452 INFO L290 TraceCheckUtils]: 17: Hoare triple {1775#(<= ~counter~0 2)} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {1775#(<= ~counter~0 2)} is VALID [2022-04-27 12:18:42,452 INFO L290 TraceCheckUtils]: 18: Hoare triple {1775#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1785#(<= |main_#t~post6| 2)} is VALID [2022-04-27 12:18:42,453 INFO L290 TraceCheckUtils]: 19: Hoare triple {1785#(<= |main_#t~post6| 2)} assume !(#t~post6 < 5);havoc #t~post6; {1724#false} is VALID [2022-04-27 12:18:42,453 INFO L272 TraceCheckUtils]: 20: Hoare triple {1724#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)); {1724#false} is VALID [2022-04-27 12:18:42,453 INFO L290 TraceCheckUtils]: 21: Hoare triple {1724#false} ~cond := #in~cond; {1724#false} is VALID [2022-04-27 12:18:42,453 INFO L290 TraceCheckUtils]: 22: Hoare triple {1724#false} assume 0 == ~cond; {1724#false} is VALID [2022-04-27 12:18:42,454 INFO L290 TraceCheckUtils]: 23: Hoare triple {1724#false} assume !false; {1724#false} is VALID [2022-04-27 12:18:42,454 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-27 12:18:42,454 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:18:42,599 INFO L290 TraceCheckUtils]: 23: Hoare triple {1724#false} assume !false; {1724#false} is VALID [2022-04-27 12:18:42,599 INFO L290 TraceCheckUtils]: 22: Hoare triple {1724#false} assume 0 == ~cond; {1724#false} is VALID [2022-04-27 12:18:42,599 INFO L290 TraceCheckUtils]: 21: Hoare triple {1724#false} ~cond := #in~cond; {1724#false} is VALID [2022-04-27 12:18:42,599 INFO L272 TraceCheckUtils]: 20: Hoare triple {1724#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)); {1724#false} is VALID [2022-04-27 12:18:42,599 INFO L290 TraceCheckUtils]: 19: Hoare triple {1813#(< |main_#t~post6| 5)} assume !(#t~post6 < 5);havoc #t~post6; {1724#false} is VALID [2022-04-27 12:18:42,600 INFO L290 TraceCheckUtils]: 18: Hoare triple {1817#(< ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1813#(< |main_#t~post6| 5)} is VALID [2022-04-27 12:18:42,600 INFO L290 TraceCheckUtils]: 17: Hoare triple {1817#(< ~counter~0 5)} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {1817#(< ~counter~0 5)} is VALID [2022-04-27 12:18:42,600 INFO L290 TraceCheckUtils]: 16: Hoare triple {1817#(< ~counter~0 5)} assume !!(#t~post5 < 5);havoc #t~post5; {1817#(< ~counter~0 5)} is VALID [2022-04-27 12:18:42,601 INFO L290 TraceCheckUtils]: 15: Hoare triple {1827#(< ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1817#(< ~counter~0 5)} is VALID [2022-04-27 12:18:42,601 INFO L290 TraceCheckUtils]: 14: Hoare triple {1827#(< ~counter~0 4)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {1827#(< ~counter~0 4)} is VALID [2022-04-27 12:18:42,601 INFO L290 TraceCheckUtils]: 13: Hoare triple {1827#(< ~counter~0 4)} assume !!(#t~post5 < 5);havoc #t~post5; {1827#(< ~counter~0 4)} is VALID [2022-04-27 12:18:42,602 INFO L290 TraceCheckUtils]: 12: Hoare triple {1775#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1827#(< ~counter~0 4)} is VALID [2022-04-27 12:18:42,602 INFO L290 TraceCheckUtils]: 11: Hoare triple {1775#(<= ~counter~0 2)} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {1775#(<= ~counter~0 2)} is VALID [2022-04-27 12:18:42,603 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1723#true} {1775#(<= ~counter~0 2)} #82#return; {1775#(<= ~counter~0 2)} is VALID [2022-04-27 12:18:42,603 INFO L290 TraceCheckUtils]: 9: Hoare triple {1723#true} assume true; {1723#true} is VALID [2022-04-27 12:18:42,603 INFO L290 TraceCheckUtils]: 8: Hoare triple {1723#true} assume !(0 == ~cond); {1723#true} is VALID [2022-04-27 12:18:42,603 INFO L290 TraceCheckUtils]: 7: Hoare triple {1723#true} ~cond := #in~cond; {1723#true} is VALID [2022-04-27 12:18:42,603 INFO L272 TraceCheckUtils]: 6: Hoare triple {1775#(<= ~counter~0 2)} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {1723#true} is VALID [2022-04-27 12:18:42,603 INFO L290 TraceCheckUtils]: 5: Hoare triple {1775#(<= ~counter~0 2)} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {1775#(<= ~counter~0 2)} is VALID [2022-04-27 12:18:42,604 INFO L272 TraceCheckUtils]: 4: Hoare triple {1775#(<= ~counter~0 2)} call #t~ret7 := main(); {1775#(<= ~counter~0 2)} is VALID [2022-04-27 12:18:42,604 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1775#(<= ~counter~0 2)} {1723#true} #102#return; {1775#(<= ~counter~0 2)} is VALID [2022-04-27 12:18:42,605 INFO L290 TraceCheckUtils]: 2: Hoare triple {1775#(<= ~counter~0 2)} assume true; {1775#(<= ~counter~0 2)} is VALID [2022-04-27 12:18:42,605 INFO L290 TraceCheckUtils]: 1: Hoare triple {1723#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; {1775#(<= ~counter~0 2)} is VALID [2022-04-27 12:18:42,605 INFO L272 TraceCheckUtils]: 0: Hoare triple {1723#true} call ULTIMATE.init(); {1723#true} is VALID [2022-04-27 12:18:42,605 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-27 12:18:42,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:18:42,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719119749] [2022-04-27 12:18:42,605 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:18:42,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1374836530] [2022-04-27 12:18:42,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1374836530] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 12:18:42,606 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 12:18:42,606 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2022-04-27 12:18:42,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275297722] [2022-04-27 12:18:42,606 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 12:18:42,606 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 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-27 12:18:42,606 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:18:42,607 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 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-27 12:18:42,638 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-27 12:18:42,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-27 12:18:42,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:18:42,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-27 12:18:42,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-04-27 12:18:42,638 INFO L87 Difference]: Start difference. First operand 67 states and 86 transitions. Second operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 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-27 12:18:45,614 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:18:50,438 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-27 12:18:53,704 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-27 12:18:55,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:18:55,403 INFO L93 Difference]: Finished difference Result 120 states and 153 transitions. [2022-04-27 12:18:55,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-27 12:18:55,403 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 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-27 12:18:55,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:18:55,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 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-27 12:18:55,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 140 transitions. [2022-04-27 12:18:55,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 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-27 12:18:55,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 140 transitions. [2022-04-27 12:18:55,409 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 140 transitions. [2022-04-27 12:18:55,523 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 140 edges. 140 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:18:55,525 INFO L225 Difference]: With dead ends: 120 [2022-04-27 12:18:55,525 INFO L226 Difference]: Without dead ends: 109 [2022-04-27 12:18:55,525 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-04-27 12:18:55,526 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 80 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 30 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.6s IncrementalHoareTripleChecker+Time [2022-04-27 12:18:55,526 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 280 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 68 Invalid, 3 Unknown, 0 Unchecked, 8.6s Time] [2022-04-27 12:18:55,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-04-27 12:18:55,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 102. [2022-04-27 12:18:55,566 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:18:55,567 INFO L82 GeneralOperation]: Start isEquivalent. First operand 109 states. Second operand has 102 states, 61 states have (on average 1.2459016393442623) internal successors, (76), 64 states have internal predecessors, (76), 31 states have call successors, (31), 11 states have call predecessors, (31), 9 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2022-04-27 12:18:55,567 INFO L74 IsIncluded]: Start isIncluded. First operand 109 states. Second operand has 102 states, 61 states have (on average 1.2459016393442623) internal successors, (76), 64 states have internal predecessors, (76), 31 states have call successors, (31), 11 states have call predecessors, (31), 9 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2022-04-27 12:18:55,567 INFO L87 Difference]: Start difference. First operand 109 states. Second operand has 102 states, 61 states have (on average 1.2459016393442623) internal successors, (76), 64 states have internal predecessors, (76), 31 states have call successors, (31), 11 states have call predecessors, (31), 9 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2022-04-27 12:18:55,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:18:55,571 INFO L93 Difference]: Finished difference Result 109 states and 138 transitions. [2022-04-27 12:18:55,571 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 138 transitions. [2022-04-27 12:18:55,572 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:18:55,572 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:18:55,572 INFO L74 IsIncluded]: Start isIncluded. First operand has 102 states, 61 states have (on average 1.2459016393442623) internal successors, (76), 64 states have internal predecessors, (76), 31 states have call successors, (31), 11 states have call predecessors, (31), 9 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) Second operand 109 states. [2022-04-27 12:18:55,572 INFO L87 Difference]: Start difference. First operand has 102 states, 61 states have (on average 1.2459016393442623) internal successors, (76), 64 states have internal predecessors, (76), 31 states have call successors, (31), 11 states have call predecessors, (31), 9 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) Second operand 109 states. [2022-04-27 12:18:55,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:18:55,576 INFO L93 Difference]: Finished difference Result 109 states and 138 transitions. [2022-04-27 12:18:55,576 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 138 transitions. [2022-04-27 12:18:55,577 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:18:55,577 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:18:55,577 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:18:55,577 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:18:55,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 61 states have (on average 1.2459016393442623) internal successors, (76), 64 states have internal predecessors, (76), 31 states have call successors, (31), 11 states have call predecessors, (31), 9 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2022-04-27 12:18:55,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 134 transitions. [2022-04-27 12:18:55,580 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 134 transitions. Word has length 24 [2022-04-27 12:18:55,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:18:55,581 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 134 transitions. [2022-04-27 12:18:55,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 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-27 12:18:55,582 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 134 transitions. [2022-04-27 12:18:55,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-27 12:18:55,582 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:18:55,582 INFO L195 NwaCegarLoop]: 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-27 12:18:55,598 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-27 12:18:55,791 WARN L477 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-27 12:18:55,791 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:18:55,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:18:55,792 INFO L85 PathProgramCache]: Analyzing trace with hash -1562772727, now seen corresponding path program 1 times [2022-04-27 12:18:55,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:18:55,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167987814] [2022-04-27 12:18:55,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:18:55,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:18:55,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:18:55,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 12:18:55,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:18:55,995 INFO L290 TraceCheckUtils]: 0: Hoare triple {2434#(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; {2420#true} is VALID [2022-04-27 12:18:55,995 INFO L290 TraceCheckUtils]: 1: Hoare triple {2420#true} assume true; {2420#true} is VALID [2022-04-27 12:18:55,995 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2420#true} {2420#true} #102#return; {2420#true} is VALID [2022-04-27 12:18:55,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 12:18:55,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:18:56,010 INFO L290 TraceCheckUtils]: 0: Hoare triple {2420#true} ~cond := #in~cond; {2420#true} is VALID [2022-04-27 12:18:56,010 INFO L290 TraceCheckUtils]: 1: Hoare triple {2420#true} assume !(0 == ~cond); {2420#true} is VALID [2022-04-27 12:18:56,010 INFO L290 TraceCheckUtils]: 2: Hoare triple {2420#true} assume true; {2420#true} is VALID [2022-04-27 12:18:56,010 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2420#true} {2420#true} #82#return; {2420#true} is VALID [2022-04-27 12:18:56,010 INFO L272 TraceCheckUtils]: 0: Hoare triple {2420#true} call ULTIMATE.init(); {2434#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 12:18:56,011 INFO L290 TraceCheckUtils]: 1: Hoare triple {2434#(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; {2420#true} is VALID [2022-04-27 12:18:56,011 INFO L290 TraceCheckUtils]: 2: Hoare triple {2420#true} assume true; {2420#true} is VALID [2022-04-27 12:18:56,011 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2420#true} {2420#true} #102#return; {2420#true} is VALID [2022-04-27 12:18:56,013 INFO L272 TraceCheckUtils]: 4: Hoare triple {2420#true} call #t~ret7 := main(); {2420#true} is VALID [2022-04-27 12:18:56,013 INFO L290 TraceCheckUtils]: 5: Hoare triple {2420#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {2420#true} is VALID [2022-04-27 12:18:56,014 INFO L272 TraceCheckUtils]: 6: Hoare triple {2420#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {2420#true} is VALID [2022-04-27 12:18:56,014 INFO L290 TraceCheckUtils]: 7: Hoare triple {2420#true} ~cond := #in~cond; {2420#true} is VALID [2022-04-27 12:18:56,014 INFO L290 TraceCheckUtils]: 8: Hoare triple {2420#true} assume !(0 == ~cond); {2420#true} is VALID [2022-04-27 12:18:56,014 INFO L290 TraceCheckUtils]: 9: Hoare triple {2420#true} assume true; {2420#true} is VALID [2022-04-27 12:18:56,014 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2420#true} {2420#true} #82#return; {2420#true} is VALID [2022-04-27 12:18:56,014 INFO L290 TraceCheckUtils]: 11: Hoare triple {2420#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {2429#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-27 12:18:56,015 INFO L290 TraceCheckUtils]: 12: Hoare triple {2429#(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; {2429#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-27 12:18:56,015 INFO L290 TraceCheckUtils]: 13: Hoare triple {2429#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} assume !!(#t~post5 < 5);havoc #t~post5; {2429#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-27 12:18:56,016 INFO L290 TraceCheckUtils]: 14: Hoare triple {2429#(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; {2430#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-27 12:18:56,016 INFO L290 TraceCheckUtils]: 15: Hoare triple {2430#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2430#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-27 12:18:56,016 INFO L290 TraceCheckUtils]: 16: Hoare triple {2430#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} assume !!(#t~post5 < 5);havoc #t~post5; {2430#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-27 12:18:56,017 INFO L290 TraceCheckUtils]: 17: Hoare triple {2430#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {2431#(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-27 12:18:56,017 INFO L290 TraceCheckUtils]: 18: Hoare triple {2431#(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; {2431#(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-27 12:18:56,018 INFO L290 TraceCheckUtils]: 19: Hoare triple {2431#(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 < 5);havoc #t~post6; {2431#(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-27 12:18:56,019 INFO L272 TraceCheckUtils]: 20: Hoare triple {2431#(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)); {2432#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:18:56,019 INFO L290 TraceCheckUtils]: 21: Hoare triple {2432#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {2433#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 12:18:56,019 INFO L290 TraceCheckUtils]: 22: Hoare triple {2433#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {2421#false} is VALID [2022-04-27 12:18:56,019 INFO L290 TraceCheckUtils]: 23: Hoare triple {2421#false} assume !false; {2421#false} is VALID [2022-04-27 12:18:56,020 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-27 12:18:56,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:18:56,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167987814] [2022-04-27 12:18:56,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167987814] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 12:18:56,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1574384213] [2022-04-27 12:18:56,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:18:56,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:18:56,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:18:56,022 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:18:56,064 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-27 12:18:56,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:18:56,106 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-27 12:18:56,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:18:56,120 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:18:56,392 INFO L272 TraceCheckUtils]: 0: Hoare triple {2420#true} call ULTIMATE.init(); {2420#true} is VALID [2022-04-27 12:18:56,392 INFO L290 TraceCheckUtils]: 1: Hoare triple {2420#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; {2420#true} is VALID [2022-04-27 12:18:56,392 INFO L290 TraceCheckUtils]: 2: Hoare triple {2420#true} assume true; {2420#true} is VALID [2022-04-27 12:18:56,392 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2420#true} {2420#true} #102#return; {2420#true} is VALID [2022-04-27 12:18:56,392 INFO L272 TraceCheckUtils]: 4: Hoare triple {2420#true} call #t~ret7 := main(); {2420#true} is VALID [2022-04-27 12:18:56,392 INFO L290 TraceCheckUtils]: 5: Hoare triple {2420#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {2420#true} is VALID [2022-04-27 12:18:56,393 INFO L272 TraceCheckUtils]: 6: Hoare triple {2420#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {2420#true} is VALID [2022-04-27 12:18:56,393 INFO L290 TraceCheckUtils]: 7: Hoare triple {2420#true} ~cond := #in~cond; {2420#true} is VALID [2022-04-27 12:18:56,393 INFO L290 TraceCheckUtils]: 8: Hoare triple {2420#true} assume !(0 == ~cond); {2420#true} is VALID [2022-04-27 12:18:56,393 INFO L290 TraceCheckUtils]: 9: Hoare triple {2420#true} assume true; {2420#true} is VALID [2022-04-27 12:18:56,393 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2420#true} {2420#true} #82#return; {2420#true} is VALID [2022-04-27 12:18:56,393 INFO L290 TraceCheckUtils]: 11: Hoare triple {2420#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {2429#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-27 12:18:56,394 INFO L290 TraceCheckUtils]: 12: Hoare triple {2429#(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; {2429#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-27 12:18:56,394 INFO L290 TraceCheckUtils]: 13: Hoare triple {2429#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} assume !!(#t~post5 < 5);havoc #t~post5; {2429#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-27 12:18:56,394 INFO L290 TraceCheckUtils]: 14: Hoare triple {2429#(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; {2480#(and (= main_~p~0 0) (= main_~q~0 4) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-27 12:18:56,395 INFO L290 TraceCheckUtils]: 15: Hoare triple {2480#(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; {2480#(and (= main_~p~0 0) (= main_~q~0 4) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-27 12:18:56,411 INFO L290 TraceCheckUtils]: 16: Hoare triple {2480#(and (= main_~p~0 0) (= main_~q~0 4) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} assume !!(#t~post5 < 5);havoc #t~post5; {2480#(and (= main_~p~0 0) (= main_~q~0 4) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-27 12:18:56,412 INFO L290 TraceCheckUtils]: 17: Hoare triple {2480#(and (= main_~p~0 0) (= main_~q~0 4) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {2490#(and (not (<= (mod main_~q~0 4294967296) (mod main_~r~0 4294967296))) (= main_~p~0 0) (= main_~q~0 4))} is VALID [2022-04-27 12:18:56,413 INFO L290 TraceCheckUtils]: 18: Hoare triple {2490#(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; {2490#(and (not (<= (mod main_~q~0 4294967296) (mod main_~r~0 4294967296))) (= main_~p~0 0) (= main_~q~0 4))} is VALID [2022-04-27 12:18:56,413 INFO L290 TraceCheckUtils]: 19: Hoare triple {2490#(and (not (<= (mod main_~q~0 4294967296) (mod main_~r~0 4294967296))) (= main_~p~0 0) (= main_~q~0 4))} assume !!(#t~post6 < 5);havoc #t~post6; {2490#(and (not (<= (mod main_~q~0 4294967296) (mod main_~r~0 4294967296))) (= main_~p~0 0) (= main_~q~0 4))} is VALID [2022-04-27 12:18:56,414 INFO L272 TraceCheckUtils]: 20: Hoare triple {2490#(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)); {2500#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:18:56,414 INFO L290 TraceCheckUtils]: 21: Hoare triple {2500#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2504#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:18:56,414 INFO L290 TraceCheckUtils]: 22: Hoare triple {2504#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2421#false} is VALID [2022-04-27 12:18:56,414 INFO L290 TraceCheckUtils]: 23: Hoare triple {2421#false} assume !false; {2421#false} is VALID [2022-04-27 12:18:56,415 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-27 12:18:56,415 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:18:56,624 INFO L290 TraceCheckUtils]: 23: Hoare triple {2421#false} assume !false; {2421#false} is VALID [2022-04-27 12:18:56,624 INFO L290 TraceCheckUtils]: 22: Hoare triple {2504#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2421#false} is VALID [2022-04-27 12:18:56,625 INFO L290 TraceCheckUtils]: 21: Hoare triple {2500#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2504#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:18:56,626 INFO L272 TraceCheckUtils]: 20: Hoare triple {2520#(< (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)); {2500#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:18:56,627 INFO L290 TraceCheckUtils]: 19: Hoare triple {2520#(< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296))} assume !!(#t~post6 < 5);havoc #t~post6; {2520#(< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296))} is VALID [2022-04-27 12:18:56,629 INFO L290 TraceCheckUtils]: 18: Hoare triple {2520#(< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2520#(< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296))} is VALID [2022-04-27 12:18:56,629 INFO L290 TraceCheckUtils]: 17: Hoare triple {2530#(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); {2520#(< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296))} is VALID [2022-04-27 12:18:56,630 INFO L290 TraceCheckUtils]: 16: Hoare triple {2530#(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 < 5);havoc #t~post5; {2530#(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-27 12:18:56,630 INFO L290 TraceCheckUtils]: 15: Hoare triple {2530#(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; {2530#(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-27 12:18:56,634 INFO L290 TraceCheckUtils]: 14: Hoare triple {2540#(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; {2530#(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-27 12:18:56,635 INFO L290 TraceCheckUtils]: 13: Hoare triple {2540#(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 < 5);havoc #t~post5; {2540#(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-27 12:18:56,635 INFO L290 TraceCheckUtils]: 12: Hoare triple {2540#(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; {2540#(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-27 12:18:56,637 INFO L290 TraceCheckUtils]: 11: Hoare triple {2420#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {2540#(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-27 12:18:56,637 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2420#true} {2420#true} #82#return; {2420#true} is VALID [2022-04-27 12:18:56,638 INFO L290 TraceCheckUtils]: 9: Hoare triple {2420#true} assume true; {2420#true} is VALID [2022-04-27 12:18:56,638 INFO L290 TraceCheckUtils]: 8: Hoare triple {2420#true} assume !(0 == ~cond); {2420#true} is VALID [2022-04-27 12:18:56,638 INFO L290 TraceCheckUtils]: 7: Hoare triple {2420#true} ~cond := #in~cond; {2420#true} is VALID [2022-04-27 12:18:56,638 INFO L272 TraceCheckUtils]: 6: Hoare triple {2420#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {2420#true} is VALID [2022-04-27 12:18:56,638 INFO L290 TraceCheckUtils]: 5: Hoare triple {2420#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {2420#true} is VALID [2022-04-27 12:18:56,638 INFO L272 TraceCheckUtils]: 4: Hoare triple {2420#true} call #t~ret7 := main(); {2420#true} is VALID [2022-04-27 12:18:56,638 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2420#true} {2420#true} #102#return; {2420#true} is VALID [2022-04-27 12:18:56,638 INFO L290 TraceCheckUtils]: 2: Hoare triple {2420#true} assume true; {2420#true} is VALID [2022-04-27 12:18:56,638 INFO L290 TraceCheckUtils]: 1: Hoare triple {2420#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; {2420#true} is VALID [2022-04-27 12:18:56,638 INFO L272 TraceCheckUtils]: 0: Hoare triple {2420#true} call ULTIMATE.init(); {2420#true} is VALID [2022-04-27 12:18:56,638 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-27 12:18:56,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1574384213] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 12:18:56,638 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 12:18:56,639 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 15 [2022-04-27 12:18:56,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219174511] [2022-04-27 12:18:56,639 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 12:18:56,639 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-27 12:18:56,639 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:18:56,639 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-27 12:18:56,674 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:18:56,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-27 12:18:56,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:18:56,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-27 12:18:56,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2022-04-27 12:18:56,675 INFO L87 Difference]: Start difference. First operand 102 states and 134 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-27 12:19:01,032 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:19:04,044 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:19:06,137 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-27 12:19:08,592 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:19:12,175 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:19:14,184 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:19:16,693 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-27 12:19:31,162 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:19:33,194 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:19:35,729 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-27 12:19:40,002 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-27 12:19:42,141 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 12:19:46,427 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-27 12:19:53,941 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 12:20:04,567 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 12:20:08,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:20:08,703 INFO L93 Difference]: Finished difference Result 149 states and 203 transitions. [2022-04-27 12:20:08,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-27 12:20:08,704 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-27 12:20:08,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:20:08,704 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-27 12:20:08,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 144 transitions. [2022-04-27 12:20:08,706 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-27 12:20:08,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 144 transitions. [2022-04-27 12:20:08,709 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 144 transitions. [2022-04-27 12:20:09,358 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-27 12:20:09,360 INFO L225 Difference]: With dead ends: 149 [2022-04-27 12:20:09,360 INFO L226 Difference]: Without dead ends: 138 [2022-04-27 12:20:09,361 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=399, Unknown=0, NotChecked=0, Total=506 [2022-04-27 12:20:09,361 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 69 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 496 mSolverCounterSat, 145 mSolverCounterUnsat, 13 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 43.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 496 IncrementalHoareTripleChecker+Invalid, 13 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 43.5s IncrementalHoareTripleChecker+Time [2022-04-27 12:20:09,361 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 165 Invalid, 654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 496 Invalid, 13 Unknown, 0 Unchecked, 43.5s Time] [2022-04-27 12:20:09,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2022-04-27 12:20:09,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 134. [2022-04-27 12:20:09,436 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:20:09,438 INFO L82 GeneralOperation]: Start isEquivalent. First operand 138 states. Second operand has 134 states, 77 states have (on average 1.2207792207792207) internal successors, (94), 82 states have internal predecessors, (94), 44 states have call successors, (44), 14 states have call predecessors, (44), 12 states have return successors, (40), 37 states have call predecessors, (40), 40 states have call successors, (40) [2022-04-27 12:20:09,438 INFO L74 IsIncluded]: Start isIncluded. First operand 138 states. Second operand has 134 states, 77 states have (on average 1.2207792207792207) internal successors, (94), 82 states have internal predecessors, (94), 44 states have call successors, (44), 14 states have call predecessors, (44), 12 states have return successors, (40), 37 states have call predecessors, (40), 40 states have call successors, (40) [2022-04-27 12:20:09,439 INFO L87 Difference]: Start difference. First operand 138 states. Second operand has 134 states, 77 states have (on average 1.2207792207792207) internal successors, (94), 82 states have internal predecessors, (94), 44 states have call successors, (44), 14 states have call predecessors, (44), 12 states have return successors, (40), 37 states have call predecessors, (40), 40 states have call successors, (40) [2022-04-27 12:20:09,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:20:09,459 INFO L93 Difference]: Finished difference Result 138 states and 185 transitions. [2022-04-27 12:20:09,459 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 185 transitions. [2022-04-27 12:20:09,459 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:20:09,459 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:20:09,460 INFO L74 IsIncluded]: Start isIncluded. First operand has 134 states, 77 states have (on average 1.2207792207792207) internal successors, (94), 82 states have internal predecessors, (94), 44 states have call successors, (44), 14 states have call predecessors, (44), 12 states have return successors, (40), 37 states have call predecessors, (40), 40 states have call successors, (40) Second operand 138 states. [2022-04-27 12:20:09,460 INFO L87 Difference]: Start difference. First operand has 134 states, 77 states have (on average 1.2207792207792207) internal successors, (94), 82 states have internal predecessors, (94), 44 states have call successors, (44), 14 states have call predecessors, (44), 12 states have return successors, (40), 37 states have call predecessors, (40), 40 states have call successors, (40) Second operand 138 states. [2022-04-27 12:20:09,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:20:09,464 INFO L93 Difference]: Finished difference Result 138 states and 185 transitions. [2022-04-27 12:20:09,464 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 185 transitions. [2022-04-27 12:20:09,464 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:20:09,464 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:20:09,464 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:20:09,464 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:20:09,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 77 states have (on average 1.2207792207792207) internal successors, (94), 82 states have internal predecessors, (94), 44 states have call successors, (44), 14 states have call predecessors, (44), 12 states have return successors, (40), 37 states have call predecessors, (40), 40 states have call successors, (40) [2022-04-27 12:20:09,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 178 transitions. [2022-04-27 12:20:09,468 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 178 transitions. Word has length 24 [2022-04-27 12:20:09,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:20:09,468 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 178 transitions. [2022-04-27 12:20:09,468 INFO L496 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-27 12:20:09,468 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 178 transitions. [2022-04-27 12:20:09,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-27 12:20:09,469 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:20:09,469 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:20:09,501 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-27 12:20:09,699 WARN L477 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-27 12:20:09,699 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:20:09,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:20:09,699 INFO L85 PathProgramCache]: Analyzing trace with hash -45171523, now seen corresponding path program 1 times [2022-04-27 12:20:09,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:20:09,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330836896] [2022-04-27 12:20:09,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:20:09,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:20:09,711 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:20:09,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1098330355] [2022-04-27 12:20:09,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:20:09,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:20:09,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:20:09,721 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:20:09,722 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-27 12:20:09,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:20:09,819 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-27 12:20:09,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:20:09,830 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:20:10,026 INFO L272 TraceCheckUtils]: 0: Hoare triple {3295#true} call ULTIMATE.init(); {3295#true} is VALID [2022-04-27 12:20:10,027 INFO L290 TraceCheckUtils]: 1: Hoare triple {3295#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; {3295#true} is VALID [2022-04-27 12:20:10,027 INFO L290 TraceCheckUtils]: 2: Hoare triple {3295#true} assume true; {3295#true} is VALID [2022-04-27 12:20:10,027 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3295#true} {3295#true} #102#return; {3295#true} is VALID [2022-04-27 12:20:10,027 INFO L272 TraceCheckUtils]: 4: Hoare triple {3295#true} call #t~ret7 := main(); {3295#true} is VALID [2022-04-27 12:20:10,027 INFO L290 TraceCheckUtils]: 5: Hoare triple {3295#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {3295#true} is VALID [2022-04-27 12:20:10,027 INFO L272 TraceCheckUtils]: 6: Hoare triple {3295#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {3295#true} is VALID [2022-04-27 12:20:10,027 INFO L290 TraceCheckUtils]: 7: Hoare triple {3295#true} ~cond := #in~cond; {3295#true} is VALID [2022-04-27 12:20:10,027 INFO L290 TraceCheckUtils]: 8: Hoare triple {3295#true} assume !(0 == ~cond); {3295#true} is VALID [2022-04-27 12:20:10,027 INFO L290 TraceCheckUtils]: 9: Hoare triple {3295#true} assume true; {3295#true} is VALID [2022-04-27 12:20:10,027 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3295#true} {3295#true} #82#return; {3295#true} is VALID [2022-04-27 12:20:10,028 INFO L290 TraceCheckUtils]: 11: Hoare triple {3295#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {3333#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-27 12:20:10,028 INFO L290 TraceCheckUtils]: 12: Hoare triple {3333#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3333#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-27 12:20:10,029 INFO L290 TraceCheckUtils]: 13: Hoare triple {3333#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} assume !!(#t~post5 < 5);havoc #t~post5; {3333#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-27 12:20:10,029 INFO L290 TraceCheckUtils]: 14: Hoare triple {3333#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {3333#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-27 12:20:10,030 INFO L290 TraceCheckUtils]: 15: Hoare triple {3333#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3333#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-27 12:20:10,030 INFO L290 TraceCheckUtils]: 16: Hoare triple {3333#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} assume !!(#t~post6 < 5);havoc #t~post6; {3333#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-27 12:20:10,030 INFO L272 TraceCheckUtils]: 17: Hoare triple {3333#(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)); {3295#true} is VALID [2022-04-27 12:20:10,030 INFO L290 TraceCheckUtils]: 18: Hoare triple {3295#true} ~cond := #in~cond; {3295#true} is VALID [2022-04-27 12:20:10,030 INFO L290 TraceCheckUtils]: 19: Hoare triple {3295#true} assume !(0 == ~cond); {3295#true} is VALID [2022-04-27 12:20:10,030 INFO L290 TraceCheckUtils]: 20: Hoare triple {3295#true} assume true; {3295#true} is VALID [2022-04-27 12:20:10,031 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3295#true} {3333#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} #84#return; {3333#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-27 12:20:10,031 INFO L272 TraceCheckUtils]: 22: Hoare triple {3333#(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)); {3295#true} is VALID [2022-04-27 12:20:10,031 INFO L290 TraceCheckUtils]: 23: Hoare triple {3295#true} ~cond := #in~cond; {3295#true} is VALID [2022-04-27 12:20:10,031 INFO L290 TraceCheckUtils]: 24: Hoare triple {3295#true} assume !(0 == ~cond); {3295#true} is VALID [2022-04-27 12:20:10,031 INFO L290 TraceCheckUtils]: 25: Hoare triple {3295#true} assume true; {3295#true} is VALID [2022-04-27 12:20:10,031 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {3295#true} {3333#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} #86#return; {3333#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-27 12:20:10,032 INFO L272 TraceCheckUtils]: 27: Hoare triple {3333#(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)); {3382#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:20:10,033 INFO L290 TraceCheckUtils]: 28: Hoare triple {3382#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3386#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:20:10,033 INFO L290 TraceCheckUtils]: 29: Hoare triple {3386#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3296#false} is VALID [2022-04-27 12:20:10,033 INFO L290 TraceCheckUtils]: 30: Hoare triple {3296#false} assume !false; {3296#false} is VALID [2022-04-27 12:20:10,034 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 12:20:10,034 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 12:20:10,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:20:10,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330836896] [2022-04-27 12:20:10,035 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:20:10,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1098330355] [2022-04-27 12:20:10,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1098330355] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:20:10,035 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:20:10,035 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 12:20:10,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296628197] [2022-04-27 12:20:10,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:20:10,036 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-27 12:20:10,036 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:20:10,036 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-27 12:20:10,057 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:20:10,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 12:20:10,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:20:10,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 12:20:10,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 12:20:10,058 INFO L87 Difference]: Start difference. First operand 134 states and 178 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-27 12:20:15,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:20:15,363 INFO L93 Difference]: Finished difference Result 140 states and 182 transitions. [2022-04-27 12:20:15,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 12:20:15,364 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-27 12:20:15,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:20:15,364 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-27 12:20:15,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 71 transitions. [2022-04-27 12:20:15,365 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-27 12:20:15,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 71 transitions. [2022-04-27 12:20:15,366 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 71 transitions. [2022-04-27 12:20:15,456 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-27 12:20:15,458 INFO L225 Difference]: With dead ends: 140 [2022-04-27 12:20:15,458 INFO L226 Difference]: Without dead ends: 106 [2022-04-27 12:20:15,458 INFO L412 NwaCegarLoop]: 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-27 12:20:15,459 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 6 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s 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.8s IncrementalHoareTripleChecker+Time [2022-04-27 12:20:15,459 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 154 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-27 12:20:15,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-04-27 12:20:15,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2022-04-27 12:20:15,496 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:20:15,501 INFO L82 GeneralOperation]: Start isEquivalent. First operand 106 states. Second operand has 106 states, 60 states have (on average 1.25) internal successors, (75), 65 states have internal predecessors, (75), 37 states have call successors, (37), 9 states have call predecessors, (37), 8 states have return successors, (34), 31 states have call predecessors, (34), 34 states have call successors, (34) [2022-04-27 12:20:15,503 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states. Second operand has 106 states, 60 states have (on average 1.25) internal successors, (75), 65 states have internal predecessors, (75), 37 states have call successors, (37), 9 states have call predecessors, (37), 8 states have return successors, (34), 31 states have call predecessors, (34), 34 states have call successors, (34) [2022-04-27 12:20:15,505 INFO L87 Difference]: Start difference. First operand 106 states. Second operand has 106 states, 60 states have (on average 1.25) internal successors, (75), 65 states have internal predecessors, (75), 37 states have call successors, (37), 9 states have call predecessors, (37), 8 states have return successors, (34), 31 states have call predecessors, (34), 34 states have call successors, (34) [2022-04-27 12:20:15,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:20:15,508 INFO L93 Difference]: Finished difference Result 106 states and 146 transitions. [2022-04-27 12:20:15,508 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 146 transitions. [2022-04-27 12:20:15,508 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:20:15,508 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:20:15,509 INFO L74 IsIncluded]: Start isIncluded. First operand has 106 states, 60 states have (on average 1.25) internal successors, (75), 65 states have internal predecessors, (75), 37 states have call successors, (37), 9 states have call predecessors, (37), 8 states have return successors, (34), 31 states have call predecessors, (34), 34 states have call successors, (34) Second operand 106 states. [2022-04-27 12:20:15,509 INFO L87 Difference]: Start difference. First operand has 106 states, 60 states have (on average 1.25) internal successors, (75), 65 states have internal predecessors, (75), 37 states have call successors, (37), 9 states have call predecessors, (37), 8 states have return successors, (34), 31 states have call predecessors, (34), 34 states have call successors, (34) Second operand 106 states. [2022-04-27 12:20:15,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:20:15,513 INFO L93 Difference]: Finished difference Result 106 states and 146 transitions. [2022-04-27 12:20:15,513 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 146 transitions. [2022-04-27 12:20:15,514 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:20:15,514 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:20:15,514 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:20:15,514 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:20:15,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 60 states have (on average 1.25) internal successors, (75), 65 states have internal predecessors, (75), 37 states have call successors, (37), 9 states have call predecessors, (37), 8 states have return successors, (34), 31 states have call predecessors, (34), 34 states have call successors, (34) [2022-04-27 12:20:15,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 146 transitions. [2022-04-27 12:20:15,517 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 146 transitions. Word has length 31 [2022-04-27 12:20:15,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:20:15,517 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 146 transitions. [2022-04-27 12:20:15,517 INFO L496 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-27 12:20:15,517 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 146 transitions. [2022-04-27 12:20:15,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-27 12:20:15,519 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:20:15,519 INFO L195 NwaCegarLoop]: 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-27 12:20:15,525 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-27 12:20:15,723 WARN L477 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-27 12:20:15,723 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:20:15,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:20:15,723 INFO L85 PathProgramCache]: Analyzing trace with hash -1547125783, now seen corresponding path program 1 times [2022-04-27 12:20:15,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:20:15,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848229161] [2022-04-27 12:20:15,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:20:15,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:20:15,736 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:20:15,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [142625711] [2022-04-27 12:20:15,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:20:15,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:20:15,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:20:15,756 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:20:15,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-27 12:20:15,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:20:15,896 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 12:20:15,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:20:15,906 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:20:16,134 INFO L272 TraceCheckUtils]: 0: Hoare triple {3967#true} call ULTIMATE.init(); {3967#true} is VALID [2022-04-27 12:20:16,134 INFO L290 TraceCheckUtils]: 1: Hoare triple {3967#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; {3967#true} is VALID [2022-04-27 12:20:16,135 INFO L290 TraceCheckUtils]: 2: Hoare triple {3967#true} assume true; {3967#true} is VALID [2022-04-27 12:20:16,135 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3967#true} {3967#true} #102#return; {3967#true} is VALID [2022-04-27 12:20:16,135 INFO L272 TraceCheckUtils]: 4: Hoare triple {3967#true} call #t~ret7 := main(); {3967#true} is VALID [2022-04-27 12:20:16,135 INFO L290 TraceCheckUtils]: 5: Hoare triple {3967#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {3967#true} is VALID [2022-04-27 12:20:16,135 INFO L272 TraceCheckUtils]: 6: Hoare triple {3967#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {3967#true} is VALID [2022-04-27 12:20:16,136 INFO L290 TraceCheckUtils]: 7: Hoare triple {3967#true} ~cond := #in~cond; {3967#true} is VALID [2022-04-27 12:20:16,136 INFO L290 TraceCheckUtils]: 8: Hoare triple {3967#true} assume !(0 == ~cond); {3967#true} is VALID [2022-04-27 12:20:16,136 INFO L290 TraceCheckUtils]: 9: Hoare triple {3967#true} assume true; {3967#true} is VALID [2022-04-27 12:20:16,136 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3967#true} {3967#true} #82#return; {3967#true} is VALID [2022-04-27 12:20:16,137 INFO L290 TraceCheckUtils]: 11: Hoare triple {3967#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {4005#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-27 12:20:16,137 INFO L290 TraceCheckUtils]: 12: Hoare triple {4005#(and (= main_~p~0 0) (= main_~h~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4005#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-27 12:20:16,138 INFO L290 TraceCheckUtils]: 13: Hoare triple {4005#(and (= main_~p~0 0) (= main_~h~0 0))} assume !!(#t~post5 < 5);havoc #t~post5; {4005#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-27 12:20:16,138 INFO L290 TraceCheckUtils]: 14: Hoare triple {4005#(and (= main_~p~0 0) (= main_~h~0 0))} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {4005#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-27 12:20:16,139 INFO L290 TraceCheckUtils]: 15: Hoare triple {4005#(and (= main_~p~0 0) (= main_~h~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4005#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-27 12:20:16,139 INFO L290 TraceCheckUtils]: 16: Hoare triple {4005#(and (= main_~p~0 0) (= main_~h~0 0))} assume !!(#t~post5 < 5);havoc #t~post5; {4005#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-27 12:20:16,139 INFO L290 TraceCheckUtils]: 17: Hoare triple {4005#(and (= main_~p~0 0) (= main_~h~0 0))} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {4005#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-27 12:20:16,140 INFO L290 TraceCheckUtils]: 18: Hoare triple {4005#(and (= main_~p~0 0) (= main_~h~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4005#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-27 12:20:16,140 INFO L290 TraceCheckUtils]: 19: Hoare triple {4005#(and (= main_~p~0 0) (= main_~h~0 0))} assume !!(#t~post6 < 5);havoc #t~post6; {4005#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-27 12:20:16,140 INFO L272 TraceCheckUtils]: 20: Hoare triple {4005#(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)); {3967#true} is VALID [2022-04-27 12:20:16,140 INFO L290 TraceCheckUtils]: 21: Hoare triple {3967#true} ~cond := #in~cond; {3967#true} is VALID [2022-04-27 12:20:16,140 INFO L290 TraceCheckUtils]: 22: Hoare triple {3967#true} assume !(0 == ~cond); {3967#true} is VALID [2022-04-27 12:20:16,141 INFO L290 TraceCheckUtils]: 23: Hoare triple {3967#true} assume true; {3967#true} is VALID [2022-04-27 12:20:16,141 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {3967#true} {4005#(and (= main_~p~0 0) (= main_~h~0 0))} #84#return; {4005#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-27 12:20:16,141 INFO L272 TraceCheckUtils]: 25: Hoare triple {4005#(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)); {3967#true} is VALID [2022-04-27 12:20:16,141 INFO L290 TraceCheckUtils]: 26: Hoare triple {3967#true} ~cond := #in~cond; {3967#true} is VALID [2022-04-27 12:20:16,141 INFO L290 TraceCheckUtils]: 27: Hoare triple {3967#true} assume !(0 == ~cond); {3967#true} is VALID [2022-04-27 12:20:16,141 INFO L290 TraceCheckUtils]: 28: Hoare triple {3967#true} assume true; {3967#true} is VALID [2022-04-27 12:20:16,142 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {3967#true} {4005#(and (= main_~p~0 0) (= main_~h~0 0))} #86#return; {4005#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-27 12:20:16,143 INFO L272 TraceCheckUtils]: 30: Hoare triple {4005#(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)); {4063#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:20:16,143 INFO L290 TraceCheckUtils]: 31: Hoare triple {4063#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4067#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:20:16,159 INFO L290 TraceCheckUtils]: 32: Hoare triple {4067#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3968#false} is VALID [2022-04-27 12:20:16,160 INFO L290 TraceCheckUtils]: 33: Hoare triple {3968#false} assume !false; {3968#false} is VALID [2022-04-27 12:20:16,160 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-27 12:20:16,160 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 12:20:16,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:20:16,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848229161] [2022-04-27 12:20:16,160 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:20:16,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [142625711] [2022-04-27 12:20:16,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [142625711] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:20:16,160 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:20:16,160 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 12:20:16,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740409729] [2022-04-27 12:20:16,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:20:16,161 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-27 12:20:16,161 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:20:16,161 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-27 12:20:16,186 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:20:16,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 12:20:16,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:20:16,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 12:20:16,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 12:20:16,187 INFO L87 Difference]: Start difference. First operand 106 states and 146 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-27 12:20:19,512 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:20:22,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:20:22,734 INFO L93 Difference]: Finished difference Result 128 states and 168 transitions. [2022-04-27 12:20:22,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 12:20:22,734 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-27 12:20:22,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:20:22,734 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-27 12:20:22,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 73 transitions. [2022-04-27 12:20:22,735 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-27 12:20:22,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 73 transitions. [2022-04-27 12:20:22,736 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 73 transitions. [2022-04-27 12:20:22,819 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:20:22,821 INFO L225 Difference]: With dead ends: 128 [2022-04-27 12:20:22,821 INFO L226 Difference]: Without dead ends: 124 [2022-04-27 12:20:22,821 INFO L412 NwaCegarLoop]: 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-27 12:20:22,822 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 8 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-27 12:20:22,822 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 157 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 50 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-04-27 12:20:22,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-04-27 12:20:22,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 121. [2022-04-27 12:20:22,859 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:20:22,859 INFO L82 GeneralOperation]: Start isEquivalent. First operand 124 states. Second operand has 121 states, 70 states have (on average 1.1714285714285715) internal successors, (82), 74 states have internal predecessors, (82), 38 states have call successors, (38), 13 states have call predecessors, (38), 12 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) [2022-04-27 12:20:22,859 INFO L74 IsIncluded]: Start isIncluded. First operand 124 states. Second operand has 121 states, 70 states have (on average 1.1714285714285715) internal successors, (82), 74 states have internal predecessors, (82), 38 states have call successors, (38), 13 states have call predecessors, (38), 12 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) [2022-04-27 12:20:22,860 INFO L87 Difference]: Start difference. First operand 124 states. Second operand has 121 states, 70 states have (on average 1.1714285714285715) internal successors, (82), 74 states have internal predecessors, (82), 38 states have call successors, (38), 13 states have call predecessors, (38), 12 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) [2022-04-27 12:20:22,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:20:22,863 INFO L93 Difference]: Finished difference Result 124 states and 159 transitions. [2022-04-27 12:20:22,863 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 159 transitions. [2022-04-27 12:20:22,863 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:20:22,863 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:20:22,863 INFO L74 IsIncluded]: Start isIncluded. First operand has 121 states, 70 states have (on average 1.1714285714285715) internal successors, (82), 74 states have internal predecessors, (82), 38 states have call successors, (38), 13 states have call predecessors, (38), 12 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) Second operand 124 states. [2022-04-27 12:20:22,864 INFO L87 Difference]: Start difference. First operand has 121 states, 70 states have (on average 1.1714285714285715) internal successors, (82), 74 states have internal predecessors, (82), 38 states have call successors, (38), 13 states have call predecessors, (38), 12 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) Second operand 124 states. [2022-04-27 12:20:22,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:20:22,866 INFO L93 Difference]: Finished difference Result 124 states and 159 transitions. [2022-04-27 12:20:22,866 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 159 transitions. [2022-04-27 12:20:22,866 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:20:22,866 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:20:22,866 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:20:22,867 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:20:22,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 70 states have (on average 1.1714285714285715) internal successors, (82), 74 states have internal predecessors, (82), 38 states have call successors, (38), 13 states have call predecessors, (38), 12 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) [2022-04-27 12:20:22,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 155 transitions. [2022-04-27 12:20:22,869 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 155 transitions. Word has length 34 [2022-04-27 12:20:22,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:20:22,869 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 155 transitions. [2022-04-27 12:20:22,869 INFO L496 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-27 12:20:22,869 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 155 transitions. [2022-04-27 12:20:22,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-27 12:20:22,870 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:20:22,870 INFO L195 NwaCegarLoop]: 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-27 12:20:22,884 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-27 12:20:23,073 WARN L477 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-27 12:20:23,074 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:20:23,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:20:23,074 INFO L85 PathProgramCache]: Analyzing trace with hash 821435566, now seen corresponding path program 1 times [2022-04-27 12:20:23,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:20:23,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199753895] [2022-04-27 12:20:23,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:20:23,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:20:23,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:20:23,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 12:20:23,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:20:23,213 INFO L290 TraceCheckUtils]: 0: Hoare triple {4701#(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; {4691#(<= ~counter~0 0)} is VALID [2022-04-27 12:20:23,214 INFO L290 TraceCheckUtils]: 1: Hoare triple {4691#(<= ~counter~0 0)} assume true; {4691#(<= ~counter~0 0)} is VALID [2022-04-27 12:20:23,214 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4691#(<= ~counter~0 0)} {4686#true} #102#return; {4691#(<= ~counter~0 0)} is VALID [2022-04-27 12:20:23,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 12:20:23,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:20:23,245 INFO L290 TraceCheckUtils]: 0: Hoare triple {4686#true} ~cond := #in~cond; {4686#true} is VALID [2022-04-27 12:20:23,245 INFO L290 TraceCheckUtils]: 1: Hoare triple {4686#true} assume !(0 == ~cond); {4686#true} is VALID [2022-04-27 12:20:23,245 INFO L290 TraceCheckUtils]: 2: Hoare triple {4686#true} assume true; {4686#true} is VALID [2022-04-27 12:20:23,246 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4686#true} {4691#(<= ~counter~0 0)} #82#return; {4691#(<= ~counter~0 0)} is VALID [2022-04-27 12:20:23,246 INFO L272 TraceCheckUtils]: 0: Hoare triple {4686#true} call ULTIMATE.init(); {4701#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 12:20:23,247 INFO L290 TraceCheckUtils]: 1: Hoare triple {4701#(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; {4691#(<= ~counter~0 0)} is VALID [2022-04-27 12:20:23,247 INFO L290 TraceCheckUtils]: 2: Hoare triple {4691#(<= ~counter~0 0)} assume true; {4691#(<= ~counter~0 0)} is VALID [2022-04-27 12:20:23,247 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4691#(<= ~counter~0 0)} {4686#true} #102#return; {4691#(<= ~counter~0 0)} is VALID [2022-04-27 12:20:23,247 INFO L272 TraceCheckUtils]: 4: Hoare triple {4691#(<= ~counter~0 0)} call #t~ret7 := main(); {4691#(<= ~counter~0 0)} is VALID [2022-04-27 12:20:23,248 INFO L290 TraceCheckUtils]: 5: Hoare triple {4691#(<= ~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; {4691#(<= ~counter~0 0)} is VALID [2022-04-27 12:20:23,248 INFO L272 TraceCheckUtils]: 6: Hoare triple {4691#(<= ~counter~0 0)} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {4686#true} is VALID [2022-04-27 12:20:23,248 INFO L290 TraceCheckUtils]: 7: Hoare triple {4686#true} ~cond := #in~cond; {4686#true} is VALID [2022-04-27 12:20:23,248 INFO L290 TraceCheckUtils]: 8: Hoare triple {4686#true} assume !(0 == ~cond); {4686#true} is VALID [2022-04-27 12:20:23,248 INFO L290 TraceCheckUtils]: 9: Hoare triple {4686#true} assume true; {4686#true} is VALID [2022-04-27 12:20:23,248 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4686#true} {4691#(<= ~counter~0 0)} #82#return; {4691#(<= ~counter~0 0)} is VALID [2022-04-27 12:20:23,248 INFO L290 TraceCheckUtils]: 11: Hoare triple {4691#(<= ~counter~0 0)} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {4691#(<= ~counter~0 0)} is VALID [2022-04-27 12:20:23,249 INFO L290 TraceCheckUtils]: 12: Hoare triple {4691#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4696#(<= ~counter~0 1)} is VALID [2022-04-27 12:20:23,249 INFO L290 TraceCheckUtils]: 13: Hoare triple {4696#(<= ~counter~0 1)} assume !!(#t~post5 < 5);havoc #t~post5; {4696#(<= ~counter~0 1)} is VALID [2022-04-27 12:20:23,249 INFO L290 TraceCheckUtils]: 14: Hoare triple {4696#(<= ~counter~0 1)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {4696#(<= ~counter~0 1)} is VALID [2022-04-27 12:20:23,250 INFO L290 TraceCheckUtils]: 15: Hoare triple {4696#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4697#(<= ~counter~0 2)} is VALID [2022-04-27 12:20:23,250 INFO L290 TraceCheckUtils]: 16: Hoare triple {4697#(<= ~counter~0 2)} assume !!(#t~post5 < 5);havoc #t~post5; {4697#(<= ~counter~0 2)} is VALID [2022-04-27 12:20:23,251 INFO L290 TraceCheckUtils]: 17: Hoare triple {4697#(<= ~counter~0 2)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {4697#(<= ~counter~0 2)} is VALID [2022-04-27 12:20:23,251 INFO L290 TraceCheckUtils]: 18: Hoare triple {4697#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4698#(<= ~counter~0 3)} is VALID [2022-04-27 12:20:23,251 INFO L290 TraceCheckUtils]: 19: Hoare triple {4698#(<= ~counter~0 3)} assume !!(#t~post5 < 5);havoc #t~post5; {4698#(<= ~counter~0 3)} is VALID [2022-04-27 12:20:23,251 INFO L290 TraceCheckUtils]: 20: Hoare triple {4698#(<= ~counter~0 3)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {4698#(<= ~counter~0 3)} is VALID [2022-04-27 12:20:23,252 INFO L290 TraceCheckUtils]: 21: Hoare triple {4698#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4699#(<= ~counter~0 4)} is VALID [2022-04-27 12:20:23,252 INFO L290 TraceCheckUtils]: 22: Hoare triple {4699#(<= ~counter~0 4)} assume !!(#t~post5 < 5);havoc #t~post5; {4699#(<= ~counter~0 4)} is VALID [2022-04-27 12:20:23,252 INFO L290 TraceCheckUtils]: 23: Hoare triple {4699#(<= ~counter~0 4)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {4699#(<= ~counter~0 4)} is VALID [2022-04-27 12:20:23,253 INFO L290 TraceCheckUtils]: 24: Hoare triple {4699#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4700#(<= |main_#t~post5| 4)} is VALID [2022-04-27 12:20:23,260 INFO L290 TraceCheckUtils]: 25: Hoare triple {4700#(<= |main_#t~post5| 4)} assume !(#t~post5 < 5);havoc #t~post5; {4687#false} is VALID [2022-04-27 12:20:23,260 INFO L290 TraceCheckUtils]: 26: Hoare triple {4687#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4687#false} is VALID [2022-04-27 12:20:23,261 INFO L290 TraceCheckUtils]: 27: Hoare triple {4687#false} assume !!(#t~post6 < 5);havoc #t~post6; {4687#false} is VALID [2022-04-27 12:20:23,261 INFO L272 TraceCheckUtils]: 28: Hoare triple {4687#false} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {4687#false} is VALID [2022-04-27 12:20:23,261 INFO L290 TraceCheckUtils]: 29: Hoare triple {4687#false} ~cond := #in~cond; {4687#false} is VALID [2022-04-27 12:20:23,261 INFO L290 TraceCheckUtils]: 30: Hoare triple {4687#false} assume 0 == ~cond; {4687#false} is VALID [2022-04-27 12:20:23,262 INFO L290 TraceCheckUtils]: 31: Hoare triple {4687#false} assume !false; {4687#false} is VALID [2022-04-27 12:20:23,262 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-27 12:20:23,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:20:23,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199753895] [2022-04-27 12:20:23,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199753895] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 12:20:23,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1581514601] [2022-04-27 12:20:23,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:20:23,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:20:23,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:20:23,263 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-27 12:20:23,286 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-27 12:20:23,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:20:23,306 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-27 12:20:23,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:20:23,321 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:20:23,490 INFO L272 TraceCheckUtils]: 0: Hoare triple {4686#true} call ULTIMATE.init(); {4686#true} is VALID [2022-04-27 12:20:23,491 INFO L290 TraceCheckUtils]: 1: Hoare triple {4686#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; {4691#(<= ~counter~0 0)} is VALID [2022-04-27 12:20:23,492 INFO L290 TraceCheckUtils]: 2: Hoare triple {4691#(<= ~counter~0 0)} assume true; {4691#(<= ~counter~0 0)} is VALID [2022-04-27 12:20:23,494 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4691#(<= ~counter~0 0)} {4686#true} #102#return; {4691#(<= ~counter~0 0)} is VALID [2022-04-27 12:20:23,494 INFO L272 TraceCheckUtils]: 4: Hoare triple {4691#(<= ~counter~0 0)} call #t~ret7 := main(); {4691#(<= ~counter~0 0)} is VALID [2022-04-27 12:20:23,494 INFO L290 TraceCheckUtils]: 5: Hoare triple {4691#(<= ~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; {4691#(<= ~counter~0 0)} is VALID [2022-04-27 12:20:23,495 INFO L272 TraceCheckUtils]: 6: Hoare triple {4691#(<= ~counter~0 0)} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {4691#(<= ~counter~0 0)} is VALID [2022-04-27 12:20:23,496 INFO L290 TraceCheckUtils]: 7: Hoare triple {4691#(<= ~counter~0 0)} ~cond := #in~cond; {4691#(<= ~counter~0 0)} is VALID [2022-04-27 12:20:23,496 INFO L290 TraceCheckUtils]: 8: Hoare triple {4691#(<= ~counter~0 0)} assume !(0 == ~cond); {4691#(<= ~counter~0 0)} is VALID [2022-04-27 12:20:23,497 INFO L290 TraceCheckUtils]: 9: Hoare triple {4691#(<= ~counter~0 0)} assume true; {4691#(<= ~counter~0 0)} is VALID [2022-04-27 12:20:23,497 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4691#(<= ~counter~0 0)} {4691#(<= ~counter~0 0)} #82#return; {4691#(<= ~counter~0 0)} is VALID [2022-04-27 12:20:23,497 INFO L290 TraceCheckUtils]: 11: Hoare triple {4691#(<= ~counter~0 0)} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {4691#(<= ~counter~0 0)} is VALID [2022-04-27 12:20:23,498 INFO L290 TraceCheckUtils]: 12: Hoare triple {4691#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4696#(<= ~counter~0 1)} is VALID [2022-04-27 12:20:23,498 INFO L290 TraceCheckUtils]: 13: Hoare triple {4696#(<= ~counter~0 1)} assume !!(#t~post5 < 5);havoc #t~post5; {4696#(<= ~counter~0 1)} is VALID [2022-04-27 12:20:23,498 INFO L290 TraceCheckUtils]: 14: Hoare triple {4696#(<= ~counter~0 1)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {4696#(<= ~counter~0 1)} is VALID [2022-04-27 12:20:23,499 INFO L290 TraceCheckUtils]: 15: Hoare triple {4696#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4697#(<= ~counter~0 2)} is VALID [2022-04-27 12:20:23,499 INFO L290 TraceCheckUtils]: 16: Hoare triple {4697#(<= ~counter~0 2)} assume !!(#t~post5 < 5);havoc #t~post5; {4697#(<= ~counter~0 2)} is VALID [2022-04-27 12:20:23,499 INFO L290 TraceCheckUtils]: 17: Hoare triple {4697#(<= ~counter~0 2)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {4697#(<= ~counter~0 2)} is VALID [2022-04-27 12:20:23,500 INFO L290 TraceCheckUtils]: 18: Hoare triple {4697#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4698#(<= ~counter~0 3)} is VALID [2022-04-27 12:20:23,500 INFO L290 TraceCheckUtils]: 19: Hoare triple {4698#(<= ~counter~0 3)} assume !!(#t~post5 < 5);havoc #t~post5; {4698#(<= ~counter~0 3)} is VALID [2022-04-27 12:20:23,500 INFO L290 TraceCheckUtils]: 20: Hoare triple {4698#(<= ~counter~0 3)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {4698#(<= ~counter~0 3)} is VALID [2022-04-27 12:20:23,501 INFO L290 TraceCheckUtils]: 21: Hoare triple {4698#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4699#(<= ~counter~0 4)} is VALID [2022-04-27 12:20:23,501 INFO L290 TraceCheckUtils]: 22: Hoare triple {4699#(<= ~counter~0 4)} assume !!(#t~post5 < 5);havoc #t~post5; {4699#(<= ~counter~0 4)} is VALID [2022-04-27 12:20:23,501 INFO L290 TraceCheckUtils]: 23: Hoare triple {4699#(<= ~counter~0 4)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {4699#(<= ~counter~0 4)} is VALID [2022-04-27 12:20:23,502 INFO L290 TraceCheckUtils]: 24: Hoare triple {4699#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4700#(<= |main_#t~post5| 4)} is VALID [2022-04-27 12:20:23,502 INFO L290 TraceCheckUtils]: 25: Hoare triple {4700#(<= |main_#t~post5| 4)} assume !(#t~post5 < 5);havoc #t~post5; {4687#false} is VALID [2022-04-27 12:20:23,502 INFO L290 TraceCheckUtils]: 26: Hoare triple {4687#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4687#false} is VALID [2022-04-27 12:20:23,502 INFO L290 TraceCheckUtils]: 27: Hoare triple {4687#false} assume !!(#t~post6 < 5);havoc #t~post6; {4687#false} is VALID [2022-04-27 12:20:23,502 INFO L272 TraceCheckUtils]: 28: Hoare triple {4687#false} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {4687#false} is VALID [2022-04-27 12:20:23,502 INFO L290 TraceCheckUtils]: 29: Hoare triple {4687#false} ~cond := #in~cond; {4687#false} is VALID [2022-04-27 12:20:23,502 INFO L290 TraceCheckUtils]: 30: Hoare triple {4687#false} assume 0 == ~cond; {4687#false} is VALID [2022-04-27 12:20:23,502 INFO L290 TraceCheckUtils]: 31: Hoare triple {4687#false} assume !false; {4687#false} is VALID [2022-04-27 12:20:23,503 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-27 12:20:23,503 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:20:23,703 INFO L290 TraceCheckUtils]: 31: Hoare triple {4687#false} assume !false; {4687#false} is VALID [2022-04-27 12:20:23,703 INFO L290 TraceCheckUtils]: 30: Hoare triple {4687#false} assume 0 == ~cond; {4687#false} is VALID [2022-04-27 12:20:23,703 INFO L290 TraceCheckUtils]: 29: Hoare triple {4687#false} ~cond := #in~cond; {4687#false} is VALID [2022-04-27 12:20:23,703 INFO L272 TraceCheckUtils]: 28: Hoare triple {4687#false} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {4687#false} is VALID [2022-04-27 12:20:23,703 INFO L290 TraceCheckUtils]: 27: Hoare triple {4687#false} assume !!(#t~post6 < 5);havoc #t~post6; {4687#false} is VALID [2022-04-27 12:20:23,703 INFO L290 TraceCheckUtils]: 26: Hoare triple {4687#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4687#false} is VALID [2022-04-27 12:20:23,704 INFO L290 TraceCheckUtils]: 25: Hoare triple {4700#(<= |main_#t~post5| 4)} assume !(#t~post5 < 5);havoc #t~post5; {4687#false} is VALID [2022-04-27 12:20:23,707 INFO L290 TraceCheckUtils]: 24: Hoare triple {4699#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4700#(<= |main_#t~post5| 4)} is VALID [2022-04-27 12:20:23,708 INFO L290 TraceCheckUtils]: 23: Hoare triple {4699#(<= ~counter~0 4)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {4699#(<= ~counter~0 4)} is VALID [2022-04-27 12:20:23,708 INFO L290 TraceCheckUtils]: 22: Hoare triple {4699#(<= ~counter~0 4)} assume !!(#t~post5 < 5);havoc #t~post5; {4699#(<= ~counter~0 4)} is VALID [2022-04-27 12:20:23,709 INFO L290 TraceCheckUtils]: 21: Hoare triple {4698#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4699#(<= ~counter~0 4)} is VALID [2022-04-27 12:20:23,709 INFO L290 TraceCheckUtils]: 20: Hoare triple {4698#(<= ~counter~0 3)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {4698#(<= ~counter~0 3)} is VALID [2022-04-27 12:20:23,709 INFO L290 TraceCheckUtils]: 19: Hoare triple {4698#(<= ~counter~0 3)} assume !!(#t~post5 < 5);havoc #t~post5; {4698#(<= ~counter~0 3)} is VALID [2022-04-27 12:20:23,710 INFO L290 TraceCheckUtils]: 18: Hoare triple {4697#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4698#(<= ~counter~0 3)} is VALID [2022-04-27 12:20:23,710 INFO L290 TraceCheckUtils]: 17: Hoare triple {4697#(<= ~counter~0 2)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {4697#(<= ~counter~0 2)} is VALID [2022-04-27 12:20:23,710 INFO L290 TraceCheckUtils]: 16: Hoare triple {4697#(<= ~counter~0 2)} assume !!(#t~post5 < 5);havoc #t~post5; {4697#(<= ~counter~0 2)} is VALID [2022-04-27 12:20:23,711 INFO L290 TraceCheckUtils]: 15: Hoare triple {4696#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4697#(<= ~counter~0 2)} is VALID [2022-04-27 12:20:23,711 INFO L290 TraceCheckUtils]: 14: Hoare triple {4696#(<= ~counter~0 1)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {4696#(<= ~counter~0 1)} is VALID [2022-04-27 12:20:23,711 INFO L290 TraceCheckUtils]: 13: Hoare triple {4696#(<= ~counter~0 1)} assume !!(#t~post5 < 5);havoc #t~post5; {4696#(<= ~counter~0 1)} is VALID [2022-04-27 12:20:23,712 INFO L290 TraceCheckUtils]: 12: Hoare triple {4691#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4696#(<= ~counter~0 1)} is VALID [2022-04-27 12:20:23,712 INFO L290 TraceCheckUtils]: 11: Hoare triple {4691#(<= ~counter~0 0)} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {4691#(<= ~counter~0 0)} is VALID [2022-04-27 12:20:23,713 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4686#true} {4691#(<= ~counter~0 0)} #82#return; {4691#(<= ~counter~0 0)} is VALID [2022-04-27 12:20:23,713 INFO L290 TraceCheckUtils]: 9: Hoare triple {4686#true} assume true; {4686#true} is VALID [2022-04-27 12:20:23,713 INFO L290 TraceCheckUtils]: 8: Hoare triple {4686#true} assume !(0 == ~cond); {4686#true} is VALID [2022-04-27 12:20:23,713 INFO L290 TraceCheckUtils]: 7: Hoare triple {4686#true} ~cond := #in~cond; {4686#true} is VALID [2022-04-27 12:20:23,713 INFO L272 TraceCheckUtils]: 6: Hoare triple {4691#(<= ~counter~0 0)} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {4686#true} is VALID [2022-04-27 12:20:23,713 INFO L290 TraceCheckUtils]: 5: Hoare triple {4691#(<= ~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; {4691#(<= ~counter~0 0)} is VALID [2022-04-27 12:20:23,713 INFO L272 TraceCheckUtils]: 4: Hoare triple {4691#(<= ~counter~0 0)} call #t~ret7 := main(); {4691#(<= ~counter~0 0)} is VALID [2022-04-27 12:20:23,714 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4691#(<= ~counter~0 0)} {4686#true} #102#return; {4691#(<= ~counter~0 0)} is VALID [2022-04-27 12:20:23,714 INFO L290 TraceCheckUtils]: 2: Hoare triple {4691#(<= ~counter~0 0)} assume true; {4691#(<= ~counter~0 0)} is VALID [2022-04-27 12:20:23,715 INFO L290 TraceCheckUtils]: 1: Hoare triple {4686#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; {4691#(<= ~counter~0 0)} is VALID [2022-04-27 12:20:23,715 INFO L272 TraceCheckUtils]: 0: Hoare triple {4686#true} call ULTIMATE.init(); {4686#true} is VALID [2022-04-27 12:20:23,715 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-27 12:20:23,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1581514601] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 12:20:23,715 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 12:20:23,715 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 9 [2022-04-27 12:20:23,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394541387] [2022-04-27 12:20:23,715 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 12:20:23,716 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 8 states have internal predecessors, (30), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 32 [2022-04-27 12:20:23,716 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:20:23,716 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 8 states have internal predecessors, (30), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 12:20:23,742 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-27 12:20:23,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-27 12:20:23,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:20:23,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-27 12:20:23,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-04-27 12:20:23,743 INFO L87 Difference]: Start difference. First operand 121 states and 155 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 8 states have internal predecessors, (30), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 12:20:27,282 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 12:20:32,332 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-27 12:20:38,667 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 12:20:50,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:20:50,377 INFO L93 Difference]: Finished difference Result 194 states and 253 transitions. [2022-04-27 12:20:50,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-27 12:20:50,378 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 8 states have internal predecessors, (30), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 32 [2022-04-27 12:20:50,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:20:50,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 8 states have internal predecessors, (30), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 12:20:50,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 142 transitions. [2022-04-27 12:20:50,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 8 states have internal predecessors, (30), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 12:20:50,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 142 transitions. [2022-04-27 12:20:50,381 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 142 transitions. [2022-04-27 12:20:50,526 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 142 edges. 142 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:20:50,528 INFO L225 Difference]: With dead ends: 194 [2022-04-27 12:20:50,528 INFO L226 Difference]: Without dead ends: 152 [2022-04-27 12:20:50,529 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2022-04-27 12:20:50,529 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 58 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 29 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.2s IncrementalHoareTripleChecker+Time [2022-04-27 12:20:50,529 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 142 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 212 Invalid, 1 Unknown, 0 Unchecked, 18.2s Time] [2022-04-27 12:20:50,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2022-04-27 12:20:50,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 146. [2022-04-27 12:20:50,573 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:20:50,574 INFO L82 GeneralOperation]: Start isEquivalent. First operand 152 states. Second operand has 146 states, 83 states have (on average 1.180722891566265) internal successors, (98), 87 states have internal predecessors, (98), 47 states have call successors, (47), 16 states have call predecessors, (47), 15 states have return successors, (43), 42 states have call predecessors, (43), 43 states have call successors, (43) [2022-04-27 12:20:50,574 INFO L74 IsIncluded]: Start isIncluded. First operand 152 states. Second operand has 146 states, 83 states have (on average 1.180722891566265) internal successors, (98), 87 states have internal predecessors, (98), 47 states have call successors, (47), 16 states have call predecessors, (47), 15 states have return successors, (43), 42 states have call predecessors, (43), 43 states have call successors, (43) [2022-04-27 12:20:50,574 INFO L87 Difference]: Start difference. First operand 152 states. Second operand has 146 states, 83 states have (on average 1.180722891566265) internal successors, (98), 87 states have internal predecessors, (98), 47 states have call successors, (47), 16 states have call predecessors, (47), 15 states have return successors, (43), 42 states have call predecessors, (43), 43 states have call successors, (43) [2022-04-27 12:20:50,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:20:50,593 INFO L93 Difference]: Finished difference Result 152 states and 194 transitions. [2022-04-27 12:20:50,593 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 194 transitions. [2022-04-27 12:20:50,593 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:20:50,593 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:20:50,594 INFO L74 IsIncluded]: Start isIncluded. First operand has 146 states, 83 states have (on average 1.180722891566265) internal successors, (98), 87 states have internal predecessors, (98), 47 states have call successors, (47), 16 states have call predecessors, (47), 15 states have return successors, (43), 42 states have call predecessors, (43), 43 states have call successors, (43) Second operand 152 states. [2022-04-27 12:20:50,594 INFO L87 Difference]: Start difference. First operand has 146 states, 83 states have (on average 1.180722891566265) internal successors, (98), 87 states have internal predecessors, (98), 47 states have call successors, (47), 16 states have call predecessors, (47), 15 states have return successors, (43), 42 states have call predecessors, (43), 43 states have call successors, (43) Second operand 152 states. [2022-04-27 12:20:50,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:20:50,598 INFO L93 Difference]: Finished difference Result 152 states and 194 transitions. [2022-04-27 12:20:50,598 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 194 transitions. [2022-04-27 12:20:50,598 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:20:50,598 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:20:50,598 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:20:50,598 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:20:50,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 83 states have (on average 1.180722891566265) internal successors, (98), 87 states have internal predecessors, (98), 47 states have call successors, (47), 16 states have call predecessors, (47), 15 states have return successors, (43), 42 states have call predecessors, (43), 43 states have call successors, (43) [2022-04-27 12:20:50,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 188 transitions. [2022-04-27 12:20:50,601 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 188 transitions. Word has length 32 [2022-04-27 12:20:50,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:20:50,601 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 188 transitions. [2022-04-27 12:20:50,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 8 states have internal predecessors, (30), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 12:20:50,601 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 188 transitions. [2022-04-27 12:20:50,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-27 12:20:50,603 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:20:50,603 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:20:50,621 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-04-27 12:20:50,815 WARN L477 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-27 12:20:50,815 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:20:50,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:20:50,816 INFO L85 PathProgramCache]: Analyzing trace with hash 1505493762, now seen corresponding path program 2 times [2022-04-27 12:20:50,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:20:50,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541328789] [2022-04-27 12:20:50,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:20:50,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:20:50,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:20:50,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 12:20:50,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:20:50,870 INFO L290 TraceCheckUtils]: 0: Hoare triple {5723#(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; {5711#true} is VALID [2022-04-27 12:20:50,870 INFO L290 TraceCheckUtils]: 1: Hoare triple {5711#true} assume true; {5711#true} is VALID [2022-04-27 12:20:50,870 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5711#true} {5711#true} #102#return; {5711#true} is VALID [2022-04-27 12:20:50,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 12:20:50,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:20:50,874 INFO L290 TraceCheckUtils]: 0: Hoare triple {5711#true} ~cond := #in~cond; {5711#true} is VALID [2022-04-27 12:20:50,875 INFO L290 TraceCheckUtils]: 1: Hoare triple {5711#true} assume !(0 == ~cond); {5711#true} is VALID [2022-04-27 12:20:50,875 INFO L290 TraceCheckUtils]: 2: Hoare triple {5711#true} assume true; {5711#true} is VALID [2022-04-27 12:20:50,875 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5711#true} {5711#true} #82#return; {5711#true} is VALID [2022-04-27 12:20:50,875 INFO L272 TraceCheckUtils]: 0: Hoare triple {5711#true} call ULTIMATE.init(); {5723#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 12:20:50,875 INFO L290 TraceCheckUtils]: 1: Hoare triple {5723#(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; {5711#true} is VALID [2022-04-27 12:20:50,875 INFO L290 TraceCheckUtils]: 2: Hoare triple {5711#true} assume true; {5711#true} is VALID [2022-04-27 12:20:50,876 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5711#true} {5711#true} #102#return; {5711#true} is VALID [2022-04-27 12:20:50,876 INFO L272 TraceCheckUtils]: 4: Hoare triple {5711#true} call #t~ret7 := main(); {5711#true} is VALID [2022-04-27 12:20:50,876 INFO L290 TraceCheckUtils]: 5: Hoare triple {5711#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {5711#true} is VALID [2022-04-27 12:20:50,876 INFO L272 TraceCheckUtils]: 6: Hoare triple {5711#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {5711#true} is VALID [2022-04-27 12:20:50,876 INFO L290 TraceCheckUtils]: 7: Hoare triple {5711#true} ~cond := #in~cond; {5711#true} is VALID [2022-04-27 12:20:50,876 INFO L290 TraceCheckUtils]: 8: Hoare triple {5711#true} assume !(0 == ~cond); {5711#true} is VALID [2022-04-27 12:20:50,876 INFO L290 TraceCheckUtils]: 9: Hoare triple {5711#true} assume true; {5711#true} is VALID [2022-04-27 12:20:50,876 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5711#true} {5711#true} #82#return; {5711#true} is VALID [2022-04-27 12:20:50,876 INFO L290 TraceCheckUtils]: 11: Hoare triple {5711#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {5711#true} is VALID [2022-04-27 12:20:50,876 INFO L290 TraceCheckUtils]: 12: Hoare triple {5711#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5711#true} is VALID [2022-04-27 12:20:50,876 INFO L290 TraceCheckUtils]: 13: Hoare triple {5711#true} assume !!(#t~post5 < 5);havoc #t~post5; {5711#true} is VALID [2022-04-27 12:20:50,876 INFO L290 TraceCheckUtils]: 14: Hoare triple {5711#true} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {5711#true} is VALID [2022-04-27 12:20:50,876 INFO L290 TraceCheckUtils]: 15: Hoare triple {5711#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5711#true} is VALID [2022-04-27 12:20:50,876 INFO L290 TraceCheckUtils]: 16: Hoare triple {5711#true} assume !!(#t~post5 < 5);havoc #t~post5; {5711#true} is VALID [2022-04-27 12:20:50,876 INFO L290 TraceCheckUtils]: 17: Hoare triple {5711#true} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {5711#true} is VALID [2022-04-27 12:20:50,876 INFO L290 TraceCheckUtils]: 18: Hoare triple {5711#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5711#true} is VALID [2022-04-27 12:20:50,876 INFO L290 TraceCheckUtils]: 19: Hoare triple {5711#true} assume !!(#t~post5 < 5);havoc #t~post5; {5711#true} is VALID [2022-04-27 12:20:50,876 INFO L290 TraceCheckUtils]: 20: Hoare triple {5711#true} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {5711#true} is VALID [2022-04-27 12:20:50,876 INFO L290 TraceCheckUtils]: 21: Hoare triple {5711#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5711#true} is VALID [2022-04-27 12:20:50,877 INFO L290 TraceCheckUtils]: 22: Hoare triple {5711#true} assume !!(#t~post5 < 5);havoc #t~post5; {5711#true} is VALID [2022-04-27 12:20:50,877 INFO L290 TraceCheckUtils]: 23: Hoare triple {5711#true} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {5711#true} is VALID [2022-04-27 12:20:50,877 INFO L290 TraceCheckUtils]: 24: Hoare triple {5711#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5711#true} is VALID [2022-04-27 12:20:50,877 INFO L290 TraceCheckUtils]: 25: Hoare triple {5711#true} assume !!(#t~post5 < 5);havoc #t~post5; {5711#true} is VALID [2022-04-27 12:20:50,877 INFO L290 TraceCheckUtils]: 26: Hoare triple {5711#true} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {5711#true} is VALID [2022-04-27 12:20:50,877 INFO L290 TraceCheckUtils]: 27: Hoare triple {5711#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5720#(<= (+ |main_#t~post5| 1) ~counter~0)} is VALID [2022-04-27 12:20:50,878 INFO L290 TraceCheckUtils]: 28: Hoare triple {5720#(<= (+ |main_#t~post5| 1) ~counter~0)} assume !(#t~post5 < 5);havoc #t~post5; {5721#(<= 6 ~counter~0)} is VALID [2022-04-27 12:20:50,878 INFO L290 TraceCheckUtils]: 29: Hoare triple {5721#(<= 6 ~counter~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5722#(<= 6 |main_#t~post6|)} is VALID [2022-04-27 12:20:50,878 INFO L290 TraceCheckUtils]: 30: Hoare triple {5722#(<= 6 |main_#t~post6|)} assume !!(#t~post6 < 5);havoc #t~post6; {5712#false} is VALID [2022-04-27 12:20:50,878 INFO L272 TraceCheckUtils]: 31: Hoare triple {5712#false} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {5712#false} is VALID [2022-04-27 12:20:50,878 INFO L290 TraceCheckUtils]: 32: Hoare triple {5712#false} ~cond := #in~cond; {5712#false} is VALID [2022-04-27 12:20:50,878 INFO L290 TraceCheckUtils]: 33: Hoare triple {5712#false} assume 0 == ~cond; {5712#false} is VALID [2022-04-27 12:20:50,878 INFO L290 TraceCheckUtils]: 34: Hoare triple {5712#false} assume !false; {5712#false} is VALID [2022-04-27 12:20:50,879 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-04-27 12:20:50,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:20:50,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541328789] [2022-04-27 12:20:50,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541328789] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:20:50,879 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:20:50,879 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 12:20:50,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135312949] [2022-04-27 12:20:50,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:20:50,880 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 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 35 [2022-04-27 12:20:50,880 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:20:50,880 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 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-27 12:20:50,892 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-27 12:20:50,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 12:20:50,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:20:50,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 12:20:50,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 12:20:50,893 INFO L87 Difference]: Start difference. First operand 146 states and 188 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 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-27 12:20:57,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:20:57,369 INFO L93 Difference]: Finished difference Result 189 states and 237 transitions. [2022-04-27 12:20:57,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 12:20:57,369 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 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 35 [2022-04-27 12:20:57,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:20:57,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 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-27 12:20:57,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 87 transitions. [2022-04-27 12:20:57,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 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-27 12:20:57,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 87 transitions. [2022-04-27 12:20:57,371 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 87 transitions. [2022-04-27 12:20:57,447 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:20:57,449 INFO L225 Difference]: With dead ends: 189 [2022-04-27 12:20:57,449 INFO L226 Difference]: Without dead ends: 147 [2022-04-27 12:20:57,449 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-27 12:20:57,450 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 19 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-04-27 12:20:57,450 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 105 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2022-04-27 12:20:57,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2022-04-27 12:20:57,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 145. [2022-04-27 12:20:57,513 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:20:57,514 INFO L82 GeneralOperation]: Start isEquivalent. First operand 147 states. Second operand has 145 states, 87 states have (on average 1.1494252873563218) internal successors, (100), 90 states have internal predecessors, (100), 41 states have call successors, (41), 18 states have call predecessors, (41), 16 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-27 12:20:57,514 INFO L74 IsIncluded]: Start isIncluded. First operand 147 states. Second operand has 145 states, 87 states have (on average 1.1494252873563218) internal successors, (100), 90 states have internal predecessors, (100), 41 states have call successors, (41), 18 states have call predecessors, (41), 16 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-27 12:20:57,514 INFO L87 Difference]: Start difference. First operand 147 states. Second operand has 145 states, 87 states have (on average 1.1494252873563218) internal successors, (100), 90 states have internal predecessors, (100), 41 states have call successors, (41), 18 states have call predecessors, (41), 16 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-27 12:20:57,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:20:57,517 INFO L93 Difference]: Finished difference Result 147 states and 179 transitions. [2022-04-27 12:20:57,517 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 179 transitions. [2022-04-27 12:20:57,517 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:20:57,517 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:20:57,517 INFO L74 IsIncluded]: Start isIncluded. First operand has 145 states, 87 states have (on average 1.1494252873563218) internal successors, (100), 90 states have internal predecessors, (100), 41 states have call successors, (41), 18 states have call predecessors, (41), 16 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) Second operand 147 states. [2022-04-27 12:20:57,518 INFO L87 Difference]: Start difference. First operand has 145 states, 87 states have (on average 1.1494252873563218) internal successors, (100), 90 states have internal predecessors, (100), 41 states have call successors, (41), 18 states have call predecessors, (41), 16 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) Second operand 147 states. [2022-04-27 12:20:57,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:20:57,520 INFO L93 Difference]: Finished difference Result 147 states and 179 transitions. [2022-04-27 12:20:57,520 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 179 transitions. [2022-04-27 12:20:57,520 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:20:57,520 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:20:57,520 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:20:57,520 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:20:57,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 87 states have (on average 1.1494252873563218) internal successors, (100), 90 states have internal predecessors, (100), 41 states have call successors, (41), 18 states have call predecessors, (41), 16 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-27 12:20:57,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 178 transitions. [2022-04-27 12:20:57,523 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 178 transitions. Word has length 35 [2022-04-27 12:20:57,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:20:57,523 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 178 transitions. [2022-04-27 12:20:57,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 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-27 12:20:57,523 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 178 transitions. [2022-04-27 12:20:57,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-27 12:20:57,524 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:20:57,524 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:20:57,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-27 12:20:57,524 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:20:57,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:20:57,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1630061645, now seen corresponding path program 1 times [2022-04-27 12:20:57,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:20:57,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017764830] [2022-04-27 12:20:57,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:20:57,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:20:57,533 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:20:57,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [944478978] [2022-04-27 12:20:57,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:20:57,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:20:57,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:20:57,534 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-27 12:20:57,535 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-27 12:20:57,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:20:57,585 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 12:20:57,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:20:57,593 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:20:57,759 INFO L272 TraceCheckUtils]: 0: Hoare triple {6509#true} call ULTIMATE.init(); {6509#true} is VALID [2022-04-27 12:20:57,759 INFO L290 TraceCheckUtils]: 1: Hoare triple {6509#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; {6509#true} is VALID [2022-04-27 12:20:57,759 INFO L290 TraceCheckUtils]: 2: Hoare triple {6509#true} assume true; {6509#true} is VALID [2022-04-27 12:20:57,759 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6509#true} {6509#true} #102#return; {6509#true} is VALID [2022-04-27 12:20:57,760 INFO L272 TraceCheckUtils]: 4: Hoare triple {6509#true} call #t~ret7 := main(); {6509#true} is VALID [2022-04-27 12:20:57,760 INFO L290 TraceCheckUtils]: 5: Hoare triple {6509#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {6509#true} is VALID [2022-04-27 12:20:57,760 INFO L272 TraceCheckUtils]: 6: Hoare triple {6509#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {6509#true} is VALID [2022-04-27 12:20:57,760 INFO L290 TraceCheckUtils]: 7: Hoare triple {6509#true} ~cond := #in~cond; {6509#true} is VALID [2022-04-27 12:20:57,760 INFO L290 TraceCheckUtils]: 8: Hoare triple {6509#true} assume !(0 == ~cond); {6509#true} is VALID [2022-04-27 12:20:57,760 INFO L290 TraceCheckUtils]: 9: Hoare triple {6509#true} assume true; {6509#true} is VALID [2022-04-27 12:20:57,760 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6509#true} {6509#true} #82#return; {6509#true} is VALID [2022-04-27 12:20:57,760 INFO L290 TraceCheckUtils]: 11: Hoare triple {6509#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {6547#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-27 12:20:57,761 INFO L290 TraceCheckUtils]: 12: Hoare triple {6547#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6547#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-27 12:20:57,761 INFO L290 TraceCheckUtils]: 13: Hoare triple {6547#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} assume !!(#t~post5 < 5);havoc #t~post5; {6547#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-27 12:20:57,761 INFO L290 TraceCheckUtils]: 14: Hoare triple {6547#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {6547#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-27 12:20:57,762 INFO L290 TraceCheckUtils]: 15: Hoare triple {6547#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6547#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-27 12:20:57,762 INFO L290 TraceCheckUtils]: 16: Hoare triple {6547#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} assume !!(#t~post5 < 5);havoc #t~post5; {6547#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-27 12:20:57,762 INFO L290 TraceCheckUtils]: 17: Hoare triple {6547#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {6547#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-27 12:20:57,763 INFO L290 TraceCheckUtils]: 18: Hoare triple {6547#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6547#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-27 12:20:57,763 INFO L290 TraceCheckUtils]: 19: Hoare triple {6547#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} assume !!(#t~post5 < 5);havoc #t~post5; {6547#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-27 12:20:57,763 INFO L290 TraceCheckUtils]: 20: Hoare triple {6547#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {6547#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-27 12:20:57,764 INFO L290 TraceCheckUtils]: 21: Hoare triple {6547#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6547#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-27 12:20:57,764 INFO L290 TraceCheckUtils]: 22: Hoare triple {6547#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} assume !!(#t~post5 < 5);havoc #t~post5; {6547#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-27 12:20:57,764 INFO L290 TraceCheckUtils]: 23: Hoare triple {6547#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {6547#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-27 12:20:57,765 INFO L290 TraceCheckUtils]: 24: Hoare triple {6547#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6547#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-27 12:20:57,765 INFO L290 TraceCheckUtils]: 25: Hoare triple {6547#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} assume !!(#t~post5 < 5);havoc #t~post5; {6547#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-27 12:20:57,765 INFO L290 TraceCheckUtils]: 26: Hoare triple {6547#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {6547#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-27 12:20:57,766 INFO L290 TraceCheckUtils]: 27: Hoare triple {6547#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6547#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-27 12:20:57,766 INFO L290 TraceCheckUtils]: 28: Hoare triple {6547#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} assume !(#t~post5 < 5);havoc #t~post5; {6547#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-27 12:20:57,766 INFO L290 TraceCheckUtils]: 29: Hoare triple {6547#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6547#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-27 12:20:57,767 INFO L290 TraceCheckUtils]: 30: Hoare triple {6547#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} assume !(#t~post6 < 5);havoc #t~post6; {6547#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-27 12:20:57,767 INFO L272 TraceCheckUtils]: 31: Hoare triple {6547#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} 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)); {6509#true} is VALID [2022-04-27 12:20:57,767 INFO L290 TraceCheckUtils]: 32: Hoare triple {6509#true} ~cond := #in~cond; {6509#true} is VALID [2022-04-27 12:20:57,767 INFO L290 TraceCheckUtils]: 33: Hoare triple {6509#true} assume !(0 == ~cond); {6509#true} is VALID [2022-04-27 12:20:57,767 INFO L290 TraceCheckUtils]: 34: Hoare triple {6509#true} assume true; {6509#true} is VALID [2022-04-27 12:20:57,767 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {6509#true} {6547#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} #96#return; {6547#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-27 12:20:57,768 INFO L272 TraceCheckUtils]: 36: Hoare triple {6547#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} call __VERIFIER_assert((if 0 == (~p~0 * ~p~0 - ~n~0 + ~r~0) % 4294967296 then 1 else 0)); {6623#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:20:57,768 INFO L290 TraceCheckUtils]: 37: Hoare triple {6623#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6627#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:20:57,768 INFO L290 TraceCheckUtils]: 38: Hoare triple {6627#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6510#false} is VALID [2022-04-27 12:20:57,769 INFO L290 TraceCheckUtils]: 39: Hoare triple {6510#false} assume !false; {6510#false} is VALID [2022-04-27 12:20:57,769 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-27 12:20:57,769 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 12:20:57,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:20:57,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017764830] [2022-04-27 12:20:57,769 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:20:57,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [944478978] [2022-04-27 12:20:57,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [944478978] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:20:57,769 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:20:57,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 12:20:57,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816702156] [2022-04-27 12:20:57,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:20:57,770 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 40 [2022-04-27 12:20:57,770 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:20:57,770 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 12:20:57,792 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:20:57,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 12:20:57,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:20:57,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 12:20:57,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 12:20:57,793 INFO L87 Difference]: Start difference. First operand 145 states and 178 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 12:21:00,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:21:00,556 INFO L93 Difference]: Finished difference Result 196 states and 245 transitions. [2022-04-27 12:21:00,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 12:21:00,556 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 40 [2022-04-27 12:21:00,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:21:00,556 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 12:21:00,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 75 transitions. [2022-04-27 12:21:00,557 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 12:21:00,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 75 transitions. [2022-04-27 12:21:00,558 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 75 transitions. [2022-04-27 12:21:00,776 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:21:00,779 INFO L225 Difference]: With dead ends: 196 [2022-04-27 12:21:00,779 INFO L226 Difference]: Without dead ends: 180 [2022-04-27 12:21:00,779 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 12:21:00,779 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 9 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-27 12:21:00,779 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 138 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-27 12:21:00,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2022-04-27 12:21:00,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 175. [2022-04-27 12:21:00,844 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:21:00,844 INFO L82 GeneralOperation]: Start isEquivalent. First operand 180 states. Second operand has 175 states, 100 states have (on average 1.15) internal successors, (115), 105 states have internal predecessors, (115), 53 states have call successors, (53), 22 states have call predecessors, (53), 21 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2022-04-27 12:21:00,844 INFO L74 IsIncluded]: Start isIncluded. First operand 180 states. Second operand has 175 states, 100 states have (on average 1.15) internal successors, (115), 105 states have internal predecessors, (115), 53 states have call successors, (53), 22 states have call predecessors, (53), 21 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2022-04-27 12:21:00,844 INFO L87 Difference]: Start difference. First operand 180 states. Second operand has 175 states, 100 states have (on average 1.15) internal successors, (115), 105 states have internal predecessors, (115), 53 states have call successors, (53), 22 states have call predecessors, (53), 21 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2022-04-27 12:21:00,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:21:00,847 INFO L93 Difference]: Finished difference Result 180 states and 222 transitions. [2022-04-27 12:21:00,847 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 222 transitions. [2022-04-27 12:21:00,848 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:21:00,848 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:21:00,848 INFO L74 IsIncluded]: Start isIncluded. First operand has 175 states, 100 states have (on average 1.15) internal successors, (115), 105 states have internal predecessors, (115), 53 states have call successors, (53), 22 states have call predecessors, (53), 21 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) Second operand 180 states. [2022-04-27 12:21:00,848 INFO L87 Difference]: Start difference. First operand has 175 states, 100 states have (on average 1.15) internal successors, (115), 105 states have internal predecessors, (115), 53 states have call successors, (53), 22 states have call predecessors, (53), 21 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) Second operand 180 states. [2022-04-27 12:21:00,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:21:00,851 INFO L93 Difference]: Finished difference Result 180 states and 222 transitions. [2022-04-27 12:21:00,851 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 222 transitions. [2022-04-27 12:21:00,852 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:21:00,852 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:21:00,852 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:21:00,852 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:21:00,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 100 states have (on average 1.15) internal successors, (115), 105 states have internal predecessors, (115), 53 states have call successors, (53), 22 states have call predecessors, (53), 21 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2022-04-27 12:21:00,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 216 transitions. [2022-04-27 12:21:00,855 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 216 transitions. Word has length 40 [2022-04-27 12:21:00,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:21:00,855 INFO L495 AbstractCegarLoop]: Abstraction has 175 states and 216 transitions. [2022-04-27 12:21:00,855 INFO L496 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 12:21:00,855 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 216 transitions. [2022-04-27 12:21:00,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-04-27 12:21:00,856 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:21:00,856 INFO L195 NwaCegarLoop]: 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-27 12:21:00,875 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-27 12:21:01,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:21:01,071 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:21:01,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:21:01,072 INFO L85 PathProgramCache]: Analyzing trace with hash 109392637, now seen corresponding path program 1 times [2022-04-27 12:21:01,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:21:01,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417254015] [2022-04-27 12:21:01,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:21:01,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:21:01,090 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:21:01,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1738938103] [2022-04-27 12:21:01,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:21:01,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:21:01,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:21:01,091 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-27 12:21:01,097 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process