/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/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_unwindbound50.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 04:52:19,572 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 04:52:19,574 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 04:52:19,608 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 04:52:19,609 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 04:52:19,610 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 04:52:19,612 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 04:52:19,614 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 04:52:19,615 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 04:52:19,618 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 04:52:19,619 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 04:52:19,620 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 04:52:19,620 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 04:52:19,621 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 04:52:19,622 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 04:52:19,624 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 04:52:19,625 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 04:52:19,625 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 04:52:19,627 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 04:52:19,630 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 04:52:19,632 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 04:52:19,633 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 04:52:19,633 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 04:52:19,634 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 04:52:19,635 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 04:52:19,639 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 04:52:19,639 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 04:52:19,640 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 04:52:19,640 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 04:52:19,640 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 04:52:19,641 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 04:52:19,641 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 04:52:19,642 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 04:52:19,643 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 04:52:19,643 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 04:52:19,644 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 04:52:19,644 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 04:52:19,644 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 04:52:19,644 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 04:52:19,644 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 04:52:19,645 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 04:52:19,646 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 04:52:19,646 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-28 04:52:19,654 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 04:52:19,655 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 04:52:19,656 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 04:52:19,656 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 04:52:19,656 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 04:52:19,656 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 04:52:19,656 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 04:52:19,656 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 04:52:19,656 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 04:52:19,657 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 04:52:19,657 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 04:52:19,657 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 04:52:19,657 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 04:52:19,657 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 04:52:19,658 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 04:52:19,658 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 04:52:19,658 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 04:52:19,658 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 04:52:19,658 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 04:52:19,658 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 04:52:19,658 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 04:52:19,658 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 04:52:19,658 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 04:52:19,658 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 04:52:19,658 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 04:52:19,659 INFO L138 SettingsManager]: * Use separate solver for trace checks=false 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-28 04:52:19,837 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 04:52:19,859 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 04:52:19,860 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 04:52:19,861 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 04:52:19,862 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 04:52:19,863 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_unwindbound50.c [2022-04-28 04:52:19,904 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d335d171/95c4644813cc45798d7bb84e15cd6ad8/FLAG6d6c15ea2 [2022-04-28 04:52:20,282 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 04:52:20,282 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_unwindbound50.c [2022-04-28 04:52:20,288 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d335d171/95c4644813cc45798d7bb84e15cd6ad8/FLAG6d6c15ea2 [2022-04-28 04:52:20,299 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d335d171/95c4644813cc45798d7bb84e15cd6ad8 [2022-04-28 04:52:20,300 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 04:52:20,301 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 04:52:20,303 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 04:52:20,303 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 04:52:20,306 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 04:52:20,307 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 04:52:20" (1/1) ... [2022-04-28 04:52:20,307 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35e706d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:52:20, skipping insertion in model container [2022-04-28 04:52:20,307 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 04:52:20" (1/1) ... [2022-04-28 04:52:20,312 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 04:52:20,324 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 04:52:20,449 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_unwindbound50.c[525,538] [2022-04-28 04:52:20,489 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 04:52:20,494 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 04:52:20,501 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_unwindbound50.c[525,538] [2022-04-28 04:52:20,510 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 04:52:20,532 INFO L208 MainTranslator]: Completed translation [2022-04-28 04:52:20,533 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:52:20 WrapperNode [2022-04-28 04:52:20,533 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 04:52:20,533 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 04:52:20,533 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 04:52:20,533 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 04:52:20,541 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:52:20" (1/1) ... [2022-04-28 04:52:20,542 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:52:20" (1/1) ... [2022-04-28 04:52:20,547 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:52:20" (1/1) ... [2022-04-28 04:52:20,547 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:52:20" (1/1) ... [2022-04-28 04:52:20,559 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:52:20" (1/1) ... [2022-04-28 04:52:20,562 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:52:20" (1/1) ... [2022-04-28 04:52:20,563 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:52:20" (1/1) ... [2022-04-28 04:52:20,564 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 04:52:20,564 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 04:52:20,564 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 04:52:20,564 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 04:52:20,566 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:52:20" (1/1) ... [2022-04-28 04:52:20,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 04:52:20,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:52:20,587 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-28 04:52:20,608 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-28 04:52:20,614 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 04:52:20,614 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 04:52:20,614 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 04:52:20,614 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 04:52:20,615 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 04:52:20,615 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 04:52:20,615 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 04:52:20,615 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 04:52:20,615 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 04:52:20,615 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 04:52:20,615 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-28 04:52:20,615 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 04:52:20,615 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 04:52:20,615 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 04:52:20,615 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 04:52:20,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 04:52:20,615 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 04:52:20,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 04:52:20,616 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 04:52:20,616 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 04:52:20,655 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 04:52:20,656 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 04:52:20,832 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 04:52:20,836 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 04:52:20,836 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-28 04:52:20,837 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 04:52:20 BoogieIcfgContainer [2022-04-28 04:52:20,837 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 04:52:20,838 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 04:52:20,838 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 04:52:20,852 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 04:52:20,852 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 04:52:20" (1/3) ... [2022-04-28 04:52:20,852 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ac8b11c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 04:52:20, skipping insertion in model container [2022-04-28 04:52:20,852 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:52:20" (2/3) ... [2022-04-28 04:52:20,853 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ac8b11c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 04:52:20, skipping insertion in model container [2022-04-28 04:52:20,853 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 04:52:20" (3/3) ... [2022-04-28 04:52:20,853 INFO L111 eAbstractionObserver]: Analyzing ICFG dijkstra-u_unwindbound50.c [2022-04-28 04:52:20,862 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 04:52:20,862 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 04:52:20,895 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 04:52:20,899 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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@7a275c78, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6dae20c2 [2022-04-28 04:52:20,899 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 04:52:20,904 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-28 04:52:20,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-28 04:52:20,908 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:52:20,908 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-28 04:52:20,909 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:52:20,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:52:20,912 INFO L85 PathProgramCache]: Analyzing trace with hash -2024343623, now seen corresponding path program 1 times [2022-04-28 04:52:20,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:52:20,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1072203099] [2022-04-28 04:52:20,926 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 04:52:20,926 INFO L85 PathProgramCache]: Analyzing trace with hash -2024343623, now seen corresponding path program 2 times [2022-04-28 04:52:20,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:52:20,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137978124] [2022-04-28 04:52:20,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:52:20,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:52:20,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:52:21,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:52:21,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:52:21,035 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-28 04:52:21,035 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} assume true; {42#true} is VALID [2022-04-28 04:52:21,035 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {42#true} {42#true} #102#return; {42#true} is VALID [2022-04-28 04:52:21,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 04:52:21,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:52:21,041 INFO L290 TraceCheckUtils]: 0: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-28 04:52:21,042 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-28 04:52:21,042 INFO L290 TraceCheckUtils]: 2: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-28 04:52:21,042 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43#false} {42#true} #82#return; {43#false} is VALID [2022-04-28 04:52:21,043 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-28 04:52:21,043 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-28 04:52:21,043 INFO L290 TraceCheckUtils]: 2: Hoare triple {42#true} assume true; {42#true} is VALID [2022-04-28 04:52:21,043 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42#true} {42#true} #102#return; {42#true} is VALID [2022-04-28 04:52:21,044 INFO L272 TraceCheckUtils]: 4: Hoare triple {42#true} call #t~ret7 := main(); {42#true} is VALID [2022-04-28 04:52:21,044 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-28 04:52:21,044 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-28 04:52:21,044 INFO L290 TraceCheckUtils]: 7: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-28 04:52:21,045 INFO L290 TraceCheckUtils]: 8: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-28 04:52:21,045 INFO L290 TraceCheckUtils]: 9: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-28 04:52:21,045 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {43#false} {42#true} #82#return; {43#false} is VALID [2022-04-28 04:52:21,046 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-28 04:52:21,046 INFO L290 TraceCheckUtils]: 12: Hoare triple {43#false} assume !true; {43#false} is VALID [2022-04-28 04:52:21,047 INFO L290 TraceCheckUtils]: 13: Hoare triple {43#false} assume !true; {43#false} is VALID [2022-04-28 04:52:21,047 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-28 04:52:21,047 INFO L290 TraceCheckUtils]: 15: Hoare triple {43#false} ~cond := #in~cond; {43#false} is VALID [2022-04-28 04:52:21,047 INFO L290 TraceCheckUtils]: 16: Hoare triple {43#false} assume 0 == ~cond; {43#false} is VALID [2022-04-28 04:52:21,047 INFO L290 TraceCheckUtils]: 17: Hoare triple {43#false} assume !false; {43#false} is VALID [2022-04-28 04:52:21,048 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-28 04:52:21,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:52:21,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137978124] [2022-04-28 04:52:21,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137978124] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:52:21,049 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:52:21,049 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 04:52:21,051 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:52:21,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1072203099] [2022-04-28 04:52:21,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1072203099] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:52:21,051 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:52:21,051 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 04:52:21,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061566141] [2022-04-28 04:52:21,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:52:21,056 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-28 04:52:21,056 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:52:21,058 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-28 04:52:21,088 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-28 04:52:21,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 04:52:21,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:52:21,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 04:52:21,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 04:52:21,108 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-28 04:52:27,424 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-28 04:52:27,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:52:27,526 INFO L93 Difference]: Finished difference Result 70 states and 111 transitions. [2022-04-28 04:52:27,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 04:52:27,527 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-28 04:52:27,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:52:27,544 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-28 04:52:27,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2022-04-28 04:52:27,557 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-28 04:52:27,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2022-04-28 04:52:27,561 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 111 transitions. [2022-04-28 04:52:27,666 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-28 04:52:27,677 INFO L225 Difference]: With dead ends: 70 [2022-04-28 04:52:27,677 INFO L226 Difference]: Without dead ends: 35 [2022-04-28 04:52:27,679 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-28 04:52:27,682 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 11 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-28 04:52:27,683 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.2s Time] [2022-04-28 04:52:27,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-28 04:52:27,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2022-04-28 04:52:27,705 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:52:27,706 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-28 04:52:27,706 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-28 04:52:27,707 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-28 04:52:27,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:52:27,715 INFO L93 Difference]: Finished difference Result 35 states and 47 transitions. [2022-04-28 04:52:27,716 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 47 transitions. [2022-04-28 04:52:27,719 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:52:27,720 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:52:27,720 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-28 04:52:27,720 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-28 04:52:27,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:52:27,723 INFO L93 Difference]: Finished difference Result 35 states and 47 transitions. [2022-04-28 04:52:27,723 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 47 transitions. [2022-04-28 04:52:27,724 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:52:27,724 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:52:27,724 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:52:27,724 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:52:27,724 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-28 04:52:27,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 46 transitions. [2022-04-28 04:52:27,727 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 46 transitions. Word has length 18 [2022-04-28 04:52:27,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:52:27,727 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 46 transitions. [2022-04-28 04:52:27,728 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-28 04:52:27,728 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 46 transitions. [2022-04-28 04:52:27,766 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:52:27,767 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 46 transitions. [2022-04-28 04:52:27,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-28 04:52:27,767 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:52:27,767 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-28 04:52:27,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 04:52:27,768 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:52:27,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:52:27,768 INFO L85 PathProgramCache]: Analyzing trace with hash -96361696, now seen corresponding path program 1 times [2022-04-28 04:52:27,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:52:27,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1638168978] [2022-04-28 04:52:27,769 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 04:52:27,769 INFO L85 PathProgramCache]: Analyzing trace with hash -96361696, now seen corresponding path program 2 times [2022-04-28 04:52:27,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:52:27,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840084824] [2022-04-28 04:52:27,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:52:27,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:52:27,782 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 04:52:27,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [642965823] [2022-04-28 04:52:27,783 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 04:52:27,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:52:27,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:52:27,784 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-28 04:52:27,790 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-28 04:52:27,828 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 04:52:27,828 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:52:27,829 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-28 04:52:27,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:52:27,843 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:52:28,007 INFO L272 TraceCheckUtils]: 0: Hoare triple {332#true} call ULTIMATE.init(); {332#true} is VALID [2022-04-28 04:52:28,008 INFO L290 TraceCheckUtils]: 1: Hoare triple {332#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; {340#(<= ~counter~0 0)} is VALID [2022-04-28 04:52:28,009 INFO L290 TraceCheckUtils]: 2: Hoare triple {340#(<= ~counter~0 0)} assume true; {340#(<= ~counter~0 0)} is VALID [2022-04-28 04:52:28,009 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {340#(<= ~counter~0 0)} {332#true} #102#return; {340#(<= ~counter~0 0)} is VALID [2022-04-28 04:52:28,010 INFO L272 TraceCheckUtils]: 4: Hoare triple {340#(<= ~counter~0 0)} call #t~ret7 := main(); {340#(<= ~counter~0 0)} is VALID [2022-04-28 04:52:28,010 INFO L290 TraceCheckUtils]: 5: Hoare triple {340#(<= ~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; {340#(<= ~counter~0 0)} is VALID [2022-04-28 04:52:28,010 INFO L272 TraceCheckUtils]: 6: Hoare triple {340#(<= ~counter~0 0)} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {340#(<= ~counter~0 0)} is VALID [2022-04-28 04:52:28,011 INFO L290 TraceCheckUtils]: 7: Hoare triple {340#(<= ~counter~0 0)} ~cond := #in~cond; {340#(<= ~counter~0 0)} is VALID [2022-04-28 04:52:28,011 INFO L290 TraceCheckUtils]: 8: Hoare triple {340#(<= ~counter~0 0)} assume !(0 == ~cond); {340#(<= ~counter~0 0)} is VALID [2022-04-28 04:52:28,012 INFO L290 TraceCheckUtils]: 9: Hoare triple {340#(<= ~counter~0 0)} assume true; {340#(<= ~counter~0 0)} is VALID [2022-04-28 04:52:28,012 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {340#(<= ~counter~0 0)} {340#(<= ~counter~0 0)} #82#return; {340#(<= ~counter~0 0)} is VALID [2022-04-28 04:52:28,013 INFO L290 TraceCheckUtils]: 11: Hoare triple {340#(<= ~counter~0 0)} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {340#(<= ~counter~0 0)} is VALID [2022-04-28 04:52:28,014 INFO L290 TraceCheckUtils]: 12: Hoare triple {340#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {374#(<= |main_#t~post5| 0)} is VALID [2022-04-28 04:52:28,014 INFO L290 TraceCheckUtils]: 13: Hoare triple {374#(<= |main_#t~post5| 0)} assume !(#t~post5 < 50);havoc #t~post5; {333#false} is VALID [2022-04-28 04:52:28,014 INFO L290 TraceCheckUtils]: 14: Hoare triple {333#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {333#false} is VALID [2022-04-28 04:52:28,014 INFO L290 TraceCheckUtils]: 15: Hoare triple {333#false} assume !(#t~post6 < 50);havoc #t~post6; {333#false} is VALID [2022-04-28 04:52:28,015 INFO L272 TraceCheckUtils]: 16: Hoare triple {333#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)); {333#false} is VALID [2022-04-28 04:52:28,015 INFO L290 TraceCheckUtils]: 17: Hoare triple {333#false} ~cond := #in~cond; {333#false} is VALID [2022-04-28 04:52:28,015 INFO L290 TraceCheckUtils]: 18: Hoare triple {333#false} assume 0 == ~cond; {333#false} is VALID [2022-04-28 04:52:28,016 INFO L290 TraceCheckUtils]: 19: Hoare triple {333#false} assume !false; {333#false} is VALID [2022-04-28 04:52:28,016 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-28 04:52:28,016 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 04:52:28,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:52:28,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840084824] [2022-04-28 04:52:28,018 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 04:52:28,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [642965823] [2022-04-28 04:52:28,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [642965823] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:52:28,018 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:52:28,018 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:52:28,019 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:52:28,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1638168978] [2022-04-28 04:52:28,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1638168978] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:52:28,019 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:52:28,019 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:52:28,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995683642] [2022-04-28 04:52:28,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:52:28,021 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-28 04:52:28,021 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:52:28,021 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-28 04:52:28,035 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-28 04:52:28,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 04:52:28,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:52:28,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 04:52:28,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 04:52:28,037 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-28 04:52:35,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:52:35,242 INFO L93 Difference]: Finished difference Result 55 states and 78 transitions. [2022-04-28 04:52:35,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 04:52:35,243 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-28 04:52:35,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:52:35,245 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-28 04:52:35,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2022-04-28 04:52:35,248 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-28 04:52:35,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2022-04-28 04:52:35,250 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 78 transitions. [2022-04-28 04:52:35,342 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-28 04:52:35,344 INFO L225 Difference]: With dead ends: 55 [2022-04-28 04:52:35,344 INFO L226 Difference]: Without dead ends: 36 [2022-04-28 04:52:35,346 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-28 04:52:35,350 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-28 04:52:35,351 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-28 04:52:35,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-28 04:52:35,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-04-28 04:52:35,392 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:52:35,392 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-28 04:52:35,392 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-28 04:52:35,393 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-28 04:52:35,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:52:35,395 INFO L93 Difference]: Finished difference Result 36 states and 48 transitions. [2022-04-28 04:52:35,395 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 48 transitions. [2022-04-28 04:52:35,395 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:52:35,396 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:52:35,396 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-28 04:52:35,396 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-28 04:52:35,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:52:35,398 INFO L93 Difference]: Finished difference Result 36 states and 48 transitions. [2022-04-28 04:52:35,398 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 48 transitions. [2022-04-28 04:52:35,399 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:52:35,399 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:52:35,399 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:52:35,399 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:52:35,400 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-28 04:52:35,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 48 transitions. [2022-04-28 04:52:35,401 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 48 transitions. Word has length 20 [2022-04-28 04:52:35,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:52:35,402 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 48 transitions. [2022-04-28 04:52:35,402 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-28 04:52:35,402 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 48 transitions. [2022-04-28 04:52:35,441 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:52:35,441 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 48 transitions. [2022-04-28 04:52:35,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-28 04:52:35,442 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:52:35,442 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-28 04:52:35,490 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-28 04:52:35,652 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-28 04:52:35,652 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:52:35,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:52:35,653 INFO L85 PathProgramCache]: Analyzing trace with hash 962099791, now seen corresponding path program 1 times [2022-04-28 04:52:35,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:52:35,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [467964403] [2022-04-28 04:52:35,653 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 04:52:35,653 INFO L85 PathProgramCache]: Analyzing trace with hash 962099791, now seen corresponding path program 2 times [2022-04-28 04:52:35,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:52:35,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075287665] [2022-04-28 04:52:35,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:52:35,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:52:35,666 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 04:52:35,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2141833739] [2022-04-28 04:52:35,666 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 04:52:35,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:52:35,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:52:35,667 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-28 04:52:35,668 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-28 04:52:35,699 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 04:52:35,700 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:52:35,701 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 04:52:35,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:52:35,707 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:52:35,810 INFO L272 TraceCheckUtils]: 0: Hoare triple {649#true} call ULTIMATE.init(); {649#true} is VALID [2022-04-28 04:52:35,810 INFO L290 TraceCheckUtils]: 1: Hoare triple {649#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; {657#(<= ~counter~0 0)} is VALID [2022-04-28 04:52:35,811 INFO L290 TraceCheckUtils]: 2: Hoare triple {657#(<= ~counter~0 0)} assume true; {657#(<= ~counter~0 0)} is VALID [2022-04-28 04:52:35,811 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {657#(<= ~counter~0 0)} {649#true} #102#return; {657#(<= ~counter~0 0)} is VALID [2022-04-28 04:52:35,812 INFO L272 TraceCheckUtils]: 4: Hoare triple {657#(<= ~counter~0 0)} call #t~ret7 := main(); {657#(<= ~counter~0 0)} is VALID [2022-04-28 04:52:35,815 INFO L290 TraceCheckUtils]: 5: Hoare triple {657#(<= ~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; {657#(<= ~counter~0 0)} is VALID [2022-04-28 04:52:35,815 INFO L272 TraceCheckUtils]: 6: Hoare triple {657#(<= ~counter~0 0)} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {657#(<= ~counter~0 0)} is VALID [2022-04-28 04:52:35,816 INFO L290 TraceCheckUtils]: 7: Hoare triple {657#(<= ~counter~0 0)} ~cond := #in~cond; {657#(<= ~counter~0 0)} is VALID [2022-04-28 04:52:35,816 INFO L290 TraceCheckUtils]: 8: Hoare triple {657#(<= ~counter~0 0)} assume !(0 == ~cond); {657#(<= ~counter~0 0)} is VALID [2022-04-28 04:52:35,816 INFO L290 TraceCheckUtils]: 9: Hoare triple {657#(<= ~counter~0 0)} assume true; {657#(<= ~counter~0 0)} is VALID [2022-04-28 04:52:35,817 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {657#(<= ~counter~0 0)} {657#(<= ~counter~0 0)} #82#return; {657#(<= ~counter~0 0)} is VALID [2022-04-28 04:52:35,819 INFO L290 TraceCheckUtils]: 11: Hoare triple {657#(<= ~counter~0 0)} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {657#(<= ~counter~0 0)} is VALID [2022-04-28 04:52:35,819 INFO L290 TraceCheckUtils]: 12: Hoare triple {657#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {691#(<= ~counter~0 1)} is VALID [2022-04-28 04:52:35,820 INFO L290 TraceCheckUtils]: 13: Hoare triple {691#(<= ~counter~0 1)} assume !!(#t~post5 < 50);havoc #t~post5; {691#(<= ~counter~0 1)} is VALID [2022-04-28 04:52:35,820 INFO L290 TraceCheckUtils]: 14: Hoare triple {691#(<= ~counter~0 1)} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {691#(<= ~counter~0 1)} is VALID [2022-04-28 04:52:35,820 INFO L290 TraceCheckUtils]: 15: Hoare triple {691#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {701#(<= |main_#t~post6| 1)} is VALID [2022-04-28 04:52:35,821 INFO L290 TraceCheckUtils]: 16: Hoare triple {701#(<= |main_#t~post6| 1)} assume !(#t~post6 < 50);havoc #t~post6; {650#false} is VALID [2022-04-28 04:52:35,821 INFO L272 TraceCheckUtils]: 17: Hoare triple {650#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)); {650#false} is VALID [2022-04-28 04:52:35,821 INFO L290 TraceCheckUtils]: 18: Hoare triple {650#false} ~cond := #in~cond; {650#false} is VALID [2022-04-28 04:52:35,821 INFO L290 TraceCheckUtils]: 19: Hoare triple {650#false} assume 0 == ~cond; {650#false} is VALID [2022-04-28 04:52:35,821 INFO L290 TraceCheckUtils]: 20: Hoare triple {650#false} assume !false; {650#false} is VALID [2022-04-28 04:52:35,822 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-28 04:52:35,822 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 04:52:35,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:52:35,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075287665] [2022-04-28 04:52:35,822 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 04:52:35,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2141833739] [2022-04-28 04:52:35,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2141833739] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:52:35,822 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:52:35,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 04:52:35,823 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:52:35,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [467964403] [2022-04-28 04:52:35,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [467964403] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:52:35,823 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:52:35,823 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 04:52:35,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838906606] [2022-04-28 04:52:35,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:52:35,824 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-28 04:52:35,824 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:52:35,824 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-28 04:52:35,843 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-28 04:52:35,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 04:52:35,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:52:35,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 04:52:35,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-28 04:52:35,844 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-28 04:52:41,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:52:41,136 INFO L93 Difference]: Finished difference Result 49 states and 64 transitions. [2022-04-28 04:52:41,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 04:52:41,136 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-28 04:52:41,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:52:41,136 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-28 04:52:41,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-28 04:52:41,138 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-28 04:52:41,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-28 04:52:41,139 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 64 transitions. [2022-04-28 04:52:41,196 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-28 04:52:41,197 INFO L225 Difference]: With dead ends: 49 [2022-04-28 04:52:41,197 INFO L226 Difference]: Without dead ends: 40 [2022-04-28 04:52:41,197 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-28 04:52:41,198 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 7 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 04:52:41,198 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 149 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 04:52:41,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-28 04:52:41,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2022-04-28 04:52:41,214 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:52:41,214 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-28 04:52:41,215 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-28 04:52:41,215 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-28 04:52:41,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:52:41,217 INFO L93 Difference]: Finished difference Result 40 states and 53 transitions. [2022-04-28 04:52:41,217 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 53 transitions. [2022-04-28 04:52:41,218 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:52:41,218 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:52:41,218 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-28 04:52:41,218 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-28 04:52:41,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:52:41,220 INFO L93 Difference]: Finished difference Result 40 states and 53 transitions. [2022-04-28 04:52:41,220 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 53 transitions. [2022-04-28 04:52:41,221 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:52:41,221 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:52:41,221 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:52:41,221 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:52:41,222 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-28 04:52:41,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 52 transitions. [2022-04-28 04:52:41,223 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 52 transitions. Word has length 21 [2022-04-28 04:52:41,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:52:41,223 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 52 transitions. [2022-04-28 04:52:41,224 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-28 04:52:41,224 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 52 transitions. [2022-04-28 04:52:41,267 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:52:41,267 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 52 transitions. [2022-04-28 04:52:41,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-28 04:52:41,268 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:52:41,268 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-28 04:52:41,287 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-28 04:52:41,469 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-28 04:52:41,469 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:52:41,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:52:41,470 INFO L85 PathProgramCache]: Analyzing trace with hash 963589341, now seen corresponding path program 1 times [2022-04-28 04:52:41,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:52:41,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [210247536] [2022-04-28 04:52:41,470 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 04:52:41,470 INFO L85 PathProgramCache]: Analyzing trace with hash 963589341, now seen corresponding path program 2 times [2022-04-28 04:52:41,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:52:41,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244065859] [2022-04-28 04:52:41,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:52:41,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:52:41,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:52:41,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:52:41,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:52:41,660 INFO L290 TraceCheckUtils]: 0: Hoare triple {985#(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; {972#true} is VALID [2022-04-28 04:52:41,661 INFO L290 TraceCheckUtils]: 1: Hoare triple {972#true} assume true; {972#true} is VALID [2022-04-28 04:52:41,661 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {972#true} {972#true} #102#return; {972#true} is VALID [2022-04-28 04:52:41,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 04:52:41,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:52:41,665 INFO L290 TraceCheckUtils]: 0: Hoare triple {972#true} ~cond := #in~cond; {972#true} is VALID [2022-04-28 04:52:41,665 INFO L290 TraceCheckUtils]: 1: Hoare triple {972#true} assume !(0 == ~cond); {972#true} is VALID [2022-04-28 04:52:41,666 INFO L290 TraceCheckUtils]: 2: Hoare triple {972#true} assume true; {972#true} is VALID [2022-04-28 04:52:41,666 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {972#true} {972#true} #82#return; {972#true} is VALID [2022-04-28 04:52:41,666 INFO L272 TraceCheckUtils]: 0: Hoare triple {972#true} call ULTIMATE.init(); {985#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:52:41,666 INFO L290 TraceCheckUtils]: 1: Hoare triple {985#(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; {972#true} is VALID [2022-04-28 04:52:41,667 INFO L290 TraceCheckUtils]: 2: Hoare triple {972#true} assume true; {972#true} is VALID [2022-04-28 04:52:41,667 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {972#true} {972#true} #102#return; {972#true} is VALID [2022-04-28 04:52:41,667 INFO L272 TraceCheckUtils]: 4: Hoare triple {972#true} call #t~ret7 := main(); {972#true} is VALID [2022-04-28 04:52:41,667 INFO L290 TraceCheckUtils]: 5: Hoare triple {972#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {972#true} is VALID [2022-04-28 04:52:41,667 INFO L272 TraceCheckUtils]: 6: Hoare triple {972#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {972#true} is VALID [2022-04-28 04:52:41,667 INFO L290 TraceCheckUtils]: 7: Hoare triple {972#true} ~cond := #in~cond; {972#true} is VALID [2022-04-28 04:52:41,667 INFO L290 TraceCheckUtils]: 8: Hoare triple {972#true} assume !(0 == ~cond); {972#true} is VALID [2022-04-28 04:52:41,667 INFO L290 TraceCheckUtils]: 9: Hoare triple {972#true} assume true; {972#true} is VALID [2022-04-28 04:52:41,668 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {972#true} {972#true} #82#return; {972#true} is VALID [2022-04-28 04:52:41,668 INFO L290 TraceCheckUtils]: 11: Hoare triple {972#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {981#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} is VALID [2022-04-28 04:52:41,669 INFO L290 TraceCheckUtils]: 12: Hoare triple {981#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {981#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} is VALID [2022-04-28 04:52:41,669 INFO L290 TraceCheckUtils]: 13: Hoare triple {981#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} assume !!(#t~post5 < 50);havoc #t~post5; {981#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} is VALID [2022-04-28 04:52:41,670 INFO L290 TraceCheckUtils]: 14: Hoare triple {981#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {982#(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-28 04:52:41,670 INFO L290 TraceCheckUtils]: 15: Hoare triple {982#(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; {982#(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-28 04:52:41,671 INFO L290 TraceCheckUtils]: 16: Hoare triple {982#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0))} assume !!(#t~post6 < 50);havoc #t~post6; {982#(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-28 04:52:41,672 INFO L272 TraceCheckUtils]: 17: Hoare triple {982#(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)); {983#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:52:41,672 INFO L290 TraceCheckUtils]: 18: Hoare triple {983#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {984#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 04:52:41,673 INFO L290 TraceCheckUtils]: 19: Hoare triple {984#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {973#false} is VALID [2022-04-28 04:52:41,673 INFO L290 TraceCheckUtils]: 20: Hoare triple {973#false} assume !false; {973#false} is VALID [2022-04-28 04:52:41,673 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-28 04:52:41,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:52:41,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244065859] [2022-04-28 04:52:41,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244065859] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:52:41,674 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:52:41,674 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 04:52:41,674 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:52:41,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [210247536] [2022-04-28 04:52:41,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [210247536] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:52:41,674 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:52:41,674 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 04:52:41,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336551830] [2022-04-28 04:52:41,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:52:41,675 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-28 04:52:41,675 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:52:41,675 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-28 04:52:41,689 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-28 04:52:41,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 04:52:41,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:52:41,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 04:52:41,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-28 04:52:41,690 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-28 04:53:02,095 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-28 04:53:13,588 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-28 04:53:17,476 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-28 04:53:18,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:53:18,307 INFO L93 Difference]: Finished difference Result 55 states and 76 transitions. [2022-04-28 04:53:18,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 04:53:18,307 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-28 04:53:18,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:53:18,307 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-28 04:53:18,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 76 transitions. [2022-04-28 04:53:18,309 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-28 04:53:18,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 76 transitions. [2022-04-28 04:53:18,311 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 76 transitions. [2022-04-28 04:53:18,461 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:53:18,463 INFO L225 Difference]: With dead ends: 55 [2022-04-28 04:53:18,463 INFO L226 Difference]: Without dead ends: 51 [2022-04-28 04:53:18,463 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-28 04:53:18,464 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 24 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 36 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.1s IncrementalHoareTripleChecker+Time [2022-04-28 04:53:18,464 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 107 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 207 Invalid, 3 Unknown, 0 Unchecked, 13.1s Time] [2022-04-28 04:53:18,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-28 04:53:18,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-04-28 04:53:18,488 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:53:18,489 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 51 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 29 states have internal predecessors, (35), 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-28 04:53:18,489 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 51 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 29 states have internal predecessors, (35), 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-28 04:53:18,489 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 51 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 29 states have internal predecessors, (35), 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-28 04:53:18,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:53:18,492 INFO L93 Difference]: Finished difference Result 51 states and 70 transitions. [2022-04-28 04:53:18,492 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 70 transitions. [2022-04-28 04:53:18,492 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:53:18,492 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:53:18,493 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 29 states have internal predecessors, (35), 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-28 04:53:18,493 INFO L87 Difference]: Start difference. First operand has 51 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 29 states have internal predecessors, (35), 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-28 04:53:18,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:53:18,495 INFO L93 Difference]: Finished difference Result 51 states and 70 transitions. [2022-04-28 04:53:18,495 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 70 transitions. [2022-04-28 04:53:18,496 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:53:18,496 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:53:18,496 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:53:18,496 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:53:18,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 29 states have internal predecessors, (35), 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-28 04:53:18,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 70 transitions. [2022-04-28 04:53:18,498 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 70 transitions. Word has length 21 [2022-04-28 04:53:18,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:53:18,499 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 70 transitions. [2022-04-28 04:53:18,499 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-28 04:53:18,499 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 70 transitions. [2022-04-28 04:53:18,689 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:53:18,689 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 70 transitions. [2022-04-28 04:53:18,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 04:53:18,690 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:53:18,690 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-28 04:53:18,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-28 04:53:18,690 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:53:18,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:53:18,690 INFO L85 PathProgramCache]: Analyzing trace with hash -1701877900, now seen corresponding path program 1 times [2022-04-28 04:53:18,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:53:18,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1810419603] [2022-04-28 04:53:18,724 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:53:18,725 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-28 04:53:18,725 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 04:53:18,725 INFO L85 PathProgramCache]: Analyzing trace with hash -1701877900, now seen corresponding path program 2 times [2022-04-28 04:53:18,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:53:18,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261459394] [2022-04-28 04:53:18,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:53:18,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:53:18,735 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 04:53:18,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1834277232] [2022-04-28 04:53:18,735 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 04:53:18,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:53:18,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:53:18,755 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-28 04:53:18,756 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-28 04:53:18,794 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 04:53:18,794 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:53:18,795 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 04:53:18,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:53:18,804 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:53:18,955 INFO L272 TraceCheckUtils]: 0: Hoare triple {1312#true} call ULTIMATE.init(); {1312#true} is VALID [2022-04-28 04:53:18,955 INFO L290 TraceCheckUtils]: 1: Hoare triple {1312#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; {1312#true} is VALID [2022-04-28 04:53:18,956 INFO L290 TraceCheckUtils]: 2: Hoare triple {1312#true} assume true; {1312#true} is VALID [2022-04-28 04:53:18,956 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1312#true} {1312#true} #102#return; {1312#true} is VALID [2022-04-28 04:53:18,956 INFO L272 TraceCheckUtils]: 4: Hoare triple {1312#true} call #t~ret7 := main(); {1312#true} is VALID [2022-04-28 04:53:18,956 INFO L290 TraceCheckUtils]: 5: Hoare triple {1312#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {1312#true} is VALID [2022-04-28 04:53:18,956 INFO L272 TraceCheckUtils]: 6: Hoare triple {1312#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {1312#true} is VALID [2022-04-28 04:53:18,956 INFO L290 TraceCheckUtils]: 7: Hoare triple {1312#true} ~cond := #in~cond; {1312#true} is VALID [2022-04-28 04:53:18,956 INFO L290 TraceCheckUtils]: 8: Hoare triple {1312#true} assume !(0 == ~cond); {1312#true} is VALID [2022-04-28 04:53:18,956 INFO L290 TraceCheckUtils]: 9: Hoare triple {1312#true} assume true; {1312#true} is VALID [2022-04-28 04:53:18,957 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1312#true} {1312#true} #82#return; {1312#true} is VALID [2022-04-28 04:53:18,957 INFO L290 TraceCheckUtils]: 11: Hoare triple {1312#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {1350#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-28 04:53:18,957 INFO L290 TraceCheckUtils]: 12: Hoare triple {1350#(and (= main_~p~0 0) (= main_~h~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1350#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-28 04:53:18,958 INFO L290 TraceCheckUtils]: 13: Hoare triple {1350#(and (= main_~p~0 0) (= main_~h~0 0))} assume !!(#t~post5 < 50);havoc #t~post5; {1350#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-28 04:53:18,958 INFO L290 TraceCheckUtils]: 14: Hoare triple {1350#(and (= main_~p~0 0) (= main_~h~0 0))} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {1350#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-28 04:53:18,959 INFO L290 TraceCheckUtils]: 15: Hoare triple {1350#(and (= main_~p~0 0) (= main_~h~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1350#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-28 04:53:18,959 INFO L290 TraceCheckUtils]: 16: Hoare triple {1350#(and (= main_~p~0 0) (= main_~h~0 0))} assume !(#t~post5 < 50);havoc #t~post5; {1350#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-28 04:53:18,960 INFO L290 TraceCheckUtils]: 17: Hoare triple {1350#(and (= main_~p~0 0) (= main_~h~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1350#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-28 04:53:18,960 INFO L290 TraceCheckUtils]: 18: Hoare triple {1350#(and (= main_~p~0 0) (= main_~h~0 0))} assume !(#t~post6 < 50);havoc #t~post6; {1350#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-28 04:53:18,961 INFO L272 TraceCheckUtils]: 19: Hoare triple {1350#(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 + 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)); {1375#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:53:18,961 INFO L290 TraceCheckUtils]: 20: Hoare triple {1375#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1379#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:53:18,962 INFO L290 TraceCheckUtils]: 21: Hoare triple {1379#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1313#false} is VALID [2022-04-28 04:53:18,962 INFO L290 TraceCheckUtils]: 22: Hoare triple {1313#false} assume !false; {1313#false} is VALID [2022-04-28 04:53:18,962 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 04:53:18,962 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 04:53:18,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:53:18,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261459394] [2022-04-28 04:53:18,963 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 04:53:18,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1834277232] [2022-04-28 04:53:18,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1834277232] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:53:18,963 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:53:18,963 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 04:53:18,963 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:53:18,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1810419603] [2022-04-28 04:53:18,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1810419603] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:53:18,963 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:53:18,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 04:53:18,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196973505] [2022-04-28 04:53:18,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:53:18,964 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2022-04-28 04:53:18,964 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:53:18,964 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 04:53:18,984 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:53:18,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 04:53:18,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:53:18,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 04:53:18,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 04:53:18,985 INFO L87 Difference]: Start difference. First operand 51 states and 70 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 04:53:22,467 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 04:53:24,469 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-28 04:53:28,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:53:28,989 INFO L93 Difference]: Finished difference Result 73 states and 100 transitions. [2022-04-28 04:53:28,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 04:53:28,990 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2022-04-28 04:53:28,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:53:28,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 04:53:28,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 73 transitions. [2022-04-28 04:53:28,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 04:53:28,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 73 transitions. [2022-04-28 04:53:28,993 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 73 transitions. [2022-04-28 04:53:29,076 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-28 04:53:29,077 INFO L225 Difference]: With dead ends: 73 [2022-04-28 04:53:29,077 INFO L226 Difference]: Without dead ends: 69 [2022-04-28 04:53:29,078 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 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-28 04:53:29,078 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 8 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 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, 4.3s IncrementalHoareTripleChecker+Time [2022-04-28 04:53:29,078 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 157 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 50 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2022-04-28 04:53:29,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-04-28 04:53:29,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2022-04-28 04:53:29,108 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:53:29,109 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand has 69 states, 36 states have (on average 1.25) internal successors, (45), 38 states have internal predecessors, (45), 26 states have call successors, (26), 7 states have call predecessors, (26), 6 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-28 04:53:29,109 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand has 69 states, 36 states have (on average 1.25) internal successors, (45), 38 states have internal predecessors, (45), 26 states have call successors, (26), 7 states have call predecessors, (26), 6 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-28 04:53:29,109 INFO L87 Difference]: Start difference. First operand 69 states. Second operand has 69 states, 36 states have (on average 1.25) internal successors, (45), 38 states have internal predecessors, (45), 26 states have call successors, (26), 7 states have call predecessors, (26), 6 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-28 04:53:29,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:53:29,112 INFO L93 Difference]: Finished difference Result 69 states and 94 transitions. [2022-04-28 04:53:29,112 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 94 transitions. [2022-04-28 04:53:29,113 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:53:29,113 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:53:29,113 INFO L74 IsIncluded]: Start isIncluded. First operand has 69 states, 36 states have (on average 1.25) internal successors, (45), 38 states have internal predecessors, (45), 26 states have call successors, (26), 7 states have call predecessors, (26), 6 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand 69 states. [2022-04-28 04:53:29,113 INFO L87 Difference]: Start difference. First operand has 69 states, 36 states have (on average 1.25) internal successors, (45), 38 states have internal predecessors, (45), 26 states have call successors, (26), 7 states have call predecessors, (26), 6 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand 69 states. [2022-04-28 04:53:29,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:53:29,116 INFO L93 Difference]: Finished difference Result 69 states and 94 transitions. [2022-04-28 04:53:29,116 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 94 transitions. [2022-04-28 04:53:29,117 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:53:29,117 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:53:29,117 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:53:29,117 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:53:29,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 36 states have (on average 1.25) internal successors, (45), 38 states have internal predecessors, (45), 26 states have call successors, (26), 7 states have call predecessors, (26), 6 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-28 04:53:29,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 94 transitions. [2022-04-28 04:53:29,120 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 94 transitions. Word has length 23 [2022-04-28 04:53:29,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:53:29,120 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 94 transitions. [2022-04-28 04:53:29,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 04:53:29,120 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 69 states and 94 transitions. [2022-04-28 04:53:29,395 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:53:29,396 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 94 transitions. [2022-04-28 04:53:29,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 04:53:29,396 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:53:29,396 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-28 04:53:29,415 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-28 04:53:29,596 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-28 04:53:29,597 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:53:29,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:53:29,597 INFO L85 PathProgramCache]: Analyzing trace with hash -1700388350, now seen corresponding path program 1 times [2022-04-28 04:53:29,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:53:29,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2100245059] [2022-04-28 04:53:29,603 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:53:29,603 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-28 04:53:29,603 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 04:53:29,603 INFO L85 PathProgramCache]: Analyzing trace with hash -1700388350, now seen corresponding path program 2 times [2022-04-28 04:53:29,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:53:29,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30303093] [2022-04-28 04:53:29,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:53:29,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:53:29,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:53:29,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:53:29,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:53:29,692 INFO L290 TraceCheckUtils]: 0: Hoare triple {1821#(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; {1814#(<= ~counter~0 0)} is VALID [2022-04-28 04:53:29,692 INFO L290 TraceCheckUtils]: 1: Hoare triple {1814#(<= ~counter~0 0)} assume true; {1814#(<= ~counter~0 0)} is VALID [2022-04-28 04:53:29,699 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1814#(<= ~counter~0 0)} {1809#true} #102#return; {1814#(<= ~counter~0 0)} is VALID [2022-04-28 04:53:29,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 04:53:29,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:53:29,710 INFO L290 TraceCheckUtils]: 0: Hoare triple {1809#true} ~cond := #in~cond; {1809#true} is VALID [2022-04-28 04:53:29,711 INFO L290 TraceCheckUtils]: 1: Hoare triple {1809#true} assume !(0 == ~cond); {1809#true} is VALID [2022-04-28 04:53:29,711 INFO L290 TraceCheckUtils]: 2: Hoare triple {1809#true} assume true; {1809#true} is VALID [2022-04-28 04:53:29,713 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1809#true} {1814#(<= ~counter~0 0)} #82#return; {1814#(<= ~counter~0 0)} is VALID [2022-04-28 04:53:29,714 INFO L272 TraceCheckUtils]: 0: Hoare triple {1809#true} call ULTIMATE.init(); {1821#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:53:29,714 INFO L290 TraceCheckUtils]: 1: Hoare triple {1821#(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; {1814#(<= ~counter~0 0)} is VALID [2022-04-28 04:53:29,715 INFO L290 TraceCheckUtils]: 2: Hoare triple {1814#(<= ~counter~0 0)} assume true; {1814#(<= ~counter~0 0)} is VALID [2022-04-28 04:53:29,715 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1814#(<= ~counter~0 0)} {1809#true} #102#return; {1814#(<= ~counter~0 0)} is VALID [2022-04-28 04:53:29,715 INFO L272 TraceCheckUtils]: 4: Hoare triple {1814#(<= ~counter~0 0)} call #t~ret7 := main(); {1814#(<= ~counter~0 0)} is VALID [2022-04-28 04:53:29,716 INFO L290 TraceCheckUtils]: 5: Hoare triple {1814#(<= ~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; {1814#(<= ~counter~0 0)} is VALID [2022-04-28 04:53:29,716 INFO L272 TraceCheckUtils]: 6: Hoare triple {1814#(<= ~counter~0 0)} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {1809#true} is VALID [2022-04-28 04:53:29,716 INFO L290 TraceCheckUtils]: 7: Hoare triple {1809#true} ~cond := #in~cond; {1809#true} is VALID [2022-04-28 04:53:29,716 INFO L290 TraceCheckUtils]: 8: Hoare triple {1809#true} assume !(0 == ~cond); {1809#true} is VALID [2022-04-28 04:53:29,716 INFO L290 TraceCheckUtils]: 9: Hoare triple {1809#true} assume true; {1809#true} is VALID [2022-04-28 04:53:29,716 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1809#true} {1814#(<= ~counter~0 0)} #82#return; {1814#(<= ~counter~0 0)} is VALID [2022-04-28 04:53:29,717 INFO L290 TraceCheckUtils]: 11: Hoare triple {1814#(<= ~counter~0 0)} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {1814#(<= ~counter~0 0)} is VALID [2022-04-28 04:53:29,717 INFO L290 TraceCheckUtils]: 12: Hoare triple {1814#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1819#(<= ~counter~0 1)} is VALID [2022-04-28 04:53:29,718 INFO L290 TraceCheckUtils]: 13: Hoare triple {1819#(<= ~counter~0 1)} assume !!(#t~post5 < 50);havoc #t~post5; {1819#(<= ~counter~0 1)} is VALID [2022-04-28 04:53:29,718 INFO L290 TraceCheckUtils]: 14: Hoare triple {1819#(<= ~counter~0 1)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {1819#(<= ~counter~0 1)} is VALID [2022-04-28 04:53:29,718 INFO L290 TraceCheckUtils]: 15: Hoare triple {1819#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1820#(<= |main_#t~post5| 1)} is VALID [2022-04-28 04:53:29,719 INFO L290 TraceCheckUtils]: 16: Hoare triple {1820#(<= |main_#t~post5| 1)} assume !(#t~post5 < 50);havoc #t~post5; {1810#false} is VALID [2022-04-28 04:53:29,719 INFO L290 TraceCheckUtils]: 17: Hoare triple {1810#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1810#false} is VALID [2022-04-28 04:53:29,719 INFO L290 TraceCheckUtils]: 18: Hoare triple {1810#false} assume !!(#t~post6 < 50);havoc #t~post6; {1810#false} is VALID [2022-04-28 04:53:29,719 INFO L272 TraceCheckUtils]: 19: Hoare triple {1810#false} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {1810#false} is VALID [2022-04-28 04:53:29,719 INFO L290 TraceCheckUtils]: 20: Hoare triple {1810#false} ~cond := #in~cond; {1810#false} is VALID [2022-04-28 04:53:29,719 INFO L290 TraceCheckUtils]: 21: Hoare triple {1810#false} assume 0 == ~cond; {1810#false} is VALID [2022-04-28 04:53:29,719 INFO L290 TraceCheckUtils]: 22: Hoare triple {1810#false} assume !false; {1810#false} is VALID [2022-04-28 04:53:29,719 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-28 04:53:29,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:53:29,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30303093] [2022-04-28 04:53:29,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30303093] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 04:53:29,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1089519596] [2022-04-28 04:53:29,720 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 04:53:29,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:53:29,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:53:29,721 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-28 04:53:29,722 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-28 04:53:29,760 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 04:53:29,760 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:53:29,761 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-28 04:53:29,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:53:29,767 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:53:29,857 INFO L272 TraceCheckUtils]: 0: Hoare triple {1809#true} call ULTIMATE.init(); {1809#true} is VALID [2022-04-28 04:53:29,857 INFO L290 TraceCheckUtils]: 1: Hoare triple {1809#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; {1809#true} is VALID [2022-04-28 04:53:29,857 INFO L290 TraceCheckUtils]: 2: Hoare triple {1809#true} assume true; {1809#true} is VALID [2022-04-28 04:53:29,857 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1809#true} {1809#true} #102#return; {1809#true} is VALID [2022-04-28 04:53:29,857 INFO L272 TraceCheckUtils]: 4: Hoare triple {1809#true} call #t~ret7 := main(); {1809#true} is VALID [2022-04-28 04:53:29,858 INFO L290 TraceCheckUtils]: 5: Hoare triple {1809#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {1809#true} is VALID [2022-04-28 04:53:29,858 INFO L272 TraceCheckUtils]: 6: Hoare triple {1809#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {1809#true} is VALID [2022-04-28 04:53:29,858 INFO L290 TraceCheckUtils]: 7: Hoare triple {1809#true} ~cond := #in~cond; {1809#true} is VALID [2022-04-28 04:53:29,858 INFO L290 TraceCheckUtils]: 8: Hoare triple {1809#true} assume !(0 == ~cond); {1809#true} is VALID [2022-04-28 04:53:29,858 INFO L290 TraceCheckUtils]: 9: Hoare triple {1809#true} assume true; {1809#true} is VALID [2022-04-28 04:53:29,858 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1809#true} {1809#true} #82#return; {1809#true} is VALID [2022-04-28 04:53:29,858 INFO L290 TraceCheckUtils]: 11: Hoare triple {1809#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {1809#true} is VALID [2022-04-28 04:53:29,858 INFO L290 TraceCheckUtils]: 12: Hoare triple {1809#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1809#true} is VALID [2022-04-28 04:53:29,858 INFO L290 TraceCheckUtils]: 13: Hoare triple {1809#true} assume !!(#t~post5 < 50);havoc #t~post5; {1809#true} is VALID [2022-04-28 04:53:29,858 INFO L290 TraceCheckUtils]: 14: Hoare triple {1809#true} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {1809#true} is VALID [2022-04-28 04:53:29,859 INFO L290 TraceCheckUtils]: 15: Hoare triple {1809#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1870#(<= (+ |main_#t~post5| 1) ~counter~0)} is VALID [2022-04-28 04:53:29,860 INFO L290 TraceCheckUtils]: 16: Hoare triple {1870#(<= (+ |main_#t~post5| 1) ~counter~0)} assume !(#t~post5 < 50);havoc #t~post5; {1874#(<= 51 ~counter~0)} is VALID [2022-04-28 04:53:29,860 INFO L290 TraceCheckUtils]: 17: Hoare triple {1874#(<= 51 ~counter~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1878#(<= 51 |main_#t~post6|)} is VALID [2022-04-28 04:53:29,860 INFO L290 TraceCheckUtils]: 18: Hoare triple {1878#(<= 51 |main_#t~post6|)} assume !!(#t~post6 < 50);havoc #t~post6; {1810#false} is VALID [2022-04-28 04:53:29,873 INFO L272 TraceCheckUtils]: 19: Hoare triple {1810#false} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {1810#false} is VALID [2022-04-28 04:53:29,873 INFO L290 TraceCheckUtils]: 20: Hoare triple {1810#false} ~cond := #in~cond; {1810#false} is VALID [2022-04-28 04:53:29,873 INFO L290 TraceCheckUtils]: 21: Hoare triple {1810#false} assume 0 == ~cond; {1810#false} is VALID [2022-04-28 04:53:29,873 INFO L290 TraceCheckUtils]: 22: Hoare triple {1810#false} assume !false; {1810#false} is VALID [2022-04-28 04:53:29,873 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 04:53:29,874 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 04:53:29,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1089519596] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:53:29,874 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-28 04:53:29,874 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2022-04-28 04:53:29,874 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:53:29,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2100245059] [2022-04-28 04:53:29,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2100245059] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:53:29,874 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:53:29,874 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 04:53:29,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989169026] [2022-04-28 04:53:29,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:53:29,875 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2022-04-28 04:53:29,875 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:53:29,875 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 04:53:29,895 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-28 04:53:29,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 04:53:29,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:53:29,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 04:53:29,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-04-28 04:53:29,898 INFO L87 Difference]: Start difference. First operand 69 states and 94 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 04:53:32,000 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-28 04:53:36,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:53:36,754 INFO L93 Difference]: Finished difference Result 115 states and 157 transitions. [2022-04-28 04:53:36,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 04:53:36,755 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2022-04-28 04:53:36,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:53:36,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 04:53:36,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 86 transitions. [2022-04-28 04:53:36,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 04:53:36,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 86 transitions. [2022-04-28 04:53:36,757 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 86 transitions. [2022-04-28 04:53:36,829 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:53:36,831 INFO L225 Difference]: With dead ends: 115 [2022-04-28 04:53:36,831 INFO L226 Difference]: Without dead ends: 81 [2022-04-28 04:53:36,831 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-04-28 04:53:36,832 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 8 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-04-28 04:53:36,832 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 181 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 1 Unknown, 0 Unchecked, 2.0s Time] [2022-04-28 04:53:36,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-04-28 04:53:36,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2022-04-28 04:53:36,866 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:53:36,866 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand has 79 states, 43 states have (on average 1.2093023255813953) internal successors, (52), 45 states have internal predecessors, (52), 28 states have call successors, (28), 9 states have call predecessors, (28), 7 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-28 04:53:36,866 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand has 79 states, 43 states have (on average 1.2093023255813953) internal successors, (52), 45 states have internal predecessors, (52), 28 states have call successors, (28), 9 states have call predecessors, (28), 7 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-28 04:53:36,867 INFO L87 Difference]: Start difference. First operand 81 states. Second operand has 79 states, 43 states have (on average 1.2093023255813953) internal successors, (52), 45 states have internal predecessors, (52), 28 states have call successors, (28), 9 states have call predecessors, (28), 7 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-28 04:53:36,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:53:36,870 INFO L93 Difference]: Finished difference Result 81 states and 105 transitions. [2022-04-28 04:53:36,870 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 105 transitions. [2022-04-28 04:53:36,870 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:53:36,870 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:53:36,870 INFO L74 IsIncluded]: Start isIncluded. First operand has 79 states, 43 states have (on average 1.2093023255813953) internal successors, (52), 45 states have internal predecessors, (52), 28 states have call successors, (28), 9 states have call predecessors, (28), 7 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand 81 states. [2022-04-28 04:53:36,871 INFO L87 Difference]: Start difference. First operand has 79 states, 43 states have (on average 1.2093023255813953) internal successors, (52), 45 states have internal predecessors, (52), 28 states have call successors, (28), 9 states have call predecessors, (28), 7 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand 81 states. [2022-04-28 04:53:36,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:53:36,874 INFO L93 Difference]: Finished difference Result 81 states and 105 transitions. [2022-04-28 04:53:36,874 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 105 transitions. [2022-04-28 04:53:36,874 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:53:36,874 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:53:36,874 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:53:36,874 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:53:36,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 43 states have (on average 1.2093023255813953) internal successors, (52), 45 states have internal predecessors, (52), 28 states have call successors, (28), 9 states have call predecessors, (28), 7 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-28 04:53:36,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 104 transitions. [2022-04-28 04:53:36,878 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 104 transitions. Word has length 23 [2022-04-28 04:53:36,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:53:36,878 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 104 transitions. [2022-04-28 04:53:36,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 04:53:36,878 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 79 states and 104 transitions. [2022-04-28 04:53:37,126 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-28 04:53:37,126 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 104 transitions. [2022-04-28 04:53:37,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-28 04:53:37,126 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:53:37,126 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-28 04:53:37,143 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-28 04:53:37,327 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-28 04:53:37,327 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:53:37,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:53:37,327 INFO L85 PathProgramCache]: Analyzing trace with hash -1562772727, now seen corresponding path program 1 times [2022-04-28 04:53:37,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:53:37,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1279553491] [2022-04-28 04:53:37,332 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:53:37,332 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-28 04:53:37,332 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 04:53:37,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1562772727, now seen corresponding path program 2 times [2022-04-28 04:53:37,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:53:37,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600837428] [2022-04-28 04:53:37,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:53:37,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:53:37,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:53:37,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:53:37,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:53:37,550 INFO L290 TraceCheckUtils]: 0: Hoare triple {2459#(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; {2445#true} is VALID [2022-04-28 04:53:37,550 INFO L290 TraceCheckUtils]: 1: Hoare triple {2445#true} assume true; {2445#true} is VALID [2022-04-28 04:53:37,550 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2445#true} {2445#true} #102#return; {2445#true} is VALID [2022-04-28 04:53:37,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 04:53:37,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:53:37,558 INFO L290 TraceCheckUtils]: 0: Hoare triple {2445#true} ~cond := #in~cond; {2445#true} is VALID [2022-04-28 04:53:37,558 INFO L290 TraceCheckUtils]: 1: Hoare triple {2445#true} assume !(0 == ~cond); {2445#true} is VALID [2022-04-28 04:53:37,558 INFO L290 TraceCheckUtils]: 2: Hoare triple {2445#true} assume true; {2445#true} is VALID [2022-04-28 04:53:37,558 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2445#true} {2445#true} #82#return; {2445#true} is VALID [2022-04-28 04:53:37,559 INFO L272 TraceCheckUtils]: 0: Hoare triple {2445#true} call ULTIMATE.init(); {2459#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:53:37,560 INFO L290 TraceCheckUtils]: 1: Hoare triple {2459#(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; {2445#true} is VALID [2022-04-28 04:53:37,560 INFO L290 TraceCheckUtils]: 2: Hoare triple {2445#true} assume true; {2445#true} is VALID [2022-04-28 04:53:37,560 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2445#true} {2445#true} #102#return; {2445#true} is VALID [2022-04-28 04:53:37,561 INFO L272 TraceCheckUtils]: 4: Hoare triple {2445#true} call #t~ret7 := main(); {2445#true} is VALID [2022-04-28 04:53:37,561 INFO L290 TraceCheckUtils]: 5: Hoare triple {2445#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {2445#true} is VALID [2022-04-28 04:53:37,561 INFO L272 TraceCheckUtils]: 6: Hoare triple {2445#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {2445#true} is VALID [2022-04-28 04:53:37,561 INFO L290 TraceCheckUtils]: 7: Hoare triple {2445#true} ~cond := #in~cond; {2445#true} is VALID [2022-04-28 04:53:37,561 INFO L290 TraceCheckUtils]: 8: Hoare triple {2445#true} assume !(0 == ~cond); {2445#true} is VALID [2022-04-28 04:53:37,561 INFO L290 TraceCheckUtils]: 9: Hoare triple {2445#true} assume true; {2445#true} is VALID [2022-04-28 04:53:37,561 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2445#true} {2445#true} #82#return; {2445#true} is VALID [2022-04-28 04:53:37,562 INFO L290 TraceCheckUtils]: 11: Hoare triple {2445#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {2454#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-28 04:53:37,562 INFO L290 TraceCheckUtils]: 12: Hoare triple {2454#(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; {2454#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-28 04:53:37,563 INFO L290 TraceCheckUtils]: 13: Hoare triple {2454#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} assume !!(#t~post5 < 50);havoc #t~post5; {2454#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-28 04:53:37,564 INFO L290 TraceCheckUtils]: 14: Hoare triple {2454#(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; {2455#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-28 04:53:37,564 INFO L290 TraceCheckUtils]: 15: Hoare triple {2455#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2455#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-28 04:53:37,565 INFO L290 TraceCheckUtils]: 16: Hoare triple {2455#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} assume !!(#t~post5 < 50);havoc #t~post5; {2455#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-28 04:53:37,565 INFO L290 TraceCheckUtils]: 17: Hoare triple {2455#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {2456#(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-28 04:53:37,566 INFO L290 TraceCheckUtils]: 18: Hoare triple {2456#(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; {2456#(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-28 04:53:37,566 INFO L290 TraceCheckUtils]: 19: Hoare triple {2456#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0))} assume !!(#t~post6 < 50);havoc #t~post6; {2456#(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-28 04:53:37,568 INFO L272 TraceCheckUtils]: 20: Hoare triple {2456#(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)); {2457#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:53:37,568 INFO L290 TraceCheckUtils]: 21: Hoare triple {2457#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {2458#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 04:53:37,571 INFO L290 TraceCheckUtils]: 22: Hoare triple {2458#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {2446#false} is VALID [2022-04-28 04:53:37,571 INFO L290 TraceCheckUtils]: 23: Hoare triple {2446#false} assume !false; {2446#false} is VALID [2022-04-28 04:53:37,572 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-28 04:53:37,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:53:37,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600837428] [2022-04-28 04:53:37,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600837428] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 04:53:37,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [811792977] [2022-04-28 04:53:37,572 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 04:53:37,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:53:37,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:53:37,573 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-28 04:53:37,575 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-28 04:53:37,603 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 04:53:37,604 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:53:37,604 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-28 04:53:37,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:53:37,616 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:53:38,540 INFO L272 TraceCheckUtils]: 0: Hoare triple {2445#true} call ULTIMATE.init(); {2445#true} is VALID [2022-04-28 04:53:38,541 INFO L290 TraceCheckUtils]: 1: Hoare triple {2445#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; {2445#true} is VALID [2022-04-28 04:53:38,541 INFO L290 TraceCheckUtils]: 2: Hoare triple {2445#true} assume true; {2445#true} is VALID [2022-04-28 04:53:38,541 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2445#true} {2445#true} #102#return; {2445#true} is VALID [2022-04-28 04:53:38,541 INFO L272 TraceCheckUtils]: 4: Hoare triple {2445#true} call #t~ret7 := main(); {2445#true} is VALID [2022-04-28 04:53:38,541 INFO L290 TraceCheckUtils]: 5: Hoare triple {2445#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {2445#true} is VALID [2022-04-28 04:53:38,541 INFO L272 TraceCheckUtils]: 6: Hoare triple {2445#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {2445#true} is VALID [2022-04-28 04:53:38,541 INFO L290 TraceCheckUtils]: 7: Hoare triple {2445#true} ~cond := #in~cond; {2445#true} is VALID [2022-04-28 04:53:38,541 INFO L290 TraceCheckUtils]: 8: Hoare triple {2445#true} assume !(0 == ~cond); {2445#true} is VALID [2022-04-28 04:53:38,541 INFO L290 TraceCheckUtils]: 9: Hoare triple {2445#true} assume true; {2445#true} is VALID [2022-04-28 04:53:38,541 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2445#true} {2445#true} #82#return; {2445#true} is VALID [2022-04-28 04:53:38,542 INFO L290 TraceCheckUtils]: 11: Hoare triple {2445#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {2455#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-28 04:53:38,542 INFO L290 TraceCheckUtils]: 12: Hoare triple {2455#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2455#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-28 04:53:38,543 INFO L290 TraceCheckUtils]: 13: Hoare triple {2455#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} assume !!(#t~post5 < 50);havoc #t~post5; {2455#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-28 04:53:38,543 INFO L290 TraceCheckUtils]: 14: Hoare triple {2455#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {2455#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-28 04:53:38,543 INFO L290 TraceCheckUtils]: 15: Hoare triple {2455#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2455#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-28 04:53:38,544 INFO L290 TraceCheckUtils]: 16: Hoare triple {2455#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} assume !!(#t~post5 < 50);havoc #t~post5; {2455#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-28 04:53:38,545 INFO L290 TraceCheckUtils]: 17: Hoare triple {2455#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {2456#(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-28 04:53:38,545 INFO L290 TraceCheckUtils]: 18: Hoare triple {2456#(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; {2456#(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-28 04:53:38,546 INFO L290 TraceCheckUtils]: 19: Hoare triple {2456#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0))} assume !!(#t~post6 < 50);havoc #t~post6; {2456#(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-28 04:53:38,547 INFO L272 TraceCheckUtils]: 20: Hoare triple {2456#(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)); {2523#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:53:38,547 INFO L290 TraceCheckUtils]: 21: Hoare triple {2523#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2527#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:53:38,548 INFO L290 TraceCheckUtils]: 22: Hoare triple {2527#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2446#false} is VALID [2022-04-28 04:53:38,548 INFO L290 TraceCheckUtils]: 23: Hoare triple {2446#false} assume !false; {2446#false} is VALID [2022-04-28 04:53:38,548 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 04:53:38,548 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 04:53:38,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [811792977] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:53:38,548 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-28 04:53:38,548 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 10 [2022-04-28 04:53:38,549 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:53:38,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1279553491] [2022-04-28 04:53:38,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1279553491] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:53:38,549 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:53:38,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 04:53:38,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686394176] [2022-04-28 04:53:38,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:53:38,549 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2022-04-28 04:53:38,549 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:53:38,550 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 04:53:38,565 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:53:38,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 04:53:38,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:53:38,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 04:53:38,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-04-28 04:53:38,566 INFO L87 Difference]: Start difference. First operand 79 states and 104 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 04:53:42,192 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-28 04:53:49,428 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-28 04:53:54,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:53:54,098 INFO L93 Difference]: Finished difference Result 102 states and 136 transitions. [2022-04-28 04:53:54,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 04:53:54,098 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2022-04-28 04:53:54,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:53:54,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 04:53:54,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 95 transitions. [2022-04-28 04:53:54,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 04:53:54,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 95 transitions. [2022-04-28 04:53:54,101 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 95 transitions. [2022-04-28 04:53:54,258 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:53:54,259 INFO L225 Difference]: With dead ends: 102 [2022-04-28 04:53:54,259 INFO L226 Difference]: Without dead ends: 86 [2022-04-28 04:53:54,260 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-04-28 04:53:54,261 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 17 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 26 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2022-04-28 04:53:54,261 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 170 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 123 Invalid, 2 Unknown, 0 Unchecked, 5.7s Time] [2022-04-28 04:53:54,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-04-28 04:53:54,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2022-04-28 04:53:54,332 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:53:54,332 INFO L82 GeneralOperation]: Start isEquivalent. First operand 86 states. Second operand has 85 states, 45 states have (on average 1.2) internal successors, (54), 48 states have internal predecessors, (54), 31 states have call successors, (31), 9 states have call predecessors, (31), 8 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-28 04:53:54,332 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand has 85 states, 45 states have (on average 1.2) internal successors, (54), 48 states have internal predecessors, (54), 31 states have call successors, (31), 9 states have call predecessors, (31), 8 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-28 04:53:54,332 INFO L87 Difference]: Start difference. First operand 86 states. Second operand has 85 states, 45 states have (on average 1.2) internal successors, (54), 48 states have internal predecessors, (54), 31 states have call successors, (31), 9 states have call predecessors, (31), 8 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-28 04:53:54,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:53:54,335 INFO L93 Difference]: Finished difference Result 86 states and 114 transitions. [2022-04-28 04:53:54,336 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 114 transitions. [2022-04-28 04:53:54,336 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:53:54,336 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:53:54,336 INFO L74 IsIncluded]: Start isIncluded. First operand has 85 states, 45 states have (on average 1.2) internal successors, (54), 48 states have internal predecessors, (54), 31 states have call successors, (31), 9 states have call predecessors, (31), 8 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) Second operand 86 states. [2022-04-28 04:53:54,336 INFO L87 Difference]: Start difference. First operand has 85 states, 45 states have (on average 1.2) internal successors, (54), 48 states have internal predecessors, (54), 31 states have call successors, (31), 9 states have call predecessors, (31), 8 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) Second operand 86 states. [2022-04-28 04:53:54,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:53:54,339 INFO L93 Difference]: Finished difference Result 86 states and 114 transitions. [2022-04-28 04:53:54,339 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 114 transitions. [2022-04-28 04:53:54,339 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:53:54,339 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:53:54,339 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:53:54,339 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:53:54,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 45 states have (on average 1.2) internal successors, (54), 48 states have internal predecessors, (54), 31 states have call successors, (31), 9 states have call predecessors, (31), 8 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-28 04:53:54,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 113 transitions. [2022-04-28 04:53:54,342 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 113 transitions. Word has length 24 [2022-04-28 04:53:54,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:53:54,342 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 113 transitions. [2022-04-28 04:53:54,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 04:53:54,342 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 85 states and 113 transitions. [2022-04-28 04:53:54,782 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:53:54,782 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 113 transitions. [2022-04-28 04:53:54,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-28 04:53:54,783 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:53:54,783 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 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, 1, 1, 1, 1, 1] [2022-04-28 04:53:54,800 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-28 04:53:55,000 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-28 04:53:55,000 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:53:55,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:53:55,000 INFO L85 PathProgramCache]: Analyzing trace with hash 636763459, now seen corresponding path program 1 times [2022-04-28 04:53:55,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:53:55,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2016440381] [2022-04-28 04:53:55,001 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 04:53:55,001 INFO L85 PathProgramCache]: Analyzing trace with hash 636763459, now seen corresponding path program 2 times [2022-04-28 04:53:55,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:53:55,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683671265] [2022-04-28 04:53:55,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:53:55,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:53:55,041 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 04:53:55,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1854289764] [2022-04-28 04:53:55,045 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 04:53:55,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:53:55,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:53:55,046 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-28 04:53:55,048 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-28 04:53:55,127 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 04:53:55,127 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:53:55,128 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 04:53:55,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:53:55,143 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:53:55,442 INFO L272 TraceCheckUtils]: 0: Hoare triple {3083#true} call ULTIMATE.init(); {3083#true} is VALID [2022-04-28 04:53:55,442 INFO L290 TraceCheckUtils]: 1: Hoare triple {3083#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; {3091#(<= ~counter~0 0)} is VALID [2022-04-28 04:53:55,443 INFO L290 TraceCheckUtils]: 2: Hoare triple {3091#(<= ~counter~0 0)} assume true; {3091#(<= ~counter~0 0)} is VALID [2022-04-28 04:53:55,443 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3091#(<= ~counter~0 0)} {3083#true} #102#return; {3091#(<= ~counter~0 0)} is VALID [2022-04-28 04:53:55,443 INFO L272 TraceCheckUtils]: 4: Hoare triple {3091#(<= ~counter~0 0)} call #t~ret7 := main(); {3091#(<= ~counter~0 0)} is VALID [2022-04-28 04:53:55,444 INFO L290 TraceCheckUtils]: 5: Hoare triple {3091#(<= ~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; {3091#(<= ~counter~0 0)} is VALID [2022-04-28 04:53:55,444 INFO L272 TraceCheckUtils]: 6: Hoare triple {3091#(<= ~counter~0 0)} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {3091#(<= ~counter~0 0)} is VALID [2022-04-28 04:53:55,444 INFO L290 TraceCheckUtils]: 7: Hoare triple {3091#(<= ~counter~0 0)} ~cond := #in~cond; {3091#(<= ~counter~0 0)} is VALID [2022-04-28 04:53:55,445 INFO L290 TraceCheckUtils]: 8: Hoare triple {3091#(<= ~counter~0 0)} assume !(0 == ~cond); {3091#(<= ~counter~0 0)} is VALID [2022-04-28 04:53:55,445 INFO L290 TraceCheckUtils]: 9: Hoare triple {3091#(<= ~counter~0 0)} assume true; {3091#(<= ~counter~0 0)} is VALID [2022-04-28 04:53:55,446 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3091#(<= ~counter~0 0)} {3091#(<= ~counter~0 0)} #82#return; {3091#(<= ~counter~0 0)} is VALID [2022-04-28 04:53:55,446 INFO L290 TraceCheckUtils]: 11: Hoare triple {3091#(<= ~counter~0 0)} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {3091#(<= ~counter~0 0)} is VALID [2022-04-28 04:53:55,447 INFO L290 TraceCheckUtils]: 12: Hoare triple {3091#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3125#(<= ~counter~0 1)} is VALID [2022-04-28 04:53:55,447 INFO L290 TraceCheckUtils]: 13: Hoare triple {3125#(<= ~counter~0 1)} assume !!(#t~post5 < 50);havoc #t~post5; {3125#(<= ~counter~0 1)} is VALID [2022-04-28 04:53:55,447 INFO L290 TraceCheckUtils]: 14: Hoare triple {3125#(<= ~counter~0 1)} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {3125#(<= ~counter~0 1)} is VALID [2022-04-28 04:53:55,448 INFO L290 TraceCheckUtils]: 15: Hoare triple {3125#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3135#(<= ~counter~0 2)} is VALID [2022-04-28 04:53:55,448 INFO L290 TraceCheckUtils]: 16: Hoare triple {3135#(<= ~counter~0 2)} assume !!(#t~post6 < 50);havoc #t~post6; {3135#(<= ~counter~0 2)} is VALID [2022-04-28 04:53:55,448 INFO L272 TraceCheckUtils]: 17: Hoare triple {3135#(<= ~counter~0 2)} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {3135#(<= ~counter~0 2)} is VALID [2022-04-28 04:53:55,453 INFO L290 TraceCheckUtils]: 18: Hoare triple {3135#(<= ~counter~0 2)} ~cond := #in~cond; {3135#(<= ~counter~0 2)} is VALID [2022-04-28 04:53:55,454 INFO L290 TraceCheckUtils]: 19: Hoare triple {3135#(<= ~counter~0 2)} assume !(0 == ~cond); {3135#(<= ~counter~0 2)} is VALID [2022-04-28 04:53:55,454 INFO L290 TraceCheckUtils]: 20: Hoare triple {3135#(<= ~counter~0 2)} assume true; {3135#(<= ~counter~0 2)} is VALID [2022-04-28 04:53:55,455 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3135#(<= ~counter~0 2)} {3135#(<= ~counter~0 2)} #84#return; {3135#(<= ~counter~0 2)} is VALID [2022-04-28 04:53:55,455 INFO L272 TraceCheckUtils]: 22: Hoare triple {3135#(<= ~counter~0 2)} call __VERIFIER_assert((if (~p~0 * ~p~0 + ~r~0 * ~q~0) % 4294967296 == ~n~0 * ~q~0 % 4294967296 then 1 else 0)); {3135#(<= ~counter~0 2)} is VALID [2022-04-28 04:53:55,456 INFO L290 TraceCheckUtils]: 23: Hoare triple {3135#(<= ~counter~0 2)} ~cond := #in~cond; {3135#(<= ~counter~0 2)} is VALID [2022-04-28 04:53:55,456 INFO L290 TraceCheckUtils]: 24: Hoare triple {3135#(<= ~counter~0 2)} assume !(0 == ~cond); {3135#(<= ~counter~0 2)} is VALID [2022-04-28 04:53:55,456 INFO L290 TraceCheckUtils]: 25: Hoare triple {3135#(<= ~counter~0 2)} assume true; {3135#(<= ~counter~0 2)} is VALID [2022-04-28 04:53:55,457 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {3135#(<= ~counter~0 2)} {3135#(<= ~counter~0 2)} #86#return; {3135#(<= ~counter~0 2)} is VALID [2022-04-28 04:53:55,458 INFO L272 TraceCheckUtils]: 27: Hoare triple {3135#(<= ~counter~0 2)} 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)); {3135#(<= ~counter~0 2)} is VALID [2022-04-28 04:53:55,458 INFO L290 TraceCheckUtils]: 28: Hoare triple {3135#(<= ~counter~0 2)} ~cond := #in~cond; {3135#(<= ~counter~0 2)} is VALID [2022-04-28 04:53:55,458 INFO L290 TraceCheckUtils]: 29: Hoare triple {3135#(<= ~counter~0 2)} assume !(0 == ~cond); {3135#(<= ~counter~0 2)} is VALID [2022-04-28 04:53:55,458 INFO L290 TraceCheckUtils]: 30: Hoare triple {3135#(<= ~counter~0 2)} assume true; {3135#(<= ~counter~0 2)} is VALID [2022-04-28 04:53:55,459 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {3135#(<= ~counter~0 2)} {3135#(<= ~counter~0 2)} #88#return; {3135#(<= ~counter~0 2)} is VALID [2022-04-28 04:53:55,460 INFO L272 TraceCheckUtils]: 32: Hoare triple {3135#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == (~h~0 * ~h~0 * ~n~0 - 4 * ~h~0 * ~n~0 * ~p~0 + 4 * (~n~0 * ~n~0) * ~q~0 - ~n~0 * ~q~0 * ~q~0 - ~h~0 * ~h~0 * ~r~0 + 4 * ~h~0 * ~p~0 * ~r~0 - 8 * ~n~0 * ~q~0 * ~r~0 + ~q~0 * ~q~0 * ~r~0 + 4 * ~q~0 * ~r~0 * ~r~0) % 4294967296 then 1 else 0)); {3135#(<= ~counter~0 2)} is VALID [2022-04-28 04:53:55,460 INFO L290 TraceCheckUtils]: 33: Hoare triple {3135#(<= ~counter~0 2)} ~cond := #in~cond; {3135#(<= ~counter~0 2)} is VALID [2022-04-28 04:53:55,460 INFO L290 TraceCheckUtils]: 34: Hoare triple {3135#(<= ~counter~0 2)} assume !(0 == ~cond); {3135#(<= ~counter~0 2)} is VALID [2022-04-28 04:53:55,461 INFO L290 TraceCheckUtils]: 35: Hoare triple {3135#(<= ~counter~0 2)} assume true; {3135#(<= ~counter~0 2)} is VALID [2022-04-28 04:53:55,461 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3135#(<= ~counter~0 2)} {3135#(<= ~counter~0 2)} #90#return; {3135#(<= ~counter~0 2)} is VALID [2022-04-28 04:53:55,462 INFO L272 TraceCheckUtils]: 37: Hoare triple {3135#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == (~h~0 * ~h~0 * ~p~0 - 4 * ~h~0 * ~n~0 * ~q~0 + 4 * ~n~0 * ~p~0 * ~q~0 - ~p~0 * ~q~0 * ~q~0 + 4 * ~h~0 * ~q~0 * ~r~0 - 4 * ~p~0 * ~q~0 * ~r~0) % 4294967296 then 1 else 0)); {3135#(<= ~counter~0 2)} is VALID [2022-04-28 04:53:55,462 INFO L290 TraceCheckUtils]: 38: Hoare triple {3135#(<= ~counter~0 2)} ~cond := #in~cond; {3135#(<= ~counter~0 2)} is VALID [2022-04-28 04:53:55,462 INFO L290 TraceCheckUtils]: 39: Hoare triple {3135#(<= ~counter~0 2)} assume !(0 == ~cond); {3135#(<= ~counter~0 2)} is VALID [2022-04-28 04:53:55,463 INFO L290 TraceCheckUtils]: 40: Hoare triple {3135#(<= ~counter~0 2)} assume true; {3135#(<= ~counter~0 2)} is VALID [2022-04-28 04:53:55,463 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {3135#(<= ~counter~0 2)} {3135#(<= ~counter~0 2)} #92#return; {3135#(<= ~counter~0 2)} is VALID [2022-04-28 04:53:55,464 INFO L272 TraceCheckUtils]: 42: Hoare triple {3135#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == (~p~0 * ~p~0 - ~n~0 * ~q~0 + ~q~0 * ~r~0) % 4294967296 then 1 else 0)); {3135#(<= ~counter~0 2)} is VALID [2022-04-28 04:53:55,464 INFO L290 TraceCheckUtils]: 43: Hoare triple {3135#(<= ~counter~0 2)} ~cond := #in~cond; {3135#(<= ~counter~0 2)} is VALID [2022-04-28 04:53:55,464 INFO L290 TraceCheckUtils]: 44: Hoare triple {3135#(<= ~counter~0 2)} assume !(0 == ~cond); {3135#(<= ~counter~0 2)} is VALID [2022-04-28 04:53:55,465 INFO L290 TraceCheckUtils]: 45: Hoare triple {3135#(<= ~counter~0 2)} assume true; {3135#(<= ~counter~0 2)} is VALID [2022-04-28 04:53:55,465 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {3135#(<= ~counter~0 2)} {3135#(<= ~counter~0 2)} #94#return; {3135#(<= ~counter~0 2)} is VALID [2022-04-28 04:53:55,465 INFO L290 TraceCheckUtils]: 47: Hoare triple {3135#(<= ~counter~0 2)} assume !!(1 != ~q~0 % 4294967296);~q~0 := (if ~q~0 % 4294967296 < 0 && 0 != ~q~0 % 4294967296 % 4 then 1 + ~q~0 % 4294967296 / 4 else ~q~0 % 4294967296 / 4);~h~0 := ~p~0 + ~q~0;~p~0 := (if ~p~0 % 4294967296 < 0 && 0 != ~p~0 % 4294967296 % 2 then 1 + ~p~0 % 4294967296 / 2 else ~p~0 % 4294967296 / 2); {3135#(<= ~counter~0 2)} is VALID [2022-04-28 04:53:55,466 INFO L290 TraceCheckUtils]: 48: Hoare triple {3135#(<= ~counter~0 2)} assume ~r~0 % 4294967296 >= ~h~0 % 4294967296;~p~0 := ~p~0 + ~q~0;~r~0 := ~r~0 - ~h~0; {3135#(<= ~counter~0 2)} is VALID [2022-04-28 04:53:55,466 INFO L290 TraceCheckUtils]: 49: Hoare triple {3135#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3238#(<= |main_#t~post6| 2)} is VALID [2022-04-28 04:53:55,467 INFO L290 TraceCheckUtils]: 50: Hoare triple {3238#(<= |main_#t~post6| 2)} assume !(#t~post6 < 50);havoc #t~post6; {3084#false} is VALID [2022-04-28 04:53:55,467 INFO L272 TraceCheckUtils]: 51: Hoare triple {3084#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)); {3084#false} is VALID [2022-04-28 04:53:55,467 INFO L290 TraceCheckUtils]: 52: Hoare triple {3084#false} ~cond := #in~cond; {3084#false} is VALID [2022-04-28 04:53:55,467 INFO L290 TraceCheckUtils]: 53: Hoare triple {3084#false} assume 0 == ~cond; {3084#false} is VALID [2022-04-28 04:53:55,467 INFO L290 TraceCheckUtils]: 54: Hoare triple {3084#false} assume !false; {3084#false} is VALID [2022-04-28 04:53:55,469 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-28 04:53:55,469 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 04:53:55,754 INFO L290 TraceCheckUtils]: 54: Hoare triple {3084#false} assume !false; {3084#false} is VALID [2022-04-28 04:53:55,755 INFO L290 TraceCheckUtils]: 53: Hoare triple {3084#false} assume 0 == ~cond; {3084#false} is VALID [2022-04-28 04:53:55,755 INFO L290 TraceCheckUtils]: 52: Hoare triple {3084#false} ~cond := #in~cond; {3084#false} is VALID [2022-04-28 04:53:55,755 INFO L272 TraceCheckUtils]: 51: Hoare triple {3084#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)); {3084#false} is VALID [2022-04-28 04:53:55,755 INFO L290 TraceCheckUtils]: 50: Hoare triple {3266#(< |main_#t~post6| 50)} assume !(#t~post6 < 50);havoc #t~post6; {3084#false} is VALID [2022-04-28 04:53:55,755 INFO L290 TraceCheckUtils]: 49: Hoare triple {3270#(< ~counter~0 50)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3266#(< |main_#t~post6| 50)} is VALID [2022-04-28 04:53:55,756 INFO L290 TraceCheckUtils]: 48: Hoare triple {3270#(< ~counter~0 50)} assume ~r~0 % 4294967296 >= ~h~0 % 4294967296;~p~0 := ~p~0 + ~q~0;~r~0 := ~r~0 - ~h~0; {3270#(< ~counter~0 50)} is VALID [2022-04-28 04:53:55,756 INFO L290 TraceCheckUtils]: 47: Hoare triple {3270#(< ~counter~0 50)} assume !!(1 != ~q~0 % 4294967296);~q~0 := (if ~q~0 % 4294967296 < 0 && 0 != ~q~0 % 4294967296 % 4 then 1 + ~q~0 % 4294967296 / 4 else ~q~0 % 4294967296 / 4);~h~0 := ~p~0 + ~q~0;~p~0 := (if ~p~0 % 4294967296 < 0 && 0 != ~p~0 % 4294967296 % 2 then 1 + ~p~0 % 4294967296 / 2 else ~p~0 % 4294967296 / 2); {3270#(< ~counter~0 50)} is VALID [2022-04-28 04:53:55,757 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {3083#true} {3270#(< ~counter~0 50)} #94#return; {3270#(< ~counter~0 50)} is VALID [2022-04-28 04:53:55,757 INFO L290 TraceCheckUtils]: 45: Hoare triple {3083#true} assume true; {3083#true} is VALID [2022-04-28 04:53:55,757 INFO L290 TraceCheckUtils]: 44: Hoare triple {3083#true} assume !(0 == ~cond); {3083#true} is VALID [2022-04-28 04:53:55,757 INFO L290 TraceCheckUtils]: 43: Hoare triple {3083#true} ~cond := #in~cond; {3083#true} is VALID [2022-04-28 04:53:55,757 INFO L272 TraceCheckUtils]: 42: Hoare triple {3270#(< ~counter~0 50)} call __VERIFIER_assert((if 0 == (~p~0 * ~p~0 - ~n~0 * ~q~0 + ~q~0 * ~r~0) % 4294967296 then 1 else 0)); {3083#true} is VALID [2022-04-28 04:53:55,758 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {3083#true} {3270#(< ~counter~0 50)} #92#return; {3270#(< ~counter~0 50)} is VALID [2022-04-28 04:53:55,758 INFO L290 TraceCheckUtils]: 40: Hoare triple {3083#true} assume true; {3083#true} is VALID [2022-04-28 04:53:55,758 INFO L290 TraceCheckUtils]: 39: Hoare triple {3083#true} assume !(0 == ~cond); {3083#true} is VALID [2022-04-28 04:53:55,758 INFO L290 TraceCheckUtils]: 38: Hoare triple {3083#true} ~cond := #in~cond; {3083#true} is VALID [2022-04-28 04:53:55,758 INFO L272 TraceCheckUtils]: 37: Hoare triple {3270#(< ~counter~0 50)} call __VERIFIER_assert((if 0 == (~h~0 * ~h~0 * ~p~0 - 4 * ~h~0 * ~n~0 * ~q~0 + 4 * ~n~0 * ~p~0 * ~q~0 - ~p~0 * ~q~0 * ~q~0 + 4 * ~h~0 * ~q~0 * ~r~0 - 4 * ~p~0 * ~q~0 * ~r~0) % 4294967296 then 1 else 0)); {3083#true} is VALID [2022-04-28 04:53:55,758 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3083#true} {3270#(< ~counter~0 50)} #90#return; {3270#(< ~counter~0 50)} is VALID [2022-04-28 04:53:55,759 INFO L290 TraceCheckUtils]: 35: Hoare triple {3083#true} assume true; {3083#true} is VALID [2022-04-28 04:53:55,759 INFO L290 TraceCheckUtils]: 34: Hoare triple {3083#true} assume !(0 == ~cond); {3083#true} is VALID [2022-04-28 04:53:55,759 INFO L290 TraceCheckUtils]: 33: Hoare triple {3083#true} ~cond := #in~cond; {3083#true} is VALID [2022-04-28 04:53:55,759 INFO L272 TraceCheckUtils]: 32: Hoare triple {3270#(< ~counter~0 50)} call __VERIFIER_assert((if 0 == (~h~0 * ~h~0 * ~n~0 - 4 * ~h~0 * ~n~0 * ~p~0 + 4 * (~n~0 * ~n~0) * ~q~0 - ~n~0 * ~q~0 * ~q~0 - ~h~0 * ~h~0 * ~r~0 + 4 * ~h~0 * ~p~0 * ~r~0 - 8 * ~n~0 * ~q~0 * ~r~0 + ~q~0 * ~q~0 * ~r~0 + 4 * ~q~0 * ~r~0 * ~r~0) % 4294967296 then 1 else 0)); {3083#true} is VALID [2022-04-28 04:53:55,759 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {3083#true} {3270#(< ~counter~0 50)} #88#return; {3270#(< ~counter~0 50)} is VALID [2022-04-28 04:53:55,759 INFO L290 TraceCheckUtils]: 30: Hoare triple {3083#true} assume true; {3083#true} is VALID [2022-04-28 04:53:55,761 INFO L290 TraceCheckUtils]: 29: Hoare triple {3083#true} assume !(0 == ~cond); {3083#true} is VALID [2022-04-28 04:53:55,761 INFO L290 TraceCheckUtils]: 28: Hoare triple {3083#true} ~cond := #in~cond; {3083#true} is VALID [2022-04-28 04:53:55,761 INFO L272 TraceCheckUtils]: 27: Hoare triple {3270#(< ~counter~0 50)} 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)); {3083#true} is VALID [2022-04-28 04:53:55,762 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {3083#true} {3270#(< ~counter~0 50)} #86#return; {3270#(< ~counter~0 50)} is VALID [2022-04-28 04:53:55,762 INFO L290 TraceCheckUtils]: 25: Hoare triple {3083#true} assume true; {3083#true} is VALID [2022-04-28 04:53:55,762 INFO L290 TraceCheckUtils]: 24: Hoare triple {3083#true} assume !(0 == ~cond); {3083#true} is VALID [2022-04-28 04:53:55,762 INFO L290 TraceCheckUtils]: 23: Hoare triple {3083#true} ~cond := #in~cond; {3083#true} is VALID [2022-04-28 04:53:55,762 INFO L272 TraceCheckUtils]: 22: Hoare triple {3270#(< ~counter~0 50)} call __VERIFIER_assert((if (~p~0 * ~p~0 + ~r~0 * ~q~0) % 4294967296 == ~n~0 * ~q~0 % 4294967296 then 1 else 0)); {3083#true} is VALID [2022-04-28 04:53:55,763 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3083#true} {3270#(< ~counter~0 50)} #84#return; {3270#(< ~counter~0 50)} is VALID [2022-04-28 04:53:55,763 INFO L290 TraceCheckUtils]: 20: Hoare triple {3083#true} assume true; {3083#true} is VALID [2022-04-28 04:53:55,763 INFO L290 TraceCheckUtils]: 19: Hoare triple {3083#true} assume !(0 == ~cond); {3083#true} is VALID [2022-04-28 04:53:55,763 INFO L290 TraceCheckUtils]: 18: Hoare triple {3083#true} ~cond := #in~cond; {3083#true} is VALID [2022-04-28 04:53:55,763 INFO L272 TraceCheckUtils]: 17: Hoare triple {3270#(< ~counter~0 50)} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {3083#true} is VALID [2022-04-28 04:53:55,763 INFO L290 TraceCheckUtils]: 16: Hoare triple {3270#(< ~counter~0 50)} assume !!(#t~post6 < 50);havoc #t~post6; {3270#(< ~counter~0 50)} is VALID [2022-04-28 04:53:55,764 INFO L290 TraceCheckUtils]: 15: Hoare triple {3373#(< ~counter~0 49)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3270#(< ~counter~0 50)} is VALID [2022-04-28 04:53:55,764 INFO L290 TraceCheckUtils]: 14: Hoare triple {3373#(< ~counter~0 49)} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {3373#(< ~counter~0 49)} is VALID [2022-04-28 04:53:55,765 INFO L290 TraceCheckUtils]: 13: Hoare triple {3373#(< ~counter~0 49)} assume !!(#t~post5 < 50);havoc #t~post5; {3373#(< ~counter~0 49)} is VALID [2022-04-28 04:53:55,766 INFO L290 TraceCheckUtils]: 12: Hoare triple {3383#(< ~counter~0 48)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3373#(< ~counter~0 49)} is VALID [2022-04-28 04:53:55,766 INFO L290 TraceCheckUtils]: 11: Hoare triple {3383#(< ~counter~0 48)} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {3383#(< ~counter~0 48)} is VALID [2022-04-28 04:53:55,767 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3083#true} {3383#(< ~counter~0 48)} #82#return; {3383#(< ~counter~0 48)} is VALID [2022-04-28 04:53:55,767 INFO L290 TraceCheckUtils]: 9: Hoare triple {3083#true} assume true; {3083#true} is VALID [2022-04-28 04:53:55,767 INFO L290 TraceCheckUtils]: 8: Hoare triple {3083#true} assume !(0 == ~cond); {3083#true} is VALID [2022-04-28 04:53:55,767 INFO L290 TraceCheckUtils]: 7: Hoare triple {3083#true} ~cond := #in~cond; {3083#true} is VALID [2022-04-28 04:53:55,767 INFO L272 TraceCheckUtils]: 6: Hoare triple {3383#(< ~counter~0 48)} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {3083#true} is VALID [2022-04-28 04:53:55,767 INFO L290 TraceCheckUtils]: 5: Hoare triple {3383#(< ~counter~0 48)} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {3383#(< ~counter~0 48)} is VALID [2022-04-28 04:53:55,768 INFO L272 TraceCheckUtils]: 4: Hoare triple {3383#(< ~counter~0 48)} call #t~ret7 := main(); {3383#(< ~counter~0 48)} is VALID [2022-04-28 04:53:55,768 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3383#(< ~counter~0 48)} {3083#true} #102#return; {3383#(< ~counter~0 48)} is VALID [2022-04-28 04:53:55,768 INFO L290 TraceCheckUtils]: 2: Hoare triple {3383#(< ~counter~0 48)} assume true; {3383#(< ~counter~0 48)} is VALID [2022-04-28 04:53:55,769 INFO L290 TraceCheckUtils]: 1: Hoare triple {3083#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; {3383#(< ~counter~0 48)} is VALID [2022-04-28 04:53:55,769 INFO L272 TraceCheckUtils]: 0: Hoare triple {3083#true} call ULTIMATE.init(); {3083#true} is VALID [2022-04-28 04:53:55,769 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-28 04:53:55,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:53:55,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683671265] [2022-04-28 04:53:55,769 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 04:53:55,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1854289764] [2022-04-28 04:53:55,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1854289764] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 04:53:55,770 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 04:53:55,770 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-28 04:53:55,770 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:53:55,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2016440381] [2022-04-28 04:53:55,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2016440381] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:53:55,770 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:53:55,770 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 04:53:55,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158089282] [2022-04-28 04:53:55,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:53:55,771 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 4 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) Word has length 55 [2022-04-28 04:53:55,771 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:53:55,771 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 4 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-28 04:53:55,805 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:53:55,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 04:53:55,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:53:55,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 04:53:55,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-28 04:53:55,806 INFO L87 Difference]: Start difference. First operand 85 states and 113 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 4 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-28 04:53:57,562 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 04:54:02,174 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-28 04:54:06,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:54:06,459 INFO L93 Difference]: Finished difference Result 111 states and 143 transitions. [2022-04-28 04:54:06,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 04:54:06,459 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 4 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) Word has length 55 [2022-04-28 04:54:06,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:54:06,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 4 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-28 04:54:06,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 87 transitions. [2022-04-28 04:54:06,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 4 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-28 04:54:06,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 87 transitions. [2022-04-28 04:54:06,462 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 87 transitions. [2022-04-28 04:54:06,533 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-28 04:54:06,534 INFO L225 Difference]: With dead ends: 111 [2022-04-28 04:54:06,534 INFO L226 Difference]: Without dead ends: 101 [2022-04-28 04:54:06,535 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-04-28 04:54:06,535 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 13 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-04-28 04:54:06,535 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 154 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 25 Invalid, 1 Unknown, 0 Unchecked, 3.7s Time] [2022-04-28 04:54:06,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-04-28 04:54:06,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 95. [2022-04-28 04:54:06,610 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:54:06,611 INFO L82 GeneralOperation]: Start isEquivalent. First operand 101 states. Second operand has 95 states, 54 states have (on average 1.1851851851851851) internal successors, (64), 56 states have internal predecessors, (64), 31 states have call successors, (31), 10 states have call predecessors, (31), 9 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-28 04:54:06,611 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand has 95 states, 54 states have (on average 1.1851851851851851) internal successors, (64), 56 states have internal predecessors, (64), 31 states have call successors, (31), 10 states have call predecessors, (31), 9 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-28 04:54:06,611 INFO L87 Difference]: Start difference. First operand 101 states. Second operand has 95 states, 54 states have (on average 1.1851851851851851) internal successors, (64), 56 states have internal predecessors, (64), 31 states have call successors, (31), 10 states have call predecessors, (31), 9 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-28 04:54:06,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:54:06,614 INFO L93 Difference]: Finished difference Result 101 states and 130 transitions. [2022-04-28 04:54:06,614 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 130 transitions. [2022-04-28 04:54:06,614 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:54:06,614 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:54:06,615 INFO L74 IsIncluded]: Start isIncluded. First operand has 95 states, 54 states have (on average 1.1851851851851851) internal successors, (64), 56 states have internal predecessors, (64), 31 states have call successors, (31), 10 states have call predecessors, (31), 9 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand 101 states. [2022-04-28 04:54:06,615 INFO L87 Difference]: Start difference. First operand has 95 states, 54 states have (on average 1.1851851851851851) internal successors, (64), 56 states have internal predecessors, (64), 31 states have call successors, (31), 10 states have call predecessors, (31), 9 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand 101 states. [2022-04-28 04:54:06,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:54:06,617 INFO L93 Difference]: Finished difference Result 101 states and 130 transitions. [2022-04-28 04:54:06,618 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 130 transitions. [2022-04-28 04:54:06,618 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:54:06,618 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:54:06,618 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:54:06,618 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:54:06,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 54 states have (on average 1.1851851851851851) internal successors, (64), 56 states have internal predecessors, (64), 31 states have call successors, (31), 10 states have call predecessors, (31), 9 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-28 04:54:06,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 123 transitions. [2022-04-28 04:54:06,621 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 123 transitions. Word has length 55 [2022-04-28 04:54:06,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:54:06,622 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 123 transitions. [2022-04-28 04:54:06,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 4 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-28 04:54:06,622 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 95 states and 123 transitions. [2022-04-28 04:54:09,186 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 122 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 04:54:09,187 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 123 transitions. [2022-04-28 04:54:09,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-28 04:54:09,187 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:54:09,188 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 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, 1] [2022-04-28 04:54:09,193 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-28 04:54:09,392 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-28 04:54:09,396 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:54:09,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:54:09,396 INFO L85 PathProgramCache]: Analyzing trace with hash 638253009, now seen corresponding path program 1 times [2022-04-28 04:54:09,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:54:09,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1959519696] [2022-04-28 04:54:09,397 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 04:54:09,397 INFO L85 PathProgramCache]: Analyzing trace with hash 638253009, now seen corresponding path program 2 times [2022-04-28 04:54:09,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:54:09,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701756058] [2022-04-28 04:54:09,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:54:09,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:54:09,415 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 04:54:09,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [314318274] [2022-04-28 04:54:09,415 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 04:54:09,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:54:09,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:54:09,416 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-28 04:54:09,417 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-28 04:54:09,475 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 04:54:09,475 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:54:09,476 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-28 04:54:09,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:54:09,491 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:54:09,711 INFO L272 TraceCheckUtils]: 0: Hoare triple {4038#true} call ULTIMATE.init(); {4038#true} is VALID [2022-04-28 04:54:09,711 INFO L290 TraceCheckUtils]: 1: Hoare triple {4038#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; {4038#true} is VALID [2022-04-28 04:54:09,711 INFO L290 TraceCheckUtils]: 2: Hoare triple {4038#true} assume true; {4038#true} is VALID [2022-04-28 04:54:09,711 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4038#true} {4038#true} #102#return; {4038#true} is VALID [2022-04-28 04:54:09,711 INFO L272 TraceCheckUtils]: 4: Hoare triple {4038#true} call #t~ret7 := main(); {4038#true} is VALID [2022-04-28 04:54:09,711 INFO L290 TraceCheckUtils]: 5: Hoare triple {4038#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {4038#true} is VALID [2022-04-28 04:54:09,711 INFO L272 TraceCheckUtils]: 6: Hoare triple {4038#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {4038#true} is VALID [2022-04-28 04:54:09,711 INFO L290 TraceCheckUtils]: 7: Hoare triple {4038#true} ~cond := #in~cond; {4038#true} is VALID [2022-04-28 04:54:09,712 INFO L290 TraceCheckUtils]: 8: Hoare triple {4038#true} assume !(0 == ~cond); {4038#true} is VALID [2022-04-28 04:54:09,712 INFO L290 TraceCheckUtils]: 9: Hoare triple {4038#true} assume true; {4038#true} is VALID [2022-04-28 04:54:09,712 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4038#true} {4038#true} #82#return; {4038#true} is VALID [2022-04-28 04:54:09,712 INFO L290 TraceCheckUtils]: 11: Hoare triple {4038#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {4076#(= main_~q~0 1)} is VALID [2022-04-28 04:54:09,712 INFO L290 TraceCheckUtils]: 12: Hoare triple {4076#(= main_~q~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4076#(= main_~q~0 1)} is VALID [2022-04-28 04:54:09,713 INFO L290 TraceCheckUtils]: 13: Hoare triple {4076#(= main_~q~0 1)} assume !!(#t~post5 < 50);havoc #t~post5; {4076#(= main_~q~0 1)} is VALID [2022-04-28 04:54:09,713 INFO L290 TraceCheckUtils]: 14: Hoare triple {4076#(= main_~q~0 1)} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {4076#(= main_~q~0 1)} is VALID [2022-04-28 04:54:09,713 INFO L290 TraceCheckUtils]: 15: Hoare triple {4076#(= main_~q~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4076#(= main_~q~0 1)} is VALID [2022-04-28 04:54:09,713 INFO L290 TraceCheckUtils]: 16: Hoare triple {4076#(= main_~q~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {4076#(= main_~q~0 1)} is VALID [2022-04-28 04:54:09,714 INFO L272 TraceCheckUtils]: 17: Hoare triple {4076#(= main_~q~0 1)} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {4038#true} is VALID [2022-04-28 04:54:09,714 INFO L290 TraceCheckUtils]: 18: Hoare triple {4038#true} ~cond := #in~cond; {4038#true} is VALID [2022-04-28 04:54:09,714 INFO L290 TraceCheckUtils]: 19: Hoare triple {4038#true} assume !(0 == ~cond); {4038#true} is VALID [2022-04-28 04:54:09,714 INFO L290 TraceCheckUtils]: 20: Hoare triple {4038#true} assume true; {4038#true} is VALID [2022-04-28 04:54:09,714 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {4038#true} {4076#(= main_~q~0 1)} #84#return; {4076#(= main_~q~0 1)} is VALID [2022-04-28 04:54:09,714 INFO L272 TraceCheckUtils]: 22: Hoare triple {4076#(= 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)); {4038#true} is VALID [2022-04-28 04:54:09,715 INFO L290 TraceCheckUtils]: 23: Hoare triple {4038#true} ~cond := #in~cond; {4038#true} is VALID [2022-04-28 04:54:09,715 INFO L290 TraceCheckUtils]: 24: Hoare triple {4038#true} assume !(0 == ~cond); {4038#true} is VALID [2022-04-28 04:54:09,715 INFO L290 TraceCheckUtils]: 25: Hoare triple {4038#true} assume true; {4038#true} is VALID [2022-04-28 04:54:09,715 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {4038#true} {4076#(= main_~q~0 1)} #86#return; {4076#(= main_~q~0 1)} is VALID [2022-04-28 04:54:09,715 INFO L272 TraceCheckUtils]: 27: Hoare triple {4076#(= 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)); {4038#true} is VALID [2022-04-28 04:54:09,715 INFO L290 TraceCheckUtils]: 28: Hoare triple {4038#true} ~cond := #in~cond; {4038#true} is VALID [2022-04-28 04:54:09,715 INFO L290 TraceCheckUtils]: 29: Hoare triple {4038#true} assume !(0 == ~cond); {4038#true} is VALID [2022-04-28 04:54:09,716 INFO L290 TraceCheckUtils]: 30: Hoare triple {4038#true} assume true; {4038#true} is VALID [2022-04-28 04:54:09,716 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {4038#true} {4076#(= main_~q~0 1)} #88#return; {4076#(= main_~q~0 1)} is VALID [2022-04-28 04:54:09,716 INFO L272 TraceCheckUtils]: 32: Hoare triple {4076#(= main_~q~0 1)} call __VERIFIER_assert((if 0 == (~h~0 * ~h~0 * ~n~0 - 4 * ~h~0 * ~n~0 * ~p~0 + 4 * (~n~0 * ~n~0) * ~q~0 - ~n~0 * ~q~0 * ~q~0 - ~h~0 * ~h~0 * ~r~0 + 4 * ~h~0 * ~p~0 * ~r~0 - 8 * ~n~0 * ~q~0 * ~r~0 + ~q~0 * ~q~0 * ~r~0 + 4 * ~q~0 * ~r~0 * ~r~0) % 4294967296 then 1 else 0)); {4038#true} is VALID [2022-04-28 04:54:09,716 INFO L290 TraceCheckUtils]: 33: Hoare triple {4038#true} ~cond := #in~cond; {4038#true} is VALID [2022-04-28 04:54:09,716 INFO L290 TraceCheckUtils]: 34: Hoare triple {4038#true} assume !(0 == ~cond); {4038#true} is VALID [2022-04-28 04:54:09,716 INFO L290 TraceCheckUtils]: 35: Hoare triple {4038#true} assume true; {4038#true} is VALID [2022-04-28 04:54:09,717 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {4038#true} {4076#(= main_~q~0 1)} #90#return; {4076#(= main_~q~0 1)} is VALID [2022-04-28 04:54:09,717 INFO L272 TraceCheckUtils]: 37: Hoare triple {4076#(= main_~q~0 1)} call __VERIFIER_assert((if 0 == (~h~0 * ~h~0 * ~p~0 - 4 * ~h~0 * ~n~0 * ~q~0 + 4 * ~n~0 * ~p~0 * ~q~0 - ~p~0 * ~q~0 * ~q~0 + 4 * ~h~0 * ~q~0 * ~r~0 - 4 * ~p~0 * ~q~0 * ~r~0) % 4294967296 then 1 else 0)); {4038#true} is VALID [2022-04-28 04:54:09,717 INFO L290 TraceCheckUtils]: 38: Hoare triple {4038#true} ~cond := #in~cond; {4038#true} is VALID [2022-04-28 04:54:09,717 INFO L290 TraceCheckUtils]: 39: Hoare triple {4038#true} assume !(0 == ~cond); {4038#true} is VALID [2022-04-28 04:54:09,717 INFO L290 TraceCheckUtils]: 40: Hoare triple {4038#true} assume true; {4038#true} is VALID [2022-04-28 04:54:09,718 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {4038#true} {4076#(= main_~q~0 1)} #92#return; {4076#(= main_~q~0 1)} is VALID [2022-04-28 04:54:09,718 INFO L272 TraceCheckUtils]: 42: Hoare triple {4076#(= main_~q~0 1)} call __VERIFIER_assert((if 0 == (~p~0 * ~p~0 - ~n~0 * ~q~0 + ~q~0 * ~r~0) % 4294967296 then 1 else 0)); {4038#true} is VALID [2022-04-28 04:54:09,718 INFO L290 TraceCheckUtils]: 43: Hoare triple {4038#true} ~cond := #in~cond; {4038#true} is VALID [2022-04-28 04:54:09,718 INFO L290 TraceCheckUtils]: 44: Hoare triple {4038#true} assume !(0 == ~cond); {4038#true} is VALID [2022-04-28 04:54:09,718 INFO L290 TraceCheckUtils]: 45: Hoare triple {4038#true} assume true; {4038#true} is VALID [2022-04-28 04:54:09,719 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {4038#true} {4076#(= main_~q~0 1)} #94#return; {4076#(= main_~q~0 1)} is VALID [2022-04-28 04:54:09,719 INFO L290 TraceCheckUtils]: 47: Hoare triple {4076#(= main_~q~0 1)} assume !!(1 != ~q~0 % 4294967296);~q~0 := (if ~q~0 % 4294967296 < 0 && 0 != ~q~0 % 4294967296 % 4 then 1 + ~q~0 % 4294967296 / 4 else ~q~0 % 4294967296 / 4);~h~0 := ~p~0 + ~q~0;~p~0 := (if ~p~0 % 4294967296 < 0 && 0 != ~p~0 % 4294967296 % 2 then 1 + ~p~0 % 4294967296 / 2 else ~p~0 % 4294967296 / 2); {4039#false} is VALID [2022-04-28 04:54:09,719 INFO L290 TraceCheckUtils]: 48: Hoare triple {4039#false} assume ~r~0 % 4294967296 >= ~h~0 % 4294967296;~p~0 := ~p~0 + ~q~0;~r~0 := ~r~0 - ~h~0; {4039#false} is VALID [2022-04-28 04:54:09,719 INFO L290 TraceCheckUtils]: 49: Hoare triple {4039#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4039#false} is VALID [2022-04-28 04:54:09,719 INFO L290 TraceCheckUtils]: 50: Hoare triple {4039#false} assume !!(#t~post6 < 50);havoc #t~post6; {4039#false} is VALID [2022-04-28 04:54:09,719 INFO L272 TraceCheckUtils]: 51: Hoare triple {4039#false} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {4039#false} is VALID [2022-04-28 04:54:09,719 INFO L290 TraceCheckUtils]: 52: Hoare triple {4039#false} ~cond := #in~cond; {4039#false} is VALID [2022-04-28 04:54:09,720 INFO L290 TraceCheckUtils]: 53: Hoare triple {4039#false} assume 0 == ~cond; {4039#false} is VALID [2022-04-28 04:54:09,720 INFO L290 TraceCheckUtils]: 54: Hoare triple {4039#false} assume !false; {4039#false} is VALID [2022-04-28 04:54:09,720 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-28 04:54:09,720 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 04:54:09,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:54:09,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701756058] [2022-04-28 04:54:09,720 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 04:54:09,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [314318274] [2022-04-28 04:54:09,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [314318274] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:54:09,720 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:54:09,720 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 04:54:09,721 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:54:09,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1959519696] [2022-04-28 04:54:09,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1959519696] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:54:09,721 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:54:09,721 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 04:54:09,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994456210] [2022-04-28 04:54:09,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:54:09,721 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 3 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 55 [2022-04-28 04:54:09,721 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:54:09,722 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 3 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-28 04:54:09,756 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:54:09,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 04:54:09,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:54:09,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 04:54:09,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 04:54:09,757 INFO L87 Difference]: Start difference. First operand 95 states and 123 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 3 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-28 04:54:12,318 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-28 04:54:13,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:54:13,219 INFO L93 Difference]: Finished difference Result 129 states and 175 transitions. [2022-04-28 04:54:13,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 04:54:13,220 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 3 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 55 [2022-04-28 04:54:13,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:54:13,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 3 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-28 04:54:13,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2022-04-28 04:54:13,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 3 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-28 04:54:13,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2022-04-28 04:54:13,230 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 93 transitions. [2022-04-28 04:54:13,318 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:54:13,320 INFO L225 Difference]: With dead ends: 129 [2022-04-28 04:54:13,320 INFO L226 Difference]: Without dead ends: 69 [2022-04-28 04:54:13,320 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 53 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-28 04:54:13,321 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 0 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-04-28 04:54:13,321 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 81 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 1 Unknown, 0 Unchecked, 2.6s Time] [2022-04-28 04:54:13,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-04-28 04:54:13,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2022-04-28 04:54:13,349 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:54:13,349 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand has 69 states, 37 states have (on average 1.2162162162162162) internal successors, (45), 39 states have internal predecessors, (45), 25 states have call successors, (25), 7 states have call predecessors, (25), 6 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-28 04:54:13,349 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand has 69 states, 37 states have (on average 1.2162162162162162) internal successors, (45), 39 states have internal predecessors, (45), 25 states have call successors, (25), 7 states have call predecessors, (25), 6 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-28 04:54:13,350 INFO L87 Difference]: Start difference. First operand 69 states. Second operand has 69 states, 37 states have (on average 1.2162162162162162) internal successors, (45), 39 states have internal predecessors, (45), 25 states have call successors, (25), 7 states have call predecessors, (25), 6 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-28 04:54:13,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:54:13,351 INFO L93 Difference]: Finished difference Result 69 states and 92 transitions. [2022-04-28 04:54:13,352 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 92 transitions. [2022-04-28 04:54:13,352 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:54:13,352 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:54:13,352 INFO L74 IsIncluded]: Start isIncluded. First operand has 69 states, 37 states have (on average 1.2162162162162162) internal successors, (45), 39 states have internal predecessors, (45), 25 states have call successors, (25), 7 states have call predecessors, (25), 6 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand 69 states. [2022-04-28 04:54:13,352 INFO L87 Difference]: Start difference. First operand has 69 states, 37 states have (on average 1.2162162162162162) internal successors, (45), 39 states have internal predecessors, (45), 25 states have call successors, (25), 7 states have call predecessors, (25), 6 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand 69 states. [2022-04-28 04:54:13,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:54:13,354 INFO L93 Difference]: Finished difference Result 69 states and 92 transitions. [2022-04-28 04:54:13,354 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 92 transitions. [2022-04-28 04:54:13,354 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:54:13,354 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:54:13,354 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:54:13,354 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:54:13,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 37 states have (on average 1.2162162162162162) internal successors, (45), 39 states have internal predecessors, (45), 25 states have call successors, (25), 7 states have call predecessors, (25), 6 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-28 04:54:13,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 92 transitions. [2022-04-28 04:54:13,356 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 92 transitions. Word has length 55 [2022-04-28 04:54:13,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:54:13,356 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 92 transitions. [2022-04-28 04:54:13,357 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 3 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-28 04:54:13,357 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 69 states and 92 transitions. [2022-04-28 04:54:13,692 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:54:13,692 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 92 transitions. [2022-04-28 04:54:13,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-04-28 04:54:13,693 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:54:13,693 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 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, 1, 1, 1, 1] [2022-04-28 04:54:13,712 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-28 04:54:13,893 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-28 04:54:13,894 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:54:13,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:54:13,894 INFO L85 PathProgramCache]: Analyzing trace with hash 107903087, now seen corresponding path program 1 times [2022-04-28 04:54:13,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:54:13,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2059979192] [2022-04-28 04:54:13,899 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:54:13,900 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-28 04:54:13,900 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 04:54:13,900 INFO L85 PathProgramCache]: Analyzing trace with hash 107903087, now seen corresponding path program 2 times [2022-04-28 04:54:13,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:54:13,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633779921] [2022-04-28 04:54:13,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:54:13,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:54:13,921 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 04:54:13,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1967851038] [2022-04-28 04:54:13,921 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 04:54:13,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:54:13,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:54:13,926 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-28 04:54:13,927 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-28 04:54:13,994 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 04:54:13,994 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:54:13,995 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-28 04:54:14,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:54:14,007 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:54:14,294 INFO L272 TraceCheckUtils]: 0: Hoare triple {4739#true} call ULTIMATE.init(); {4739#true} is VALID [2022-04-28 04:54:14,294 INFO L290 TraceCheckUtils]: 1: Hoare triple {4739#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; {4747#(<= ~counter~0 0)} is VALID [2022-04-28 04:54:14,295 INFO L290 TraceCheckUtils]: 2: Hoare triple {4747#(<= ~counter~0 0)} assume true; {4747#(<= ~counter~0 0)} is VALID [2022-04-28 04:54:14,295 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4747#(<= ~counter~0 0)} {4739#true} #102#return; {4747#(<= ~counter~0 0)} is VALID [2022-04-28 04:54:14,296 INFO L272 TraceCheckUtils]: 4: Hoare triple {4747#(<= ~counter~0 0)} call #t~ret7 := main(); {4747#(<= ~counter~0 0)} is VALID [2022-04-28 04:54:14,296 INFO L290 TraceCheckUtils]: 5: Hoare triple {4747#(<= ~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; {4747#(<= ~counter~0 0)} is VALID [2022-04-28 04:54:14,297 INFO L272 TraceCheckUtils]: 6: Hoare triple {4747#(<= ~counter~0 0)} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {4747#(<= ~counter~0 0)} is VALID [2022-04-28 04:54:14,297 INFO L290 TraceCheckUtils]: 7: Hoare triple {4747#(<= ~counter~0 0)} ~cond := #in~cond; {4747#(<= ~counter~0 0)} is VALID [2022-04-28 04:54:14,298 INFO L290 TraceCheckUtils]: 8: Hoare triple {4747#(<= ~counter~0 0)} assume !(0 == ~cond); {4747#(<= ~counter~0 0)} is VALID [2022-04-28 04:54:14,298 INFO L290 TraceCheckUtils]: 9: Hoare triple {4747#(<= ~counter~0 0)} assume true; {4747#(<= ~counter~0 0)} is VALID [2022-04-28 04:54:14,298 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4747#(<= ~counter~0 0)} {4747#(<= ~counter~0 0)} #82#return; {4747#(<= ~counter~0 0)} is VALID [2022-04-28 04:54:14,299 INFO L290 TraceCheckUtils]: 11: Hoare triple {4747#(<= ~counter~0 0)} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {4747#(<= ~counter~0 0)} is VALID [2022-04-28 04:54:14,300 INFO L290 TraceCheckUtils]: 12: Hoare triple {4747#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4781#(<= ~counter~0 1)} is VALID [2022-04-28 04:54:14,300 INFO L290 TraceCheckUtils]: 13: Hoare triple {4781#(<= ~counter~0 1)} assume !!(#t~post5 < 50);havoc #t~post5; {4781#(<= ~counter~0 1)} is VALID [2022-04-28 04:54:14,300 INFO L290 TraceCheckUtils]: 14: Hoare triple {4781#(<= ~counter~0 1)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {4781#(<= ~counter~0 1)} is VALID [2022-04-28 04:54:14,301 INFO L290 TraceCheckUtils]: 15: Hoare triple {4781#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4791#(<= ~counter~0 2)} is VALID [2022-04-28 04:54:14,301 INFO L290 TraceCheckUtils]: 16: Hoare triple {4791#(<= ~counter~0 2)} assume !!(#t~post5 < 50);havoc #t~post5; {4791#(<= ~counter~0 2)} is VALID [2022-04-28 04:54:14,302 INFO L290 TraceCheckUtils]: 17: Hoare triple {4791#(<= ~counter~0 2)} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {4791#(<= ~counter~0 2)} is VALID [2022-04-28 04:54:14,302 INFO L290 TraceCheckUtils]: 18: Hoare triple {4791#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4801#(<= ~counter~0 3)} is VALID [2022-04-28 04:54:14,303 INFO L290 TraceCheckUtils]: 19: Hoare triple {4801#(<= ~counter~0 3)} assume !!(#t~post6 < 50);havoc #t~post6; {4801#(<= ~counter~0 3)} is VALID [2022-04-28 04:54:14,304 INFO L272 TraceCheckUtils]: 20: Hoare triple {4801#(<= ~counter~0 3)} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {4801#(<= ~counter~0 3)} is VALID [2022-04-28 04:54:14,304 INFO L290 TraceCheckUtils]: 21: Hoare triple {4801#(<= ~counter~0 3)} ~cond := #in~cond; {4801#(<= ~counter~0 3)} is VALID [2022-04-28 04:54:14,304 INFO L290 TraceCheckUtils]: 22: Hoare triple {4801#(<= ~counter~0 3)} assume !(0 == ~cond); {4801#(<= ~counter~0 3)} is VALID [2022-04-28 04:54:14,305 INFO L290 TraceCheckUtils]: 23: Hoare triple {4801#(<= ~counter~0 3)} assume true; {4801#(<= ~counter~0 3)} is VALID [2022-04-28 04:54:14,305 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {4801#(<= ~counter~0 3)} {4801#(<= ~counter~0 3)} #84#return; {4801#(<= ~counter~0 3)} is VALID [2022-04-28 04:54:14,306 INFO L272 TraceCheckUtils]: 25: Hoare triple {4801#(<= ~counter~0 3)} call __VERIFIER_assert((if (~p~0 * ~p~0 + ~r~0 * ~q~0) % 4294967296 == ~n~0 * ~q~0 % 4294967296 then 1 else 0)); {4801#(<= ~counter~0 3)} is VALID [2022-04-28 04:54:14,306 INFO L290 TraceCheckUtils]: 26: Hoare triple {4801#(<= ~counter~0 3)} ~cond := #in~cond; {4801#(<= ~counter~0 3)} is VALID [2022-04-28 04:54:14,307 INFO L290 TraceCheckUtils]: 27: Hoare triple {4801#(<= ~counter~0 3)} assume !(0 == ~cond); {4801#(<= ~counter~0 3)} is VALID [2022-04-28 04:54:14,307 INFO L290 TraceCheckUtils]: 28: Hoare triple {4801#(<= ~counter~0 3)} assume true; {4801#(<= ~counter~0 3)} is VALID [2022-04-28 04:54:14,308 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {4801#(<= ~counter~0 3)} {4801#(<= ~counter~0 3)} #86#return; {4801#(<= ~counter~0 3)} is VALID [2022-04-28 04:54:14,309 INFO L272 TraceCheckUtils]: 30: Hoare triple {4801#(<= ~counter~0 3)} 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)); {4801#(<= ~counter~0 3)} is VALID [2022-04-28 04:54:14,309 INFO L290 TraceCheckUtils]: 31: Hoare triple {4801#(<= ~counter~0 3)} ~cond := #in~cond; {4801#(<= ~counter~0 3)} is VALID [2022-04-28 04:54:14,309 INFO L290 TraceCheckUtils]: 32: Hoare triple {4801#(<= ~counter~0 3)} assume !(0 == ~cond); {4801#(<= ~counter~0 3)} is VALID [2022-04-28 04:54:14,310 INFO L290 TraceCheckUtils]: 33: Hoare triple {4801#(<= ~counter~0 3)} assume true; {4801#(<= ~counter~0 3)} is VALID [2022-04-28 04:54:14,311 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {4801#(<= ~counter~0 3)} {4801#(<= ~counter~0 3)} #88#return; {4801#(<= ~counter~0 3)} is VALID [2022-04-28 04:54:14,311 INFO L272 TraceCheckUtils]: 35: Hoare triple {4801#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == (~h~0 * ~h~0 * ~n~0 - 4 * ~h~0 * ~n~0 * ~p~0 + 4 * (~n~0 * ~n~0) * ~q~0 - ~n~0 * ~q~0 * ~q~0 - ~h~0 * ~h~0 * ~r~0 + 4 * ~h~0 * ~p~0 * ~r~0 - 8 * ~n~0 * ~q~0 * ~r~0 + ~q~0 * ~q~0 * ~r~0 + 4 * ~q~0 * ~r~0 * ~r~0) % 4294967296 then 1 else 0)); {4801#(<= ~counter~0 3)} is VALID [2022-04-28 04:54:14,312 INFO L290 TraceCheckUtils]: 36: Hoare triple {4801#(<= ~counter~0 3)} ~cond := #in~cond; {4801#(<= ~counter~0 3)} is VALID [2022-04-28 04:54:14,312 INFO L290 TraceCheckUtils]: 37: Hoare triple {4801#(<= ~counter~0 3)} assume !(0 == ~cond); {4801#(<= ~counter~0 3)} is VALID [2022-04-28 04:54:14,312 INFO L290 TraceCheckUtils]: 38: Hoare triple {4801#(<= ~counter~0 3)} assume true; {4801#(<= ~counter~0 3)} is VALID [2022-04-28 04:54:14,313 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {4801#(<= ~counter~0 3)} {4801#(<= ~counter~0 3)} #90#return; {4801#(<= ~counter~0 3)} is VALID [2022-04-28 04:54:14,314 INFO L272 TraceCheckUtils]: 40: Hoare triple {4801#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == (~h~0 * ~h~0 * ~p~0 - 4 * ~h~0 * ~n~0 * ~q~0 + 4 * ~n~0 * ~p~0 * ~q~0 - ~p~0 * ~q~0 * ~q~0 + 4 * ~h~0 * ~q~0 * ~r~0 - 4 * ~p~0 * ~q~0 * ~r~0) % 4294967296 then 1 else 0)); {4801#(<= ~counter~0 3)} is VALID [2022-04-28 04:54:14,314 INFO L290 TraceCheckUtils]: 41: Hoare triple {4801#(<= ~counter~0 3)} ~cond := #in~cond; {4801#(<= ~counter~0 3)} is VALID [2022-04-28 04:54:14,315 INFO L290 TraceCheckUtils]: 42: Hoare triple {4801#(<= ~counter~0 3)} assume !(0 == ~cond); {4801#(<= ~counter~0 3)} is VALID [2022-04-28 04:54:14,315 INFO L290 TraceCheckUtils]: 43: Hoare triple {4801#(<= ~counter~0 3)} assume true; {4801#(<= ~counter~0 3)} is VALID [2022-04-28 04:54:14,316 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {4801#(<= ~counter~0 3)} {4801#(<= ~counter~0 3)} #92#return; {4801#(<= ~counter~0 3)} is VALID [2022-04-28 04:54:14,316 INFO L272 TraceCheckUtils]: 45: Hoare triple {4801#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == (~p~0 * ~p~0 - ~n~0 * ~q~0 + ~q~0 * ~r~0) % 4294967296 then 1 else 0)); {4801#(<= ~counter~0 3)} is VALID [2022-04-28 04:54:14,317 INFO L290 TraceCheckUtils]: 46: Hoare triple {4801#(<= ~counter~0 3)} ~cond := #in~cond; {4801#(<= ~counter~0 3)} is VALID [2022-04-28 04:54:14,317 INFO L290 TraceCheckUtils]: 47: Hoare triple {4801#(<= ~counter~0 3)} assume !(0 == ~cond); {4801#(<= ~counter~0 3)} is VALID [2022-04-28 04:54:14,317 INFO L290 TraceCheckUtils]: 48: Hoare triple {4801#(<= ~counter~0 3)} assume true; {4801#(<= ~counter~0 3)} is VALID [2022-04-28 04:54:14,318 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {4801#(<= ~counter~0 3)} {4801#(<= ~counter~0 3)} #94#return; {4801#(<= ~counter~0 3)} is VALID [2022-04-28 04:54:14,319 INFO L290 TraceCheckUtils]: 50: Hoare triple {4801#(<= ~counter~0 3)} assume !!(1 != ~q~0 % 4294967296);~q~0 := (if ~q~0 % 4294967296 < 0 && 0 != ~q~0 % 4294967296 % 4 then 1 + ~q~0 % 4294967296 / 4 else ~q~0 % 4294967296 / 4);~h~0 := ~p~0 + ~q~0;~p~0 := (if ~p~0 % 4294967296 < 0 && 0 != ~p~0 % 4294967296 % 2 then 1 + ~p~0 % 4294967296 / 2 else ~p~0 % 4294967296 / 2); {4801#(<= ~counter~0 3)} is VALID [2022-04-28 04:54:14,319 INFO L290 TraceCheckUtils]: 51: Hoare triple {4801#(<= ~counter~0 3)} assume ~r~0 % 4294967296 >= ~h~0 % 4294967296;~p~0 := ~p~0 + ~q~0;~r~0 := ~r~0 - ~h~0; {4801#(<= ~counter~0 3)} is VALID [2022-04-28 04:54:14,319 INFO L290 TraceCheckUtils]: 52: Hoare triple {4801#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4904#(<= |main_#t~post6| 3)} is VALID [2022-04-28 04:54:14,320 INFO L290 TraceCheckUtils]: 53: Hoare triple {4904#(<= |main_#t~post6| 3)} assume !(#t~post6 < 50);havoc #t~post6; {4740#false} is VALID [2022-04-28 04:54:14,320 INFO L272 TraceCheckUtils]: 54: Hoare triple {4740#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)); {4740#false} is VALID [2022-04-28 04:54:14,320 INFO L290 TraceCheckUtils]: 55: Hoare triple {4740#false} ~cond := #in~cond; {4740#false} is VALID [2022-04-28 04:54:14,320 INFO L290 TraceCheckUtils]: 56: Hoare triple {4740#false} assume 0 == ~cond; {4740#false} is VALID [2022-04-28 04:54:14,320 INFO L290 TraceCheckUtils]: 57: Hoare triple {4740#false} assume !false; {4740#false} is VALID [2022-04-28 04:54:14,321 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-28 04:54:14,321 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 04:54:14,606 INFO L290 TraceCheckUtils]: 57: Hoare triple {4740#false} assume !false; {4740#false} is VALID [2022-04-28 04:54:14,606 INFO L290 TraceCheckUtils]: 56: Hoare triple {4740#false} assume 0 == ~cond; {4740#false} is VALID [2022-04-28 04:54:14,606 INFO L290 TraceCheckUtils]: 55: Hoare triple {4740#false} ~cond := #in~cond; {4740#false} is VALID [2022-04-28 04:54:14,606 INFO L272 TraceCheckUtils]: 54: Hoare triple {4740#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)); {4740#false} is VALID [2022-04-28 04:54:14,607 INFO L290 TraceCheckUtils]: 53: Hoare triple {4932#(< |main_#t~post6| 50)} assume !(#t~post6 < 50);havoc #t~post6; {4740#false} is VALID [2022-04-28 04:54:14,607 INFO L290 TraceCheckUtils]: 52: Hoare triple {4936#(< ~counter~0 50)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4932#(< |main_#t~post6| 50)} is VALID [2022-04-28 04:54:14,607 INFO L290 TraceCheckUtils]: 51: Hoare triple {4936#(< ~counter~0 50)} assume ~r~0 % 4294967296 >= ~h~0 % 4294967296;~p~0 := ~p~0 + ~q~0;~r~0 := ~r~0 - ~h~0; {4936#(< ~counter~0 50)} is VALID [2022-04-28 04:54:14,608 INFO L290 TraceCheckUtils]: 50: Hoare triple {4936#(< ~counter~0 50)} assume !!(1 != ~q~0 % 4294967296);~q~0 := (if ~q~0 % 4294967296 < 0 && 0 != ~q~0 % 4294967296 % 4 then 1 + ~q~0 % 4294967296 / 4 else ~q~0 % 4294967296 / 4);~h~0 := ~p~0 + ~q~0;~p~0 := (if ~p~0 % 4294967296 < 0 && 0 != ~p~0 % 4294967296 % 2 then 1 + ~p~0 % 4294967296 / 2 else ~p~0 % 4294967296 / 2); {4936#(< ~counter~0 50)} is VALID [2022-04-28 04:54:14,608 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {4739#true} {4936#(< ~counter~0 50)} #94#return; {4936#(< ~counter~0 50)} is VALID [2022-04-28 04:54:14,608 INFO L290 TraceCheckUtils]: 48: Hoare triple {4739#true} assume true; {4739#true} is VALID [2022-04-28 04:54:14,608 INFO L290 TraceCheckUtils]: 47: Hoare triple {4739#true} assume !(0 == ~cond); {4739#true} is VALID [2022-04-28 04:54:14,608 INFO L290 TraceCheckUtils]: 46: Hoare triple {4739#true} ~cond := #in~cond; {4739#true} is VALID [2022-04-28 04:54:14,608 INFO L272 TraceCheckUtils]: 45: Hoare triple {4936#(< ~counter~0 50)} call __VERIFIER_assert((if 0 == (~p~0 * ~p~0 - ~n~0 * ~q~0 + ~q~0 * ~r~0) % 4294967296 then 1 else 0)); {4739#true} is VALID [2022-04-28 04:54:14,609 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {4739#true} {4936#(< ~counter~0 50)} #92#return; {4936#(< ~counter~0 50)} is VALID [2022-04-28 04:54:14,609 INFO L290 TraceCheckUtils]: 43: Hoare triple {4739#true} assume true; {4739#true} is VALID [2022-04-28 04:54:14,609 INFO L290 TraceCheckUtils]: 42: Hoare triple {4739#true} assume !(0 == ~cond); {4739#true} is VALID [2022-04-28 04:54:14,609 INFO L290 TraceCheckUtils]: 41: Hoare triple {4739#true} ~cond := #in~cond; {4739#true} is VALID [2022-04-28 04:54:14,609 INFO L272 TraceCheckUtils]: 40: Hoare triple {4936#(< ~counter~0 50)} call __VERIFIER_assert((if 0 == (~h~0 * ~h~0 * ~p~0 - 4 * ~h~0 * ~n~0 * ~q~0 + 4 * ~n~0 * ~p~0 * ~q~0 - ~p~0 * ~q~0 * ~q~0 + 4 * ~h~0 * ~q~0 * ~r~0 - 4 * ~p~0 * ~q~0 * ~r~0) % 4294967296 then 1 else 0)); {4739#true} is VALID [2022-04-28 04:54:14,610 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {4739#true} {4936#(< ~counter~0 50)} #90#return; {4936#(< ~counter~0 50)} is VALID [2022-04-28 04:54:14,610 INFO L290 TraceCheckUtils]: 38: Hoare triple {4739#true} assume true; {4739#true} is VALID [2022-04-28 04:54:14,610 INFO L290 TraceCheckUtils]: 37: Hoare triple {4739#true} assume !(0 == ~cond); {4739#true} is VALID [2022-04-28 04:54:14,610 INFO L290 TraceCheckUtils]: 36: Hoare triple {4739#true} ~cond := #in~cond; {4739#true} is VALID [2022-04-28 04:54:14,610 INFO L272 TraceCheckUtils]: 35: Hoare triple {4936#(< ~counter~0 50)} call __VERIFIER_assert((if 0 == (~h~0 * ~h~0 * ~n~0 - 4 * ~h~0 * ~n~0 * ~p~0 + 4 * (~n~0 * ~n~0) * ~q~0 - ~n~0 * ~q~0 * ~q~0 - ~h~0 * ~h~0 * ~r~0 + 4 * ~h~0 * ~p~0 * ~r~0 - 8 * ~n~0 * ~q~0 * ~r~0 + ~q~0 * ~q~0 * ~r~0 + 4 * ~q~0 * ~r~0 * ~r~0) % 4294967296 then 1 else 0)); {4739#true} is VALID [2022-04-28 04:54:14,611 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {4739#true} {4936#(< ~counter~0 50)} #88#return; {4936#(< ~counter~0 50)} is VALID [2022-04-28 04:54:14,611 INFO L290 TraceCheckUtils]: 33: Hoare triple {4739#true} assume true; {4739#true} is VALID [2022-04-28 04:54:14,611 INFO L290 TraceCheckUtils]: 32: Hoare triple {4739#true} assume !(0 == ~cond); {4739#true} is VALID [2022-04-28 04:54:14,611 INFO L290 TraceCheckUtils]: 31: Hoare triple {4739#true} ~cond := #in~cond; {4739#true} is VALID [2022-04-28 04:54:14,611 INFO L272 TraceCheckUtils]: 30: Hoare triple {4936#(< ~counter~0 50)} 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)); {4739#true} is VALID [2022-04-28 04:54:14,612 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {4739#true} {4936#(< ~counter~0 50)} #86#return; {4936#(< ~counter~0 50)} is VALID [2022-04-28 04:54:14,612 INFO L290 TraceCheckUtils]: 28: Hoare triple {4739#true} assume true; {4739#true} is VALID [2022-04-28 04:54:14,612 INFO L290 TraceCheckUtils]: 27: Hoare triple {4739#true} assume !(0 == ~cond); {4739#true} is VALID [2022-04-28 04:54:14,612 INFO L290 TraceCheckUtils]: 26: Hoare triple {4739#true} ~cond := #in~cond; {4739#true} is VALID [2022-04-28 04:54:14,612 INFO L272 TraceCheckUtils]: 25: Hoare triple {4936#(< ~counter~0 50)} call __VERIFIER_assert((if (~p~0 * ~p~0 + ~r~0 * ~q~0) % 4294967296 == ~n~0 * ~q~0 % 4294967296 then 1 else 0)); {4739#true} is VALID [2022-04-28 04:54:14,613 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {4739#true} {4936#(< ~counter~0 50)} #84#return; {4936#(< ~counter~0 50)} is VALID [2022-04-28 04:54:14,613 INFO L290 TraceCheckUtils]: 23: Hoare triple {4739#true} assume true; {4739#true} is VALID [2022-04-28 04:54:14,613 INFO L290 TraceCheckUtils]: 22: Hoare triple {4739#true} assume !(0 == ~cond); {4739#true} is VALID [2022-04-28 04:54:14,613 INFO L290 TraceCheckUtils]: 21: Hoare triple {4739#true} ~cond := #in~cond; {4739#true} is VALID [2022-04-28 04:54:14,613 INFO L272 TraceCheckUtils]: 20: Hoare triple {4936#(< ~counter~0 50)} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {4739#true} is VALID [2022-04-28 04:54:14,613 INFO L290 TraceCheckUtils]: 19: Hoare triple {4936#(< ~counter~0 50)} assume !!(#t~post6 < 50);havoc #t~post6; {4936#(< ~counter~0 50)} is VALID [2022-04-28 04:54:14,614 INFO L290 TraceCheckUtils]: 18: Hoare triple {5039#(< ~counter~0 49)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4936#(< ~counter~0 50)} is VALID [2022-04-28 04:54:14,614 INFO L290 TraceCheckUtils]: 17: Hoare triple {5039#(< ~counter~0 49)} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {5039#(< ~counter~0 49)} is VALID [2022-04-28 04:54:14,615 INFO L290 TraceCheckUtils]: 16: Hoare triple {5039#(< ~counter~0 49)} assume !!(#t~post5 < 50);havoc #t~post5; {5039#(< ~counter~0 49)} is VALID [2022-04-28 04:54:14,615 INFO L290 TraceCheckUtils]: 15: Hoare triple {5049#(< ~counter~0 48)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5039#(< ~counter~0 49)} is VALID [2022-04-28 04:54:14,615 INFO L290 TraceCheckUtils]: 14: Hoare triple {5049#(< ~counter~0 48)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {5049#(< ~counter~0 48)} is VALID [2022-04-28 04:54:14,616 INFO L290 TraceCheckUtils]: 13: Hoare triple {5049#(< ~counter~0 48)} assume !!(#t~post5 < 50);havoc #t~post5; {5049#(< ~counter~0 48)} is VALID [2022-04-28 04:54:14,616 INFO L290 TraceCheckUtils]: 12: Hoare triple {5059#(< ~counter~0 47)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5049#(< ~counter~0 48)} is VALID [2022-04-28 04:54:14,617 INFO L290 TraceCheckUtils]: 11: Hoare triple {5059#(< ~counter~0 47)} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {5059#(< ~counter~0 47)} is VALID [2022-04-28 04:54:14,617 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4739#true} {5059#(< ~counter~0 47)} #82#return; {5059#(< ~counter~0 47)} is VALID [2022-04-28 04:54:14,617 INFO L290 TraceCheckUtils]: 9: Hoare triple {4739#true} assume true; {4739#true} is VALID [2022-04-28 04:54:14,617 INFO L290 TraceCheckUtils]: 8: Hoare triple {4739#true} assume !(0 == ~cond); {4739#true} is VALID [2022-04-28 04:54:14,617 INFO L290 TraceCheckUtils]: 7: Hoare triple {4739#true} ~cond := #in~cond; {4739#true} is VALID [2022-04-28 04:54:14,617 INFO L272 TraceCheckUtils]: 6: Hoare triple {5059#(< ~counter~0 47)} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {4739#true} is VALID [2022-04-28 04:54:14,632 INFO L290 TraceCheckUtils]: 5: Hoare triple {5059#(< ~counter~0 47)} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {5059#(< ~counter~0 47)} is VALID [2022-04-28 04:54:14,633 INFO L272 TraceCheckUtils]: 4: Hoare triple {5059#(< ~counter~0 47)} call #t~ret7 := main(); {5059#(< ~counter~0 47)} is VALID [2022-04-28 04:54:14,634 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5059#(< ~counter~0 47)} {4739#true} #102#return; {5059#(< ~counter~0 47)} is VALID [2022-04-28 04:54:14,635 INFO L290 TraceCheckUtils]: 2: Hoare triple {5059#(< ~counter~0 47)} assume true; {5059#(< ~counter~0 47)} is VALID [2022-04-28 04:54:14,636 INFO L290 TraceCheckUtils]: 1: Hoare triple {4739#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; {5059#(< ~counter~0 47)} is VALID [2022-04-28 04:54:14,636 INFO L272 TraceCheckUtils]: 0: Hoare triple {4739#true} call ULTIMATE.init(); {4739#true} is VALID [2022-04-28 04:54:14,636 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-28 04:54:14,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:54:14,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633779921] [2022-04-28 04:54:14,636 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 04:54:14,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1967851038] [2022-04-28 04:54:14,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1967851038] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 04:54:14,636 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 04:54:14,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-04-28 04:54:14,637 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:54:14,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2059979192] [2022-04-28 04:54:14,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2059979192] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:54:14,637 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:54:14,637 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 04:54:14,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627275725] [2022-04-28 04:54:14,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:54:14,637 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 4 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) Word has length 58 [2022-04-28 04:54:14,638 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:54:14,638 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 4 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-28 04:54:14,672 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-28 04:54:14,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 04:54:14,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:54:14,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 04:54:14,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2022-04-28 04:54:14,672 INFO L87 Difference]: Start difference. First operand 69 states and 92 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 4 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-28 04:54:17,597 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-28 04:54:24,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:54:24,860 INFO L93 Difference]: Finished difference Result 114 states and 146 transitions. [2022-04-28 04:54:24,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 04:54:24,860 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 4 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) Word has length 58 [2022-04-28 04:54:24,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:54:24,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 4 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-28 04:54:24,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 90 transitions. [2022-04-28 04:54:24,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 4 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-28 04:54:24,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 90 transitions. [2022-04-28 04:54:24,862 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 90 transitions. [2022-04-28 04:54:24,952 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:54:24,956 INFO L225 Difference]: With dead ends: 114 [2022-04-28 04:54:24,956 INFO L226 Difference]: Without dead ends: 104 [2022-04-28 04:54:24,956 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2022-04-28 04:54:24,957 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 21 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 13 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-28 04:54:24,958 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 157 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 26 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-04-28 04:54:24,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-04-28 04:54:25,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 98. [2022-04-28 04:54:25,015 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:54:25,015 INFO L82 GeneralOperation]: Start isEquivalent. First operand 104 states. Second operand has 98 states, 57 states have (on average 1.1754385964912282) internal successors, (67), 59 states have internal predecessors, (67), 31 states have call successors, (31), 10 states have call predecessors, (31), 9 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-28 04:54:25,016 INFO L74 IsIncluded]: Start isIncluded. First operand 104 states. Second operand has 98 states, 57 states have (on average 1.1754385964912282) internal successors, (67), 59 states have internal predecessors, (67), 31 states have call successors, (31), 10 states have call predecessors, (31), 9 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-28 04:54:25,016 INFO L87 Difference]: Start difference. First operand 104 states. Second operand has 98 states, 57 states have (on average 1.1754385964912282) internal successors, (67), 59 states have internal predecessors, (67), 31 states have call successors, (31), 10 states have call predecessors, (31), 9 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-28 04:54:25,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:54:25,018 INFO L93 Difference]: Finished difference Result 104 states and 133 transitions. [2022-04-28 04:54:25,018 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 133 transitions. [2022-04-28 04:54:25,018 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:54:25,018 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:54:25,018 INFO L74 IsIncluded]: Start isIncluded. First operand has 98 states, 57 states have (on average 1.1754385964912282) internal successors, (67), 59 states have internal predecessors, (67), 31 states have call successors, (31), 10 states have call predecessors, (31), 9 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand 104 states. [2022-04-28 04:54:25,019 INFO L87 Difference]: Start difference. First operand has 98 states, 57 states have (on average 1.1754385964912282) internal successors, (67), 59 states have internal predecessors, (67), 31 states have call successors, (31), 10 states have call predecessors, (31), 9 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand 104 states. [2022-04-28 04:54:25,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:54:25,021 INFO L93 Difference]: Finished difference Result 104 states and 133 transitions. [2022-04-28 04:54:25,021 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 133 transitions. [2022-04-28 04:54:25,021 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:54:25,021 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:54:25,021 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:54:25,021 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:54:25,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 57 states have (on average 1.1754385964912282) internal successors, (67), 59 states have internal predecessors, (67), 31 states have call successors, (31), 10 states have call predecessors, (31), 9 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-28 04:54:25,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 126 transitions. [2022-04-28 04:54:25,023 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 126 transitions. Word has length 58 [2022-04-28 04:54:25,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:54:25,023 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 126 transitions. [2022-04-28 04:54:25,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 4 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-28 04:54:25,024 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 98 states and 126 transitions. [2022-04-28 04:54:25,547 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 126 edges. 126 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:54:25,548 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 126 transitions. [2022-04-28 04:54:25,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-04-28 04:54:25,548 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:54:25,548 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-28 04:54:25,554 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-28 04:54:25,751 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-28 04:54:25,752 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:54:25,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:54:25,752 INFO L85 PathProgramCache]: Analyzing trace with hash 109392637, now seen corresponding path program 1 times [2022-04-28 04:54:25,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:54:25,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1154219135] [2022-04-28 04:54:25,757 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:54:25,757 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-28 04:54:25,757 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 04:54:25,757 INFO L85 PathProgramCache]: Analyzing trace with hash 109392637, now seen corresponding path program 2 times [2022-04-28 04:54:25,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:54:25,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558367865] [2022-04-28 04:54:25,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:54:25,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:54:25,772 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 04:54:25,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1968520254] [2022-04-28 04:54:25,773 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 04:54:25,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:54:25,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:54:25,781 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-28 04:54:25,782 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process