/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/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_unwindbound100.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 11:27:15,583 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 11:27:15,585 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 11:27:15,632 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 11:27:15,632 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 11:27:15,633 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 11:27:15,638 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 11:27:15,642 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 11:27:15,646 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 11:27:15,646 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 11:27:15,647 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 11:27:15,648 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 11:27:15,648 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 11:27:15,649 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 11:27:15,650 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 11:27:15,650 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 11:27:15,651 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 11:27:15,652 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 11:27:15,653 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 11:27:15,654 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 11:27:15,658 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 11:27:15,661 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 11:27:15,662 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 11:27:15,663 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 11:27:15,665 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 11:27:15,676 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 11:27:15,676 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 11:27:15,676 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 11:27:15,677 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 11:27:15,677 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 11:27:15,678 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 11:27:15,678 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 11:27:15,679 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 11:27:15,679 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 11:27:15,680 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 11:27:15,681 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 11:27:15,681 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 11:27:15,681 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 11:27:15,681 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 11:27:15,682 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 11:27:15,682 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 11:27:15,686 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 11:27:15,686 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-08 11:27:15,696 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 11:27:15,697 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 11:27:15,698 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 11:27:15,698 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 11:27:15,699 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 11:27:15,699 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 11:27:15,699 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 11:27:15,699 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 11:27:15,699 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 11:27:15,700 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 11:27:15,700 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 11:27:15,700 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 11:27:15,700 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 11:27:15,701 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 11:27:15,701 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 11:27:15,701 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 11:27:15,701 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 11:27:15,701 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 11:27:15,701 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 11:27:15,701 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 11:27:15,702 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 11:27:15,702 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-08 11:27:15,702 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-08 11:27:15,907 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 11:27:15,930 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 11:27:15,932 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 11:27:15,933 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 11:27:15,934 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 11:27:15,935 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_unwindbound100.c [2022-04-08 11:27:15,984 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d6121bc3/506ce5afa92d4ffbb0f0c358f78d9b8a/FLAG250a21f9c [2022-04-08 11:27:16,286 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 11:27:16,286 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_unwindbound100.c [2022-04-08 11:27:16,291 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d6121bc3/506ce5afa92d4ffbb0f0c358f78d9b8a/FLAG250a21f9c [2022-04-08 11:27:16,725 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d6121bc3/506ce5afa92d4ffbb0f0c358f78d9b8a [2022-04-08 11:27:16,727 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 11:27:16,728 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 11:27:16,729 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 11:27:16,730 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 11:27:16,732 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 11:27:16,733 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 11:27:16" (1/1) ... [2022-04-08 11:27:16,733 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@528eb15d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:27:16, skipping insertion in model container [2022-04-08 11:27:16,734 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 11:27:16" (1/1) ... [2022-04-08 11:27:16,742 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 11:27:16,753 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 11:27:16,881 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_unwindbound100.c[525,538] [2022-04-08 11:27:16,920 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 11:27:16,927 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 11:27:16,944 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_unwindbound100.c[525,538] [2022-04-08 11:27:16,958 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 11:27:16,969 INFO L208 MainTranslator]: Completed translation [2022-04-08 11:27:16,969 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:27:16 WrapperNode [2022-04-08 11:27:16,969 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 11:27:16,970 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 11:27:16,970 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 11:27:16,970 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 11:27:16,979 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:27:16" (1/1) ... [2022-04-08 11:27:16,979 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:27:16" (1/1) ... [2022-04-08 11:27:16,985 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:27:16" (1/1) ... [2022-04-08 11:27:16,985 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:27:16" (1/1) ... [2022-04-08 11:27:16,995 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:27:16" (1/1) ... [2022-04-08 11:27:16,998 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:27:16" (1/1) ... [2022-04-08 11:27:17,000 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:27:16" (1/1) ... [2022-04-08 11:27:17,001 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 11:27:17,002 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 11:27:17,002 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 11:27:17,002 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 11:27:17,003 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:27:16" (1/1) ... [2022-04-08 11:27:17,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 11:27:17,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:27:17,035 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-08 11:27:17,036 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-08 11:27:17,060 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 11:27:17,060 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 11:27:17,060 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 11:27:17,060 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 11:27:17,060 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 11:27:17,060 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 11:27:17,060 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 11:27:17,061 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 11:27:17,061 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 11:27:17,061 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 11:27:17,061 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-08 11:27:17,061 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 11:27:17,061 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 11:27:17,061 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 11:27:17,061 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 11:27:17,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 11:27:17,062 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 11:27:17,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 11:27:17,062 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 11:27:17,062 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 11:27:17,110 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 11:27:17,111 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 11:27:17,293 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 11:27:17,300 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 11:27:17,300 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-08 11:27:17,301 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 11:27:17 BoogieIcfgContainer [2022-04-08 11:27:17,302 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 11:27:17,303 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 11:27:17,303 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 11:27:17,307 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 11:27:17,307 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 11:27:16" (1/3) ... [2022-04-08 11:27:17,308 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5044e792 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 11:27:17, skipping insertion in model container [2022-04-08 11:27:17,308 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:27:16" (2/3) ... [2022-04-08 11:27:17,308 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5044e792 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 11:27:17, skipping insertion in model container [2022-04-08 11:27:17,309 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 11:27:17" (3/3) ... [2022-04-08 11:27:17,309 INFO L111 eAbstractionObserver]: Analyzing ICFG dijkstra-u_unwindbound100.c [2022-04-08 11:27:17,313 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 11:27:17,314 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 11:27:17,357 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 11:27:17,364 INFO L340 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 [2022-04-08 11:27:17,364 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 11:27:17,379 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-08 11:27:17,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-08 11:27:17,385 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:27:17,386 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 11:27:17,386 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:27:17,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:27:17,391 INFO L85 PathProgramCache]: Analyzing trace with hash -2024343623, now seen corresponding path program 1 times [2022-04-08 11:27:17,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:27:17,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [192772181] [2022-04-08 11:27:17,404 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 11:27:17,404 INFO L85 PathProgramCache]: Analyzing trace with hash -2024343623, now seen corresponding path program 2 times [2022-04-08 11:27:17,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:27:17,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737094823] [2022-04-08 11:27:17,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:27:17,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:27:17,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:27:17,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 11:27:17,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:27:17,555 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-08 11:27:17,556 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} assume true; {42#true} is VALID [2022-04-08 11:27:17,556 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {42#true} {42#true} #102#return; {42#true} is VALID [2022-04-08 11:27:17,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-08 11:27:17,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:27:17,579 INFO L290 TraceCheckUtils]: 0: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-08 11:27:17,580 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-08 11:27:17,580 INFO L290 TraceCheckUtils]: 2: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-08 11:27:17,581 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43#false} {42#true} #82#return; {43#false} is VALID [2022-04-08 11:27:17,583 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-08 11:27:17,583 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-08 11:27:17,583 INFO L290 TraceCheckUtils]: 2: Hoare triple {42#true} assume true; {42#true} is VALID [2022-04-08 11:27:17,584 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42#true} {42#true} #102#return; {42#true} is VALID [2022-04-08 11:27:17,584 INFO L272 TraceCheckUtils]: 4: Hoare triple {42#true} call #t~ret7 := main(); {42#true} is VALID [2022-04-08 11:27:17,584 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-08 11:27:17,585 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-08 11:27:17,585 INFO L290 TraceCheckUtils]: 7: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-08 11:27:17,586 INFO L290 TraceCheckUtils]: 8: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-08 11:27:17,586 INFO L290 TraceCheckUtils]: 9: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-08 11:27:17,587 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {43#false} {42#true} #82#return; {43#false} is VALID [2022-04-08 11:27:17,587 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-08 11:27:17,587 INFO L290 TraceCheckUtils]: 12: Hoare triple {43#false} assume !true; {43#false} is VALID [2022-04-08 11:27:17,588 INFO L290 TraceCheckUtils]: 13: Hoare triple {43#false} assume !true; {43#false} is VALID [2022-04-08 11:27:17,588 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-08 11:27:17,589 INFO L290 TraceCheckUtils]: 15: Hoare triple {43#false} ~cond := #in~cond; {43#false} is VALID [2022-04-08 11:27:17,590 INFO L290 TraceCheckUtils]: 16: Hoare triple {43#false} assume 0 == ~cond; {43#false} is VALID [2022-04-08 11:27:17,590 INFO L290 TraceCheckUtils]: 17: Hoare triple {43#false} assume !false; {43#false} is VALID [2022-04-08 11:27:17,591 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-08 11:27:17,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:27:17,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737094823] [2022-04-08 11:27:17,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737094823] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:27:17,592 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:27:17,592 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 11:27:17,597 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:27:17,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [192772181] [2022-04-08 11:27:17,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [192772181] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:27:17,598 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:27:17,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 11:27:17,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312087103] [2022-04-08 11:27:17,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:27:17,603 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-08 11:27:17,604 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:27:17,607 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-08 11:27:17,649 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-08 11:27:17,649 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 11:27:17,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:27:17,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 11:27:17,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 11:27:17,674 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-08 11:27:20,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:27:20,820 INFO L93 Difference]: Finished difference Result 70 states and 111 transitions. [2022-04-08 11:27:20,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 11:27:20,821 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-08 11:27:20,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:27:20,822 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-08 11:27:20,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2022-04-08 11:27:20,844 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-08 11:27:20,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2022-04-08 11:27:20,850 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 111 transitions. [2022-04-08 11:27:20,973 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-08 11:27:20,981 INFO L225 Difference]: With dead ends: 70 [2022-04-08 11:27:20,982 INFO L226 Difference]: Without dead ends: 35 [2022-04-08 11:27:20,984 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 11:27:20,987 INFO L913 BasicCegarLoop]: 49 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 11:27:20,988 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 53 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 11:27:21,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-08 11:27:21,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2022-04-08 11:27:21,026 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:27:21,027 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-08 11:27:21,028 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-08 11:27:21,028 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-08 11:27:21,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:27:21,033 INFO L93 Difference]: Finished difference Result 35 states and 47 transitions. [2022-04-08 11:27:21,033 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 47 transitions. [2022-04-08 11:27:21,034 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:27:21,034 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:27:21,035 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-08 11:27:21,037 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-08 11:27:21,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:27:21,048 INFO L93 Difference]: Finished difference Result 35 states and 47 transitions. [2022-04-08 11:27:21,049 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 47 transitions. [2022-04-08 11:27:21,051 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:27:21,052 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:27:21,053 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:27:21,057 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:27:21,058 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-08 11:27:21,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 46 transitions. [2022-04-08 11:27:21,066 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 46 transitions. Word has length 18 [2022-04-08 11:27:21,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:27:21,066 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 46 transitions. [2022-04-08 11:27:21,066 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 11:27:21,066 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 46 transitions. [2022-04-08 11:27:21,122 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-08 11:27:21,122 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 46 transitions. [2022-04-08 11:27:21,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-08 11:27:21,124 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:27:21,125 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 11:27:21,125 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 11:27:21,125 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:27:21,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:27:21,127 INFO L85 PathProgramCache]: Analyzing trace with hash -96361696, now seen corresponding path program 1 times [2022-04-08 11:27:21,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:27:21,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1150752444] [2022-04-08 11:27:21,133 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 11:27:21,133 INFO L85 PathProgramCache]: Analyzing trace with hash -96361696, now seen corresponding path program 2 times [2022-04-08 11:27:21,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:27:21,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28436400] [2022-04-08 11:27:21,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:27:21,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:27:21,165 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:27:21,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1237269637] [2022-04-08 11:27:21,166 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 11:27:21,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:27:21,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:27:21,183 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-08 11:27:21,203 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-08 11:27:21,244 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 11:27:21,244 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:27:21,246 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-08 11:27:21,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:27:21,265 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:27:21,420 INFO L272 TraceCheckUtils]: 0: Hoare triple {332#true} call ULTIMATE.init(); {332#true} is VALID [2022-04-08 11:27:21,421 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-08 11:27:21,421 INFO L290 TraceCheckUtils]: 2: Hoare triple {340#(<= ~counter~0 0)} assume true; {340#(<= ~counter~0 0)} is VALID [2022-04-08 11:27:21,428 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {340#(<= ~counter~0 0)} {332#true} #102#return; {340#(<= ~counter~0 0)} is VALID [2022-04-08 11:27:21,428 INFO L272 TraceCheckUtils]: 4: Hoare triple {340#(<= ~counter~0 0)} call #t~ret7 := main(); {340#(<= ~counter~0 0)} is VALID [2022-04-08 11:27:21,429 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-08 11:27:21,429 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-08 11:27:21,430 INFO L290 TraceCheckUtils]: 7: Hoare triple {340#(<= ~counter~0 0)} ~cond := #in~cond; {340#(<= ~counter~0 0)} is VALID [2022-04-08 11:27:21,430 INFO L290 TraceCheckUtils]: 8: Hoare triple {340#(<= ~counter~0 0)} assume !(0 == ~cond); {340#(<= ~counter~0 0)} is VALID [2022-04-08 11:27:21,435 INFO L290 TraceCheckUtils]: 9: Hoare triple {340#(<= ~counter~0 0)} assume true; {340#(<= ~counter~0 0)} is VALID [2022-04-08 11:27:21,436 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {340#(<= ~counter~0 0)} {340#(<= ~counter~0 0)} #82#return; {340#(<= ~counter~0 0)} is VALID [2022-04-08 11:27:21,436 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-08 11:27:21,437 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-08 11:27:21,438 INFO L290 TraceCheckUtils]: 13: Hoare triple {374#(<= |main_#t~post5| 0)} assume !(#t~post5 < 100);havoc #t~post5; {333#false} is VALID [2022-04-08 11:27:21,438 INFO L290 TraceCheckUtils]: 14: Hoare triple {333#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {333#false} is VALID [2022-04-08 11:27:21,438 INFO L290 TraceCheckUtils]: 15: Hoare triple {333#false} assume !(#t~post6 < 100);havoc #t~post6; {333#false} is VALID [2022-04-08 11:27:21,438 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-08 11:27:21,439 INFO L290 TraceCheckUtils]: 17: Hoare triple {333#false} ~cond := #in~cond; {333#false} is VALID [2022-04-08 11:27:21,439 INFO L290 TraceCheckUtils]: 18: Hoare triple {333#false} assume 0 == ~cond; {333#false} is VALID [2022-04-08 11:27:21,439 INFO L290 TraceCheckUtils]: 19: Hoare triple {333#false} assume !false; {333#false} is VALID [2022-04-08 11:27:21,440 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-08 11:27:21,440 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 11:27:21,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:27:21,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28436400] [2022-04-08 11:27:21,441 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:27:21,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1237269637] [2022-04-08 11:27:21,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1237269637] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:27:21,444 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:27:21,444 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 11:27:21,445 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:27:21,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1150752444] [2022-04-08 11:27:21,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1150752444] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:27:21,445 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:27:21,445 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 11:27:21,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434365541] [2022-04-08 11:27:21,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:27:21,446 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-08 11:27:21,447 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:27:21,448 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-08 11:27:21,468 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-08 11:27:21,468 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 11:27:21,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:27:21,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 11:27:21,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 11:27:21,469 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-08 11:27:26,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:27:26,569 INFO L93 Difference]: Finished difference Result 55 states and 78 transitions. [2022-04-08 11:27:26,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 11:27:26,569 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-08 11:27:26,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:27:26,570 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-08 11:27:26,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2022-04-08 11:27:26,573 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-08 11:27:26,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2022-04-08 11:27:26,585 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 78 transitions. [2022-04-08 11:27:26,682 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-08 11:27:26,684 INFO L225 Difference]: With dead ends: 55 [2022-04-08 11:27:26,684 INFO L226 Difference]: Without dead ends: 36 [2022-04-08 11:27:26,685 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 11:27:26,686 INFO L913 BasicCegarLoop]: 44 mSDtfsCounter, 0 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 11:27:26,686 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 119 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 11:27:26,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-08 11:27:26,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-04-08 11:27:26,703 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:27:26,703 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-08 11:27:26,704 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-08 11:27:26,704 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-08 11:27:26,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:27:26,707 INFO L93 Difference]: Finished difference Result 36 states and 48 transitions. [2022-04-08 11:27:26,707 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 48 transitions. [2022-04-08 11:27:26,708 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:27:26,708 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:27:26,708 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-08 11:27:26,709 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-08 11:27:26,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:27:26,717 INFO L93 Difference]: Finished difference Result 36 states and 48 transitions. [2022-04-08 11:27:26,717 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 48 transitions. [2022-04-08 11:27:26,725 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:27:26,725 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:27:26,725 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:27:26,725 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:27:26,725 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-08 11:27:26,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 48 transitions. [2022-04-08 11:27:26,729 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 48 transitions. Word has length 20 [2022-04-08 11:27:26,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:27:26,729 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 48 transitions. [2022-04-08 11:27:26,730 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 11:27:26,730 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 48 transitions. [2022-04-08 11:27:26,779 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-08 11:27:26,779 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 48 transitions. [2022-04-08 11:27:26,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-08 11:27:26,782 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:27:26,782 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 11:27:26,803 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-08 11:27:26,995 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:27:26,996 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:27:26,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:27:26,996 INFO L85 PathProgramCache]: Analyzing trace with hash 962099791, now seen corresponding path program 1 times [2022-04-08 11:27:26,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:27:26,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1266399530] [2022-04-08 11:27:26,998 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 11:27:26,998 INFO L85 PathProgramCache]: Analyzing trace with hash 962099791, now seen corresponding path program 2 times [2022-04-08 11:27:26,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:27:26,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838577273] [2022-04-08 11:27:26,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:27:26,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:27:27,024 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:27:27,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1303756694] [2022-04-08 11:27:27,024 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 11:27:27,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:27:27,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:27:27,029 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-08 11:27:27,031 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-08 11:27:27,063 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 11:27:27,063 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:27:27,064 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 11:27:27,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:27:27,073 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:27:27,209 INFO L272 TraceCheckUtils]: 0: Hoare triple {649#true} call ULTIMATE.init(); {649#true} is VALID [2022-04-08 11:27:27,210 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-08 11:27:27,210 INFO L290 TraceCheckUtils]: 2: Hoare triple {657#(<= ~counter~0 0)} assume true; {657#(<= ~counter~0 0)} is VALID [2022-04-08 11:27:27,211 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {657#(<= ~counter~0 0)} {649#true} #102#return; {657#(<= ~counter~0 0)} is VALID [2022-04-08 11:27:27,212 INFO L272 TraceCheckUtils]: 4: Hoare triple {657#(<= ~counter~0 0)} call #t~ret7 := main(); {657#(<= ~counter~0 0)} is VALID [2022-04-08 11:27:27,214 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-08 11:27:27,215 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-08 11:27:27,215 INFO L290 TraceCheckUtils]: 7: Hoare triple {657#(<= ~counter~0 0)} ~cond := #in~cond; {657#(<= ~counter~0 0)} is VALID [2022-04-08 11:27:27,216 INFO L290 TraceCheckUtils]: 8: Hoare triple {657#(<= ~counter~0 0)} assume !(0 == ~cond); {657#(<= ~counter~0 0)} is VALID [2022-04-08 11:27:27,216 INFO L290 TraceCheckUtils]: 9: Hoare triple {657#(<= ~counter~0 0)} assume true; {657#(<= ~counter~0 0)} is VALID [2022-04-08 11:27:27,217 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {657#(<= ~counter~0 0)} {657#(<= ~counter~0 0)} #82#return; {657#(<= ~counter~0 0)} is VALID [2022-04-08 11:27:27,217 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-08 11:27:27,218 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-08 11:27:27,218 INFO L290 TraceCheckUtils]: 13: Hoare triple {691#(<= ~counter~0 1)} assume !!(#t~post5 < 100);havoc #t~post5; {691#(<= ~counter~0 1)} is VALID [2022-04-08 11:27:27,220 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-08 11:27:27,220 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-08 11:27:27,221 INFO L290 TraceCheckUtils]: 16: Hoare triple {701#(<= |main_#t~post6| 1)} assume !(#t~post6 < 100);havoc #t~post6; {650#false} is VALID [2022-04-08 11:27:27,221 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-08 11:27:27,221 INFO L290 TraceCheckUtils]: 18: Hoare triple {650#false} ~cond := #in~cond; {650#false} is VALID [2022-04-08 11:27:27,221 INFO L290 TraceCheckUtils]: 19: Hoare triple {650#false} assume 0 == ~cond; {650#false} is VALID [2022-04-08 11:27:27,221 INFO L290 TraceCheckUtils]: 20: Hoare triple {650#false} assume !false; {650#false} is VALID [2022-04-08 11:27:27,222 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-08 11:27:27,222 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 11:27:27,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:27:27,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838577273] [2022-04-08 11:27:27,222 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:27:27,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1303756694] [2022-04-08 11:27:27,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1303756694] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:27:27,223 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:27:27,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 11:27:27,223 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:27:27,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1266399530] [2022-04-08 11:27:27,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1266399530] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:27:27,223 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:27:27,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 11:27:27,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581965414] [2022-04-08 11:27:27,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:27:27,224 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-08 11:27:27,224 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:27:27,224 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-08 11:27:27,244 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-08 11:27:27,245 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 11:27:27,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:27:27,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 11:27:27,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-08 11:27:27,246 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-08 11:27:35,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:27:35,102 INFO L93 Difference]: Finished difference Result 49 states and 64 transitions. [2022-04-08 11:27:35,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 11:27:35,102 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-08 11:27:35,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:27:35,102 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-08 11:27:35,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-08 11:27:35,105 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-08 11:27:35,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-08 11:27:35,107 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 64 transitions. [2022-04-08 11:27:35,166 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-08 11:27:35,167 INFO L225 Difference]: With dead ends: 49 [2022-04-08 11:27:35,167 INFO L226 Difference]: Without dead ends: 40 [2022-04-08 11:27:35,167 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-08 11:27:35,169 INFO L913 BasicCegarLoop]: 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-08 11:27:35,169 INFO L914 BasicCegarLoop]: 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-08 11:27:35,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-08 11:27:35,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2022-04-08 11:27:35,191 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:27:35,192 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-08 11:27:35,192 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-08 11:27:35,192 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-08 11:27:35,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:27:35,195 INFO L93 Difference]: Finished difference Result 40 states and 53 transitions. [2022-04-08 11:27:35,195 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 53 transitions. [2022-04-08 11:27:35,196 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:27:35,196 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:27:35,196 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-08 11:27:35,197 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-08 11:27:35,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:27:35,199 INFO L93 Difference]: Finished difference Result 40 states and 53 transitions. [2022-04-08 11:27:35,199 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 53 transitions. [2022-04-08 11:27:35,199 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:27:35,199 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:27:35,200 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:27:35,200 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:27:35,200 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-08 11:27:35,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 52 transitions. [2022-04-08 11:27:35,202 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 52 transitions. Word has length 21 [2022-04-08 11:27:35,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:27:35,202 INFO L478 AbstractCegarLoop]: Abstraction has 39 states and 52 transitions. [2022-04-08 11:27:35,203 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 11:27:35,203 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 52 transitions. [2022-04-08 11:27:35,260 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-08 11:27:35,261 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 52 transitions. [2022-04-08 11:27:35,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-08 11:27:35,261 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:27:35,261 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 11:27:35,279 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-08 11:27:35,467 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-08 11:27:35,468 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:27:35,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:27:35,468 INFO L85 PathProgramCache]: Analyzing trace with hash 963589341, now seen corresponding path program 1 times [2022-04-08 11:27:35,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:27:35,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1427215292] [2022-04-08 11:27:35,469 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 11:27:35,469 INFO L85 PathProgramCache]: Analyzing trace with hash 963589341, now seen corresponding path program 2 times [2022-04-08 11:27:35,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:27:35,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144525311] [2022-04-08 11:27:35,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:27:35,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:27:35,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:27:35,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 11:27:35,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:27:35,730 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-08 11:27:35,730 INFO L290 TraceCheckUtils]: 1: Hoare triple {972#true} assume true; {972#true} is VALID [2022-04-08 11:27:35,730 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {972#true} {972#true} #102#return; {972#true} is VALID [2022-04-08 11:27:35,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-08 11:27:35,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:27:35,735 INFO L290 TraceCheckUtils]: 0: Hoare triple {972#true} ~cond := #in~cond; {972#true} is VALID [2022-04-08 11:27:35,735 INFO L290 TraceCheckUtils]: 1: Hoare triple {972#true} assume !(0 == ~cond); {972#true} is VALID [2022-04-08 11:27:35,735 INFO L290 TraceCheckUtils]: 2: Hoare triple {972#true} assume true; {972#true} is VALID [2022-04-08 11:27:35,735 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {972#true} {972#true} #82#return; {972#true} is VALID [2022-04-08 11:27:35,736 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-08 11:27:35,736 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-08 11:27:35,736 INFO L290 TraceCheckUtils]: 2: Hoare triple {972#true} assume true; {972#true} is VALID [2022-04-08 11:27:35,736 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {972#true} {972#true} #102#return; {972#true} is VALID [2022-04-08 11:27:35,737 INFO L272 TraceCheckUtils]: 4: Hoare triple {972#true} call #t~ret7 := main(); {972#true} is VALID [2022-04-08 11:27:35,737 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-08 11:27:35,737 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-08 11:27:35,737 INFO L290 TraceCheckUtils]: 7: Hoare triple {972#true} ~cond := #in~cond; {972#true} is VALID [2022-04-08 11:27:35,737 INFO L290 TraceCheckUtils]: 8: Hoare triple {972#true} assume !(0 == ~cond); {972#true} is VALID [2022-04-08 11:27:35,737 INFO L290 TraceCheckUtils]: 9: Hoare triple {972#true} assume true; {972#true} is VALID [2022-04-08 11:27:35,738 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {972#true} {972#true} #82#return; {972#true} is VALID [2022-04-08 11:27:35,738 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-08 11:27:35,739 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-08 11:27:35,739 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 < 100);havoc #t~post5; {981#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} is VALID [2022-04-08 11:27:35,740 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-08 11:27:35,741 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-08 11:27:35,742 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 < 100);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-08 11:27:35,743 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-08 11:27:35,743 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-08 11:27:35,743 INFO L290 TraceCheckUtils]: 19: Hoare triple {984#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {973#false} is VALID [2022-04-08 11:27:35,744 INFO L290 TraceCheckUtils]: 20: Hoare triple {973#false} assume !false; {973#false} is VALID [2022-04-08 11:27:35,744 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-08 11:27:35,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:27:35,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144525311] [2022-04-08 11:27:35,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144525311] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:27:35,744 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:27:35,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 11:27:35,745 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:27:35,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1427215292] [2022-04-08 11:27:35,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1427215292] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:27:35,745 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:27:35,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 11:27:35,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269895236] [2022-04-08 11:27:35,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:27:35,746 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-08 11:27:35,746 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:27:35,746 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-08 11:27:35,763 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-08 11:27:35,763 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 11:27:35,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:27:35,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 11:27:35,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-08 11:27:35,764 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-08 11:27:43,905 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-08 11:27:47,007 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-08 11:27:53,530 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-08 11:27:54,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:27:54,087 INFO L93 Difference]: Finished difference Result 72 states and 104 transitions. [2022-04-08 11:27:54,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 11:27:54,087 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-08 11:27:54,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:27:54,088 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-08 11:27:54,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 104 transitions. [2022-04-08 11:27:54,091 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-08 11:27:54,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 104 transitions. [2022-04-08 11:27:54,093 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 104 transitions. [2022-04-08 11:27:54,294 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-08 11:27:54,296 INFO L225 Difference]: With dead ends: 72 [2022-04-08 11:27:54,296 INFO L226 Difference]: Without dead ends: 51 [2022-04-08 11:27:54,297 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-04-08 11:27:54,298 INFO L913 BasicCegarLoop]: 49 mSDtfsCounter, 24 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 37 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.0s IncrementalHoareTripleChecker+Time [2022-04-08 11:27:54,298 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 107 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 207 Invalid, 2 Unknown, 0 Unchecked, 13.0s Time] [2022-04-08 11:27:54,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-08 11:27:54,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-04-08 11:27:54,323 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:27:54,324 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 51 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 29 states have internal predecessors, (34), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 11:27:54,324 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 51 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 29 states have internal predecessors, (34), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 11:27:54,324 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 51 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 29 states have internal predecessors, (34), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 11:27:54,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:27:54,327 INFO L93 Difference]: Finished difference Result 51 states and 69 transitions. [2022-04-08 11:27:54,327 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 69 transitions. [2022-04-08 11:27:54,328 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:27:54,328 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:27:54,329 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 29 states have internal predecessors, (34), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 51 states. [2022-04-08 11:27:54,329 INFO L87 Difference]: Start difference. First operand has 51 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 29 states have internal predecessors, (34), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 51 states. [2022-04-08 11:27:54,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:27:54,332 INFO L93 Difference]: Finished difference Result 51 states and 69 transitions. [2022-04-08 11:27:54,332 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 69 transitions. [2022-04-08 11:27:54,332 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:27:54,332 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:27:54,332 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:27:54,332 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:27:54,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 29 states have internal predecessors, (34), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 11:27:54,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 69 transitions. [2022-04-08 11:27:54,335 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 69 transitions. Word has length 21 [2022-04-08 11:27:54,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:27:54,335 INFO L478 AbstractCegarLoop]: Abstraction has 51 states and 69 transitions. [2022-04-08 11:27:54,335 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 11:27:54,336 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 69 transitions. [2022-04-08 11:27:54,590 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:27:54,590 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 69 transitions. [2022-04-08 11:27:54,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-08 11:27:54,590 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:27:54,591 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 11:27:54,591 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-08 11:27:54,591 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:27:54,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:27:54,591 INFO L85 PathProgramCache]: Analyzing trace with hash -1701877900, now seen corresponding path program 1 times [2022-04-08 11:27:54,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:27:54,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [707832988] [2022-04-08 11:27:54,612 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 11:27:54,612 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 11:27:54,612 INFO L85 PathProgramCache]: Analyzing trace with hash -1701877900, now seen corresponding path program 2 times [2022-04-08 11:27:54,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:27:54,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342540725] [2022-04-08 11:27:54,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:27:54,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:27:54,623 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:27:54,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1980545339] [2022-04-08 11:27:54,624 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 11:27:54,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:27:54,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:27:54,640 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-08 11:27:54,678 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-08 11:27:54,694 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 11:27:54,694 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:27:54,695 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 11:27:54,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:27:54,709 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:27:54,849 INFO L272 TraceCheckUtils]: 0: Hoare triple {1346#true} call ULTIMATE.init(); {1346#true} is VALID [2022-04-08 11:27:54,850 INFO L290 TraceCheckUtils]: 1: Hoare triple {1346#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; {1346#true} is VALID [2022-04-08 11:27:54,850 INFO L290 TraceCheckUtils]: 2: Hoare triple {1346#true} assume true; {1346#true} is VALID [2022-04-08 11:27:54,850 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1346#true} {1346#true} #102#return; {1346#true} is VALID [2022-04-08 11:27:54,850 INFO L272 TraceCheckUtils]: 4: Hoare triple {1346#true} call #t~ret7 := main(); {1346#true} is VALID [2022-04-08 11:27:54,850 INFO L290 TraceCheckUtils]: 5: Hoare triple {1346#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {1346#true} is VALID [2022-04-08 11:27:54,850 INFO L272 TraceCheckUtils]: 6: Hoare triple {1346#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {1346#true} is VALID [2022-04-08 11:27:54,851 INFO L290 TraceCheckUtils]: 7: Hoare triple {1346#true} ~cond := #in~cond; {1346#true} is VALID [2022-04-08 11:27:54,851 INFO L290 TraceCheckUtils]: 8: Hoare triple {1346#true} assume !(0 == ~cond); {1346#true} is VALID [2022-04-08 11:27:54,851 INFO L290 TraceCheckUtils]: 9: Hoare triple {1346#true} assume true; {1346#true} is VALID [2022-04-08 11:27:54,851 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1346#true} {1346#true} #82#return; {1346#true} is VALID [2022-04-08 11:27:54,852 INFO L290 TraceCheckUtils]: 11: Hoare triple {1346#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {1384#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-08 11:27:54,852 INFO L290 TraceCheckUtils]: 12: Hoare triple {1384#(and (= main_~p~0 0) (= main_~h~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1384#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-08 11:27:54,853 INFO L290 TraceCheckUtils]: 13: Hoare triple {1384#(and (= main_~p~0 0) (= main_~h~0 0))} assume !!(#t~post5 < 100);havoc #t~post5; {1384#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-08 11:27:54,853 INFO L290 TraceCheckUtils]: 14: Hoare triple {1384#(and (= main_~p~0 0) (= main_~h~0 0))} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {1384#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-08 11:27:54,854 INFO L290 TraceCheckUtils]: 15: Hoare triple {1384#(and (= main_~p~0 0) (= main_~h~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1384#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-08 11:27:54,854 INFO L290 TraceCheckUtils]: 16: Hoare triple {1384#(and (= main_~p~0 0) (= main_~h~0 0))} assume !(#t~post5 < 100);havoc #t~post5; {1384#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-08 11:27:54,855 INFO L290 TraceCheckUtils]: 17: Hoare triple {1384#(and (= main_~p~0 0) (= main_~h~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1384#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-08 11:27:54,855 INFO L290 TraceCheckUtils]: 18: Hoare triple {1384#(and (= main_~p~0 0) (= main_~h~0 0))} assume !(#t~post6 < 100);havoc #t~post6; {1384#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-08 11:27:54,856 INFO L272 TraceCheckUtils]: 19: Hoare triple {1384#(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)); {1409#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 11:27:54,857 INFO L290 TraceCheckUtils]: 20: Hoare triple {1409#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1413#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:27:54,857 INFO L290 TraceCheckUtils]: 21: Hoare triple {1413#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1347#false} is VALID [2022-04-08 11:27:54,857 INFO L290 TraceCheckUtils]: 22: Hoare triple {1347#false} assume !false; {1347#false} is VALID [2022-04-08 11:27:54,858 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-08 11:27:54,858 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 11:27:54,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:27:54,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342540725] [2022-04-08 11:27:54,858 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:27:54,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1980545339] [2022-04-08 11:27:54,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1980545339] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:27:54,858 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:27:54,859 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 11:27:54,859 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:27:54,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [707832988] [2022-04-08 11:27:54,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [707832988] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:27:54,859 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:27:54,859 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 11:27:54,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158160388] [2022-04-08 11:27:54,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:27:54,860 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-08 11:27:54,860 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:27:54,860 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-08 11:27:54,880 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-08 11:27:54,881 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 11:27:54,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:27:54,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 11:27:54,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 11:27:54,882 INFO L87 Difference]: Start difference. First operand 51 states and 69 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-08 11:28:00,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:28:00,910 INFO L93 Difference]: Finished difference Result 73 states and 99 transitions. [2022-04-08 11:28:00,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 11:28:00,910 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-08 11:28:00,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:28:00,911 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-08 11:28:00,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 73 transitions. [2022-04-08 11:28:00,912 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-08 11:28:00,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 73 transitions. [2022-04-08 11:28:00,914 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 73 transitions. [2022-04-08 11:28:00,990 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-08 11:28:00,992 INFO L225 Difference]: With dead ends: 73 [2022-04-08 11:28:00,992 INFO L226 Difference]: Without dead ends: 52 [2022-04-08 11:28:00,993 INFO L912 BasicCegarLoop]: 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-08 11:28:00,993 INFO L913 BasicCegarLoop]: 51 mSDtfsCounter, 8 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-08 11:28:00,994 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 157 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-08 11:28:00,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-08 11:28:01,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-04-08 11:28:01,010 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:28:01,011 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 52 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 29 states have internal predecessors, (35), 20 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-08 11:28:01,011 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 52 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 29 states have internal predecessors, (35), 20 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-08 11:28:01,012 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 52 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 29 states have internal predecessors, (35), 20 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-08 11:28:01,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:28:01,015 INFO L93 Difference]: Finished difference Result 52 states and 72 transitions. [2022-04-08 11:28:01,015 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 72 transitions. [2022-04-08 11:28:01,016 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:28:01,016 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:28:01,016 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 29 states have internal predecessors, (35), 20 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 52 states. [2022-04-08 11:28:01,016 INFO L87 Difference]: Start difference. First operand has 52 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 29 states have internal predecessors, (35), 20 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 52 states. [2022-04-08 11:28:01,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:28:01,019 INFO L93 Difference]: Finished difference Result 52 states and 72 transitions. [2022-04-08 11:28:01,019 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 72 transitions. [2022-04-08 11:28:01,019 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:28:01,019 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:28:01,020 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:28:01,020 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:28:01,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 29 states have internal predecessors, (35), 20 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-08 11:28:01,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 72 transitions. [2022-04-08 11:28:01,022 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 72 transitions. Word has length 23 [2022-04-08 11:28:01,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:28:01,023 INFO L478 AbstractCegarLoop]: Abstraction has 52 states and 72 transitions. [2022-04-08 11:28:01,023 INFO L479 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-08 11:28:01,023 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 72 transitions. [2022-04-08 11:28:01,093 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:28:01,093 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 72 transitions. [2022-04-08 11:28:01,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-08 11:28:01,093 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:28:01,093 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 11:28:01,109 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-04-08 11:28:01,294 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:28:01,294 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:28:01,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:28:01,295 INFO L85 PathProgramCache]: Analyzing trace with hash -1700388350, now seen corresponding path program 1 times [2022-04-08 11:28:01,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:28:01,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [99994012] [2022-04-08 11:28:01,303 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 11:28:01,304 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 11:28:01,304 INFO L85 PathProgramCache]: Analyzing trace with hash -1700388350, now seen corresponding path program 2 times [2022-04-08 11:28:01,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:28:01,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830276731] [2022-04-08 11:28:01,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:28:01,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:28:01,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:28:01,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 11:28:01,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:28:01,392 INFO L290 TraceCheckUtils]: 0: Hoare triple {1787#(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; {1780#(<= ~counter~0 0)} is VALID [2022-04-08 11:28:01,392 INFO L290 TraceCheckUtils]: 1: Hoare triple {1780#(<= ~counter~0 0)} assume true; {1780#(<= ~counter~0 0)} is VALID [2022-04-08 11:28:01,393 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1780#(<= ~counter~0 0)} {1775#true} #102#return; {1780#(<= ~counter~0 0)} is VALID [2022-04-08 11:28:01,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-08 11:28:01,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:28:01,408 INFO L290 TraceCheckUtils]: 0: Hoare triple {1775#true} ~cond := #in~cond; {1775#true} is VALID [2022-04-08 11:28:01,408 INFO L290 TraceCheckUtils]: 1: Hoare triple {1775#true} assume !(0 == ~cond); {1775#true} is VALID [2022-04-08 11:28:01,408 INFO L290 TraceCheckUtils]: 2: Hoare triple {1775#true} assume true; {1775#true} is VALID [2022-04-08 11:28:01,411 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1775#true} {1780#(<= ~counter~0 0)} #82#return; {1780#(<= ~counter~0 0)} is VALID [2022-04-08 11:28:01,414 INFO L272 TraceCheckUtils]: 0: Hoare triple {1775#true} call ULTIMATE.init(); {1787#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 11:28:01,415 INFO L290 TraceCheckUtils]: 1: Hoare triple {1787#(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; {1780#(<= ~counter~0 0)} is VALID [2022-04-08 11:28:01,415 INFO L290 TraceCheckUtils]: 2: Hoare triple {1780#(<= ~counter~0 0)} assume true; {1780#(<= ~counter~0 0)} is VALID [2022-04-08 11:28:01,416 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1780#(<= ~counter~0 0)} {1775#true} #102#return; {1780#(<= ~counter~0 0)} is VALID [2022-04-08 11:28:01,416 INFO L272 TraceCheckUtils]: 4: Hoare triple {1780#(<= ~counter~0 0)} call #t~ret7 := main(); {1780#(<= ~counter~0 0)} is VALID [2022-04-08 11:28:01,417 INFO L290 TraceCheckUtils]: 5: Hoare triple {1780#(<= ~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; {1780#(<= ~counter~0 0)} is VALID [2022-04-08 11:28:01,417 INFO L272 TraceCheckUtils]: 6: Hoare triple {1780#(<= ~counter~0 0)} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {1775#true} is VALID [2022-04-08 11:28:01,417 INFO L290 TraceCheckUtils]: 7: Hoare triple {1775#true} ~cond := #in~cond; {1775#true} is VALID [2022-04-08 11:28:01,417 INFO L290 TraceCheckUtils]: 8: Hoare triple {1775#true} assume !(0 == ~cond); {1775#true} is VALID [2022-04-08 11:28:01,417 INFO L290 TraceCheckUtils]: 9: Hoare triple {1775#true} assume true; {1775#true} is VALID [2022-04-08 11:28:01,418 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1775#true} {1780#(<= ~counter~0 0)} #82#return; {1780#(<= ~counter~0 0)} is VALID [2022-04-08 11:28:01,418 INFO L290 TraceCheckUtils]: 11: Hoare triple {1780#(<= ~counter~0 0)} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {1780#(<= ~counter~0 0)} is VALID [2022-04-08 11:28:01,419 INFO L290 TraceCheckUtils]: 12: Hoare triple {1780#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1785#(<= ~counter~0 1)} is VALID [2022-04-08 11:28:01,419 INFO L290 TraceCheckUtils]: 13: Hoare triple {1785#(<= ~counter~0 1)} assume !!(#t~post5 < 100);havoc #t~post5; {1785#(<= ~counter~0 1)} is VALID [2022-04-08 11:28:01,419 INFO L290 TraceCheckUtils]: 14: Hoare triple {1785#(<= ~counter~0 1)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {1785#(<= ~counter~0 1)} is VALID [2022-04-08 11:28:01,420 INFO L290 TraceCheckUtils]: 15: Hoare triple {1785#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1786#(<= |main_#t~post5| 1)} is VALID [2022-04-08 11:28:01,420 INFO L290 TraceCheckUtils]: 16: Hoare triple {1786#(<= |main_#t~post5| 1)} assume !(#t~post5 < 100);havoc #t~post5; {1776#false} is VALID [2022-04-08 11:28:01,421 INFO L290 TraceCheckUtils]: 17: Hoare triple {1776#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1776#false} is VALID [2022-04-08 11:28:01,421 INFO L290 TraceCheckUtils]: 18: Hoare triple {1776#false} assume !!(#t~post6 < 100);havoc #t~post6; {1776#false} is VALID [2022-04-08 11:28:01,421 INFO L272 TraceCheckUtils]: 19: Hoare triple {1776#false} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {1776#false} is VALID [2022-04-08 11:28:01,421 INFO L290 TraceCheckUtils]: 20: Hoare triple {1776#false} ~cond := #in~cond; {1776#false} is VALID [2022-04-08 11:28:01,421 INFO L290 TraceCheckUtils]: 21: Hoare triple {1776#false} assume 0 == ~cond; {1776#false} is VALID [2022-04-08 11:28:01,421 INFO L290 TraceCheckUtils]: 22: Hoare triple {1776#false} assume !false; {1776#false} is VALID [2022-04-08 11:28:01,421 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-08 11:28:01,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:28:01,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830276731] [2022-04-08 11:28:01,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830276731] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 11:28:01,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1576364900] [2022-04-08 11:28:01,422 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 11:28:01,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:28:01,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:28:01,423 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-08 11:28:01,428 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-08 11:28:01,467 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 11:28:01,467 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:28:01,468 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-08 11:28:01,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:28:01,475 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:28:01,570 INFO L272 TraceCheckUtils]: 0: Hoare triple {1775#true} call ULTIMATE.init(); {1775#true} is VALID [2022-04-08 11:28:01,570 INFO L290 TraceCheckUtils]: 1: Hoare triple {1775#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1775#true} is VALID [2022-04-08 11:28:01,570 INFO L290 TraceCheckUtils]: 2: Hoare triple {1775#true} assume true; {1775#true} is VALID [2022-04-08 11:28:01,570 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1775#true} {1775#true} #102#return; {1775#true} is VALID [2022-04-08 11:28:01,570 INFO L272 TraceCheckUtils]: 4: Hoare triple {1775#true} call #t~ret7 := main(); {1775#true} is VALID [2022-04-08 11:28:01,570 INFO L290 TraceCheckUtils]: 5: Hoare triple {1775#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {1775#true} is VALID [2022-04-08 11:28:01,571 INFO L272 TraceCheckUtils]: 6: Hoare triple {1775#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {1775#true} is VALID [2022-04-08 11:28:01,571 INFO L290 TraceCheckUtils]: 7: Hoare triple {1775#true} ~cond := #in~cond; {1775#true} is VALID [2022-04-08 11:28:01,571 INFO L290 TraceCheckUtils]: 8: Hoare triple {1775#true} assume !(0 == ~cond); {1775#true} is VALID [2022-04-08 11:28:01,571 INFO L290 TraceCheckUtils]: 9: Hoare triple {1775#true} assume true; {1775#true} is VALID [2022-04-08 11:28:01,571 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1775#true} {1775#true} #82#return; {1775#true} is VALID [2022-04-08 11:28:01,571 INFO L290 TraceCheckUtils]: 11: Hoare triple {1775#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {1775#true} is VALID [2022-04-08 11:28:01,571 INFO L290 TraceCheckUtils]: 12: Hoare triple {1775#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1775#true} is VALID [2022-04-08 11:28:01,571 INFO L290 TraceCheckUtils]: 13: Hoare triple {1775#true} assume !!(#t~post5 < 100);havoc #t~post5; {1775#true} is VALID [2022-04-08 11:28:01,572 INFO L290 TraceCheckUtils]: 14: Hoare triple {1775#true} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {1775#true} is VALID [2022-04-08 11:28:01,572 INFO L290 TraceCheckUtils]: 15: Hoare triple {1775#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1836#(<= (+ |main_#t~post5| 1) ~counter~0)} is VALID [2022-04-08 11:28:01,572 INFO L290 TraceCheckUtils]: 16: Hoare triple {1836#(<= (+ |main_#t~post5| 1) ~counter~0)} assume !(#t~post5 < 100);havoc #t~post5; {1840#(<= 101 ~counter~0)} is VALID [2022-04-08 11:28:01,573 INFO L290 TraceCheckUtils]: 17: Hoare triple {1840#(<= 101 ~counter~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1844#(<= 101 |main_#t~post6|)} is VALID [2022-04-08 11:28:01,573 INFO L290 TraceCheckUtils]: 18: Hoare triple {1844#(<= 101 |main_#t~post6|)} assume !!(#t~post6 < 100);havoc #t~post6; {1776#false} is VALID [2022-04-08 11:28:01,573 INFO L272 TraceCheckUtils]: 19: Hoare triple {1776#false} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {1776#false} is VALID [2022-04-08 11:28:01,573 INFO L290 TraceCheckUtils]: 20: Hoare triple {1776#false} ~cond := #in~cond; {1776#false} is VALID [2022-04-08 11:28:01,574 INFO L290 TraceCheckUtils]: 21: Hoare triple {1776#false} assume 0 == ~cond; {1776#false} is VALID [2022-04-08 11:28:01,574 INFO L290 TraceCheckUtils]: 22: Hoare triple {1776#false} assume !false; {1776#false} is VALID [2022-04-08 11:28:01,574 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-08 11:28:01,574 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 11:28:01,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1576364900] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:28:01,574 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-08 11:28:01,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2022-04-08 11:28:01,574 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:28:01,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [99994012] [2022-04-08 11:28:01,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [99994012] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:28:01,575 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:28:01,575 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 11:28:01,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352848663] [2022-04-08 11:28:01,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:28:01,575 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-08 11:28:01,575 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:28:01,576 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-08 11:28:01,591 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-08 11:28:01,591 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 11:28:01,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:28:01,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 11:28:01,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-04-08 11:28:01,592 INFO L87 Difference]: Start difference. First operand 52 states and 72 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-08 11:28:09,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:28:09,785 INFO L93 Difference]: Finished difference Result 98 states and 135 transitions. [2022-04-08 11:28:09,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 11:28:09,785 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-08 11:28:09,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:28:09,785 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-08 11:28:09,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 86 transitions. [2022-04-08 11:28:09,787 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-08 11:28:09,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 86 transitions. [2022-04-08 11:28:09,789 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 86 transitions. [2022-04-08 11:28:09,867 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-08 11:28:09,869 INFO L225 Difference]: With dead ends: 98 [2022-04-08 11:28:09,869 INFO L226 Difference]: Without dead ends: 64 [2022-04-08 11:28:09,870 INFO L912 BasicCegarLoop]: 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-08 11:28:09,870 INFO L913 BasicCegarLoop]: 45 mSDtfsCounter, 8 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-08 11:28:09,871 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 170 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-08 11:28:09,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-04-08 11:28:09,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2022-04-08 11:28:09,902 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:28:09,902 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand has 62 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 36 states have internal predecessors, (42), 22 states have call successors, (22), 7 states have call predecessors, (22), 5 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-08 11:28:09,902 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand has 62 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 36 states have internal predecessors, (42), 22 states have call successors, (22), 7 states have call predecessors, (22), 5 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-08 11:28:09,903 INFO L87 Difference]: Start difference. First operand 64 states. Second operand has 62 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 36 states have internal predecessors, (42), 22 states have call successors, (22), 7 states have call predecessors, (22), 5 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-08 11:28:09,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:28:09,905 INFO L93 Difference]: Finished difference Result 64 states and 83 transitions. [2022-04-08 11:28:09,906 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 83 transitions. [2022-04-08 11:28:09,906 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:28:09,906 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:28:09,907 INFO L74 IsIncluded]: Start isIncluded. First operand has 62 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 36 states have internal predecessors, (42), 22 states have call successors, (22), 7 states have call predecessors, (22), 5 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand 64 states. [2022-04-08 11:28:09,907 INFO L87 Difference]: Start difference. First operand has 62 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 36 states have internal predecessors, (42), 22 states have call successors, (22), 7 states have call predecessors, (22), 5 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand 64 states. [2022-04-08 11:28:09,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:28:09,909 INFO L93 Difference]: Finished difference Result 64 states and 83 transitions. [2022-04-08 11:28:09,909 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 83 transitions. [2022-04-08 11:28:09,910 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:28:09,910 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:28:09,910 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:28:09,910 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:28:09,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 36 states have internal predecessors, (42), 22 states have call successors, (22), 7 states have call predecessors, (22), 5 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-08 11:28:09,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 82 transitions. [2022-04-08 11:28:09,913 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 82 transitions. Word has length 23 [2022-04-08 11:28:09,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:28:09,913 INFO L478 AbstractCegarLoop]: Abstraction has 62 states and 82 transitions. [2022-04-08 11:28:09,913 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 11:28:09,913 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 62 states and 82 transitions. [2022-04-08 11:28:10,005 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:28:10,005 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 82 transitions. [2022-04-08 11:28:10,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-08 11:28:10,006 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:28:10,006 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 11:28:10,024 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-04-08 11:28:10,206 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:28:10,207 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:28:10,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:28:10,207 INFO L85 PathProgramCache]: Analyzing trace with hash -1562772727, now seen corresponding path program 1 times [2022-04-08 11:28:10,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:28:10,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1678242976] [2022-04-08 11:28:10,213 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 11:28:10,213 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 11:28:10,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1562772727, now seen corresponding path program 2 times [2022-04-08 11:28:10,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:28:10,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084525016] [2022-04-08 11:28:10,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:28:10,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:28:10,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:28:10,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 11:28:10,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:28:10,458 INFO L290 TraceCheckUtils]: 0: Hoare triple {2323#(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; {2309#true} is VALID [2022-04-08 11:28:10,459 INFO L290 TraceCheckUtils]: 1: Hoare triple {2309#true} assume true; {2309#true} is VALID [2022-04-08 11:28:10,459 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2309#true} {2309#true} #102#return; {2309#true} is VALID [2022-04-08 11:28:10,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-08 11:28:10,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:28:10,467 INFO L290 TraceCheckUtils]: 0: Hoare triple {2309#true} ~cond := #in~cond; {2309#true} is VALID [2022-04-08 11:28:10,467 INFO L290 TraceCheckUtils]: 1: Hoare triple {2309#true} assume !(0 == ~cond); {2309#true} is VALID [2022-04-08 11:28:10,468 INFO L290 TraceCheckUtils]: 2: Hoare triple {2309#true} assume true; {2309#true} is VALID [2022-04-08 11:28:10,468 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2309#true} {2309#true} #82#return; {2309#true} is VALID [2022-04-08 11:28:10,469 INFO L272 TraceCheckUtils]: 0: Hoare triple {2309#true} call ULTIMATE.init(); {2323#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 11:28:10,469 INFO L290 TraceCheckUtils]: 1: Hoare triple {2323#(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; {2309#true} is VALID [2022-04-08 11:28:10,469 INFO L290 TraceCheckUtils]: 2: Hoare triple {2309#true} assume true; {2309#true} is VALID [2022-04-08 11:28:10,469 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2309#true} {2309#true} #102#return; {2309#true} is VALID [2022-04-08 11:28:10,469 INFO L272 TraceCheckUtils]: 4: Hoare triple {2309#true} call #t~ret7 := main(); {2309#true} is VALID [2022-04-08 11:28:10,469 INFO L290 TraceCheckUtils]: 5: Hoare triple {2309#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {2309#true} is VALID [2022-04-08 11:28:10,469 INFO L272 TraceCheckUtils]: 6: Hoare triple {2309#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {2309#true} is VALID [2022-04-08 11:28:10,470 INFO L290 TraceCheckUtils]: 7: Hoare triple {2309#true} ~cond := #in~cond; {2309#true} is VALID [2022-04-08 11:28:10,470 INFO L290 TraceCheckUtils]: 8: Hoare triple {2309#true} assume !(0 == ~cond); {2309#true} is VALID [2022-04-08 11:28:10,470 INFO L290 TraceCheckUtils]: 9: Hoare triple {2309#true} assume true; {2309#true} is VALID [2022-04-08 11:28:10,470 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2309#true} {2309#true} #82#return; {2309#true} is VALID [2022-04-08 11:28:10,470 INFO L290 TraceCheckUtils]: 11: Hoare triple {2309#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {2318#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-08 11:28:10,471 INFO L290 TraceCheckUtils]: 12: Hoare triple {2318#(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; {2318#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-08 11:28:10,471 INFO L290 TraceCheckUtils]: 13: Hoare triple {2318#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} assume !!(#t~post5 < 100);havoc #t~post5; {2318#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-08 11:28:10,472 INFO L290 TraceCheckUtils]: 14: Hoare triple {2318#(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; {2319#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-08 11:28:10,473 INFO L290 TraceCheckUtils]: 15: Hoare triple {2319#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2319#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-08 11:28:10,473 INFO L290 TraceCheckUtils]: 16: Hoare triple {2319#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} assume !!(#t~post5 < 100);havoc #t~post5; {2319#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-08 11:28:10,474 INFO L290 TraceCheckUtils]: 17: Hoare triple {2319#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {2320#(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-08 11:28:10,475 INFO L290 TraceCheckUtils]: 18: Hoare triple {2320#(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; {2320#(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-08 11:28:10,475 INFO L290 TraceCheckUtils]: 19: Hoare triple {2320#(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 < 100);havoc #t~post6; {2320#(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-08 11:28:10,476 INFO L272 TraceCheckUtils]: 20: Hoare triple {2320#(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)); {2321#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:28:10,477 INFO L290 TraceCheckUtils]: 21: Hoare triple {2321#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {2322#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 11:28:10,481 INFO L290 TraceCheckUtils]: 22: Hoare triple {2322#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {2310#false} is VALID [2022-04-08 11:28:10,481 INFO L290 TraceCheckUtils]: 23: Hoare triple {2310#false} assume !false; {2310#false} is VALID [2022-04-08 11:28:10,481 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-08 11:28:10,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:28:10,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084525016] [2022-04-08 11:28:10,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084525016] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 11:28:10,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1916367629] [2022-04-08 11:28:10,482 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 11:28:10,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:28:10,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:28:10,483 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-08 11:28:10,506 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-08 11:28:10,524 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 11:28:10,524 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:28:10,525 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-08 11:28:10,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:28:10,541 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:28:11,275 INFO L272 TraceCheckUtils]: 0: Hoare triple {2309#true} call ULTIMATE.init(); {2309#true} is VALID [2022-04-08 11:28:11,275 INFO L290 TraceCheckUtils]: 1: Hoare triple {2309#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; {2309#true} is VALID [2022-04-08 11:28:11,276 INFO L290 TraceCheckUtils]: 2: Hoare triple {2309#true} assume true; {2309#true} is VALID [2022-04-08 11:28:11,276 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2309#true} {2309#true} #102#return; {2309#true} is VALID [2022-04-08 11:28:11,276 INFO L272 TraceCheckUtils]: 4: Hoare triple {2309#true} call #t~ret7 := main(); {2309#true} is VALID [2022-04-08 11:28:11,276 INFO L290 TraceCheckUtils]: 5: Hoare triple {2309#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {2309#true} is VALID [2022-04-08 11:28:11,276 INFO L272 TraceCheckUtils]: 6: Hoare triple {2309#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {2309#true} is VALID [2022-04-08 11:28:11,276 INFO L290 TraceCheckUtils]: 7: Hoare triple {2309#true} ~cond := #in~cond; {2309#true} is VALID [2022-04-08 11:28:11,276 INFO L290 TraceCheckUtils]: 8: Hoare triple {2309#true} assume !(0 == ~cond); {2309#true} is VALID [2022-04-08 11:28:11,276 INFO L290 TraceCheckUtils]: 9: Hoare triple {2309#true} assume true; {2309#true} is VALID [2022-04-08 11:28:11,277 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2309#true} {2309#true} #82#return; {2309#true} is VALID [2022-04-08 11:28:11,277 INFO L290 TraceCheckUtils]: 11: Hoare triple {2309#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {2319#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-08 11:28:11,278 INFO L290 TraceCheckUtils]: 12: Hoare triple {2319#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2319#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-08 11:28:11,278 INFO L290 TraceCheckUtils]: 13: Hoare triple {2319#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} assume !!(#t~post5 < 100);havoc #t~post5; {2319#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-08 11:28:11,279 INFO L290 TraceCheckUtils]: 14: Hoare triple {2319#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {2319#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-08 11:28:11,279 INFO L290 TraceCheckUtils]: 15: Hoare triple {2319#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2319#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-08 11:28:11,279 INFO L290 TraceCheckUtils]: 16: Hoare triple {2319#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} assume !!(#t~post5 < 100);havoc #t~post5; {2319#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-08 11:28:11,280 INFO L290 TraceCheckUtils]: 17: Hoare triple {2319#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {2320#(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-08 11:28:11,281 INFO L290 TraceCheckUtils]: 18: Hoare triple {2320#(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; {2320#(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-08 11:28:11,282 INFO L290 TraceCheckUtils]: 19: Hoare triple {2320#(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 < 100);havoc #t~post6; {2320#(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-08 11:28:11,283 INFO L272 TraceCheckUtils]: 20: Hoare triple {2320#(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)); {2387#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 11:28:11,283 INFO L290 TraceCheckUtils]: 21: Hoare triple {2387#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2391#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:28:11,284 INFO L290 TraceCheckUtils]: 22: Hoare triple {2391#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2310#false} is VALID [2022-04-08 11:28:11,284 INFO L290 TraceCheckUtils]: 23: Hoare triple {2310#false} assume !false; {2310#false} is VALID [2022-04-08 11:28:11,284 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-08 11:28:11,284 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 11:28:11,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1916367629] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:28:11,284 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-08 11:28:11,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 10 [2022-04-08 11:28:11,285 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:28:11,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1678242976] [2022-04-08 11:28:11,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1678242976] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:28:11,285 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:28:11,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 11:28:11,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665624305] [2022-04-08 11:28:11,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:28:11,286 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-08 11:28:11,286 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:28:11,286 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-08 11:28:11,304 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-08 11:28:11,304 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 11:28:11,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:28:11,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 11:28:11,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-04-08 11:28:11,305 INFO L87 Difference]: Start difference. First operand 62 states and 82 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-08 11:28:16,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:28:16,771 INFO L93 Difference]: Finished difference Result 85 states and 114 transitions. [2022-04-08 11:28:16,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 11:28:16,772 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-08 11:28:16,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:28:16,772 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-08 11:28:16,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 95 transitions. [2022-04-08 11:28:16,774 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-08 11:28:16,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 95 transitions. [2022-04-08 11:28:16,776 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 95 transitions. [2022-04-08 11:28:17,198 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-08 11:28:17,200 INFO L225 Difference]: With dead ends: 85 [2022-04-08 11:28:17,200 INFO L226 Difference]: Without dead ends: 69 [2022-04-08 11:28:17,201 INFO L912 BasicCegarLoop]: 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-08 11:28:17,201 INFO L913 BasicCegarLoop]: 51 mSDtfsCounter, 16 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-08 11:28:17,202 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 182 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-04-08 11:28:17,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-04-08 11:28:17,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2022-04-08 11:28:17,242 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:28:17,242 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-08 11:28:17,243 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-08 11:28:17,244 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-08 11:28:17,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:28:17,248 INFO L93 Difference]: Finished difference Result 69 states and 92 transitions. [2022-04-08 11:28:17,248 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 92 transitions. [2022-04-08 11:28:17,249 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:28:17,249 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:28:17,249 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-08 11:28:17,249 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-08 11:28:17,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:28:17,252 INFO L93 Difference]: Finished difference Result 69 states and 92 transitions. [2022-04-08 11:28:17,252 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 92 transitions. [2022-04-08 11:28:17,253 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:28:17,253 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:28:17,253 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:28:17,253 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:28:17,253 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-08 11:28:17,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 92 transitions. [2022-04-08 11:28:17,257 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 92 transitions. Word has length 24 [2022-04-08 11:28:17,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:28:17,258 INFO L478 AbstractCegarLoop]: Abstraction has 69 states and 92 transitions. [2022-04-08 11:28:17,258 INFO L479 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-08 11:28:17,258 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 69 states and 92 transitions. [2022-04-08 11:28:17,575 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-08 11:28:17,575 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 92 transitions. [2022-04-08 11:28:17,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-04-08 11:28:17,576 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:28:17,576 INFO L499 BasicCegarLoop]: 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-08 11:28:17,593 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-08 11:28:17,783 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:28:17,783 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:28:17,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:28:17,784 INFO L85 PathProgramCache]: Analyzing trace with hash 107903087, now seen corresponding path program 1 times [2022-04-08 11:28:17,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:28:17,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [578157544] [2022-04-08 11:28:17,790 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 11:28:17,790 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 11:28:17,790 INFO L85 PathProgramCache]: Analyzing trace with hash 107903087, now seen corresponding path program 2 times [2022-04-08 11:28:17,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:28:17,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306551784] [2022-04-08 11:28:17,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:28:17,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:28:17,804 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:28:17,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1589958860] [2022-04-08 11:28:17,804 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 11:28:17,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:28:17,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:28:17,805 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-08 11:28:17,827 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-08 11:28:17,902 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 11:28:17,902 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:28:17,903 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-08 11:28:17,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:28:17,918 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:28:18,235 INFO L272 TraceCheckUtils]: 0: Hoare triple {2847#true} call ULTIMATE.init(); {2847#true} is VALID [2022-04-08 11:28:18,236 INFO L290 TraceCheckUtils]: 1: Hoare triple {2847#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; {2855#(<= ~counter~0 0)} is VALID [2022-04-08 11:28:18,237 INFO L290 TraceCheckUtils]: 2: Hoare triple {2855#(<= ~counter~0 0)} assume true; {2855#(<= ~counter~0 0)} is VALID [2022-04-08 11:28:18,237 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2855#(<= ~counter~0 0)} {2847#true} #102#return; {2855#(<= ~counter~0 0)} is VALID [2022-04-08 11:28:18,237 INFO L272 TraceCheckUtils]: 4: Hoare triple {2855#(<= ~counter~0 0)} call #t~ret7 := main(); {2855#(<= ~counter~0 0)} is VALID [2022-04-08 11:28:18,238 INFO L290 TraceCheckUtils]: 5: Hoare triple {2855#(<= ~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; {2855#(<= ~counter~0 0)} is VALID [2022-04-08 11:28:18,238 INFO L272 TraceCheckUtils]: 6: Hoare triple {2855#(<= ~counter~0 0)} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {2855#(<= ~counter~0 0)} is VALID [2022-04-08 11:28:18,239 INFO L290 TraceCheckUtils]: 7: Hoare triple {2855#(<= ~counter~0 0)} ~cond := #in~cond; {2855#(<= ~counter~0 0)} is VALID [2022-04-08 11:28:18,239 INFO L290 TraceCheckUtils]: 8: Hoare triple {2855#(<= ~counter~0 0)} assume !(0 == ~cond); {2855#(<= ~counter~0 0)} is VALID [2022-04-08 11:28:18,239 INFO L290 TraceCheckUtils]: 9: Hoare triple {2855#(<= ~counter~0 0)} assume true; {2855#(<= ~counter~0 0)} is VALID [2022-04-08 11:28:18,240 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2855#(<= ~counter~0 0)} {2855#(<= ~counter~0 0)} #82#return; {2855#(<= ~counter~0 0)} is VALID [2022-04-08 11:28:18,241 INFO L290 TraceCheckUtils]: 11: Hoare triple {2855#(<= ~counter~0 0)} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {2855#(<= ~counter~0 0)} is VALID [2022-04-08 11:28:18,241 INFO L290 TraceCheckUtils]: 12: Hoare triple {2855#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2889#(<= ~counter~0 1)} is VALID [2022-04-08 11:28:18,242 INFO L290 TraceCheckUtils]: 13: Hoare triple {2889#(<= ~counter~0 1)} assume !!(#t~post5 < 100);havoc #t~post5; {2889#(<= ~counter~0 1)} is VALID [2022-04-08 11:28:18,242 INFO L290 TraceCheckUtils]: 14: Hoare triple {2889#(<= ~counter~0 1)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {2889#(<= ~counter~0 1)} is VALID [2022-04-08 11:28:18,242 INFO L290 TraceCheckUtils]: 15: Hoare triple {2889#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2899#(<= ~counter~0 2)} is VALID [2022-04-08 11:28:18,243 INFO L290 TraceCheckUtils]: 16: Hoare triple {2899#(<= ~counter~0 2)} assume !!(#t~post5 < 100);havoc #t~post5; {2899#(<= ~counter~0 2)} is VALID [2022-04-08 11:28:18,243 INFO L290 TraceCheckUtils]: 17: Hoare triple {2899#(<= ~counter~0 2)} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {2899#(<= ~counter~0 2)} is VALID [2022-04-08 11:28:18,244 INFO L290 TraceCheckUtils]: 18: Hoare triple {2899#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2909#(<= ~counter~0 3)} is VALID [2022-04-08 11:28:18,244 INFO L290 TraceCheckUtils]: 19: Hoare triple {2909#(<= ~counter~0 3)} assume !!(#t~post6 < 100);havoc #t~post6; {2909#(<= ~counter~0 3)} is VALID [2022-04-08 11:28:18,245 INFO L272 TraceCheckUtils]: 20: Hoare triple {2909#(<= ~counter~0 3)} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {2909#(<= ~counter~0 3)} is VALID [2022-04-08 11:28:18,245 INFO L290 TraceCheckUtils]: 21: Hoare triple {2909#(<= ~counter~0 3)} ~cond := #in~cond; {2909#(<= ~counter~0 3)} is VALID [2022-04-08 11:28:18,245 INFO L290 TraceCheckUtils]: 22: Hoare triple {2909#(<= ~counter~0 3)} assume !(0 == ~cond); {2909#(<= ~counter~0 3)} is VALID [2022-04-08 11:28:18,246 INFO L290 TraceCheckUtils]: 23: Hoare triple {2909#(<= ~counter~0 3)} assume true; {2909#(<= ~counter~0 3)} is VALID [2022-04-08 11:28:18,250 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {2909#(<= ~counter~0 3)} {2909#(<= ~counter~0 3)} #84#return; {2909#(<= ~counter~0 3)} is VALID [2022-04-08 11:28:18,251 INFO L272 TraceCheckUtils]: 25: Hoare triple {2909#(<= ~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)); {2909#(<= ~counter~0 3)} is VALID [2022-04-08 11:28:18,258 INFO L290 TraceCheckUtils]: 26: Hoare triple {2909#(<= ~counter~0 3)} ~cond := #in~cond; {2909#(<= ~counter~0 3)} is VALID [2022-04-08 11:28:18,258 INFO L290 TraceCheckUtils]: 27: Hoare triple {2909#(<= ~counter~0 3)} assume !(0 == ~cond); {2909#(<= ~counter~0 3)} is VALID [2022-04-08 11:28:18,259 INFO L290 TraceCheckUtils]: 28: Hoare triple {2909#(<= ~counter~0 3)} assume true; {2909#(<= ~counter~0 3)} is VALID [2022-04-08 11:28:18,260 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {2909#(<= ~counter~0 3)} {2909#(<= ~counter~0 3)} #86#return; {2909#(<= ~counter~0 3)} is VALID [2022-04-08 11:28:18,264 INFO L272 TraceCheckUtils]: 30: Hoare triple {2909#(<= ~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)); {2909#(<= ~counter~0 3)} is VALID [2022-04-08 11:28:18,264 INFO L290 TraceCheckUtils]: 31: Hoare triple {2909#(<= ~counter~0 3)} ~cond := #in~cond; {2909#(<= ~counter~0 3)} is VALID [2022-04-08 11:28:18,265 INFO L290 TraceCheckUtils]: 32: Hoare triple {2909#(<= ~counter~0 3)} assume !(0 == ~cond); {2909#(<= ~counter~0 3)} is VALID [2022-04-08 11:28:18,265 INFO L290 TraceCheckUtils]: 33: Hoare triple {2909#(<= ~counter~0 3)} assume true; {2909#(<= ~counter~0 3)} is VALID [2022-04-08 11:28:18,266 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2909#(<= ~counter~0 3)} {2909#(<= ~counter~0 3)} #88#return; {2909#(<= ~counter~0 3)} is VALID [2022-04-08 11:28:18,266 INFO L272 TraceCheckUtils]: 35: Hoare triple {2909#(<= ~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)); {2909#(<= ~counter~0 3)} is VALID [2022-04-08 11:28:18,272 INFO L290 TraceCheckUtils]: 36: Hoare triple {2909#(<= ~counter~0 3)} ~cond := #in~cond; {2909#(<= ~counter~0 3)} is VALID [2022-04-08 11:28:18,272 INFO L290 TraceCheckUtils]: 37: Hoare triple {2909#(<= ~counter~0 3)} assume !(0 == ~cond); {2909#(<= ~counter~0 3)} is VALID [2022-04-08 11:28:18,272 INFO L290 TraceCheckUtils]: 38: Hoare triple {2909#(<= ~counter~0 3)} assume true; {2909#(<= ~counter~0 3)} is VALID [2022-04-08 11:28:18,273 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {2909#(<= ~counter~0 3)} {2909#(<= ~counter~0 3)} #90#return; {2909#(<= ~counter~0 3)} is VALID [2022-04-08 11:28:18,273 INFO L272 TraceCheckUtils]: 40: Hoare triple {2909#(<= ~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)); {2909#(<= ~counter~0 3)} is VALID [2022-04-08 11:28:18,274 INFO L290 TraceCheckUtils]: 41: Hoare triple {2909#(<= ~counter~0 3)} ~cond := #in~cond; {2909#(<= ~counter~0 3)} is VALID [2022-04-08 11:28:18,274 INFO L290 TraceCheckUtils]: 42: Hoare triple {2909#(<= ~counter~0 3)} assume !(0 == ~cond); {2909#(<= ~counter~0 3)} is VALID [2022-04-08 11:28:18,274 INFO L290 TraceCheckUtils]: 43: Hoare triple {2909#(<= ~counter~0 3)} assume true; {2909#(<= ~counter~0 3)} is VALID [2022-04-08 11:28:18,275 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {2909#(<= ~counter~0 3)} {2909#(<= ~counter~0 3)} #92#return; {2909#(<= ~counter~0 3)} is VALID [2022-04-08 11:28:18,276 INFO L272 TraceCheckUtils]: 45: Hoare triple {2909#(<= ~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)); {2909#(<= ~counter~0 3)} is VALID [2022-04-08 11:28:18,276 INFO L290 TraceCheckUtils]: 46: Hoare triple {2909#(<= ~counter~0 3)} ~cond := #in~cond; {2909#(<= ~counter~0 3)} is VALID [2022-04-08 11:28:18,276 INFO L290 TraceCheckUtils]: 47: Hoare triple {2909#(<= ~counter~0 3)} assume !(0 == ~cond); {2909#(<= ~counter~0 3)} is VALID [2022-04-08 11:28:18,277 INFO L290 TraceCheckUtils]: 48: Hoare triple {2909#(<= ~counter~0 3)} assume true; {2909#(<= ~counter~0 3)} is VALID [2022-04-08 11:28:18,277 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {2909#(<= ~counter~0 3)} {2909#(<= ~counter~0 3)} #94#return; {2909#(<= ~counter~0 3)} is VALID [2022-04-08 11:28:18,277 INFO L290 TraceCheckUtils]: 50: Hoare triple {2909#(<= ~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); {2909#(<= ~counter~0 3)} is VALID [2022-04-08 11:28:18,278 INFO L290 TraceCheckUtils]: 51: Hoare triple {2909#(<= ~counter~0 3)} assume ~r~0 % 4294967296 >= ~h~0 % 4294967296;~p~0 := ~p~0 + ~q~0;~r~0 := ~r~0 - ~h~0; {2909#(<= ~counter~0 3)} is VALID [2022-04-08 11:28:18,278 INFO L290 TraceCheckUtils]: 52: Hoare triple {2909#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3012#(<= |main_#t~post6| 3)} is VALID [2022-04-08 11:28:18,279 INFO L290 TraceCheckUtils]: 53: Hoare triple {3012#(<= |main_#t~post6| 3)} assume !(#t~post6 < 100);havoc #t~post6; {2848#false} is VALID [2022-04-08 11:28:18,279 INFO L272 TraceCheckUtils]: 54: Hoare triple {2848#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)); {2848#false} is VALID [2022-04-08 11:28:18,279 INFO L290 TraceCheckUtils]: 55: Hoare triple {2848#false} ~cond := #in~cond; {2848#false} is VALID [2022-04-08 11:28:18,279 INFO L290 TraceCheckUtils]: 56: Hoare triple {2848#false} assume 0 == ~cond; {2848#false} is VALID [2022-04-08 11:28:18,279 INFO L290 TraceCheckUtils]: 57: Hoare triple {2848#false} assume !false; {2848#false} is VALID [2022-04-08 11:28:18,279 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-08 11:28:18,279 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 11:28:18,559 INFO L290 TraceCheckUtils]: 57: Hoare triple {2848#false} assume !false; {2848#false} is VALID [2022-04-08 11:28:18,559 INFO L290 TraceCheckUtils]: 56: Hoare triple {2848#false} assume 0 == ~cond; {2848#false} is VALID [2022-04-08 11:28:18,559 INFO L290 TraceCheckUtils]: 55: Hoare triple {2848#false} ~cond := #in~cond; {2848#false} is VALID [2022-04-08 11:28:18,559 INFO L272 TraceCheckUtils]: 54: Hoare triple {2848#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)); {2848#false} is VALID [2022-04-08 11:28:18,570 INFO L290 TraceCheckUtils]: 53: Hoare triple {3040#(< |main_#t~post6| 100)} assume !(#t~post6 < 100);havoc #t~post6; {2848#false} is VALID [2022-04-08 11:28:18,571 INFO L290 TraceCheckUtils]: 52: Hoare triple {3044#(< ~counter~0 100)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3040#(< |main_#t~post6| 100)} is VALID [2022-04-08 11:28:18,571 INFO L290 TraceCheckUtils]: 51: Hoare triple {3044#(< ~counter~0 100)} assume ~r~0 % 4294967296 >= ~h~0 % 4294967296;~p~0 := ~p~0 + ~q~0;~r~0 := ~r~0 - ~h~0; {3044#(< ~counter~0 100)} is VALID [2022-04-08 11:28:18,571 INFO L290 TraceCheckUtils]: 50: Hoare triple {3044#(< ~counter~0 100)} 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); {3044#(< ~counter~0 100)} is VALID [2022-04-08 11:28:18,572 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {2847#true} {3044#(< ~counter~0 100)} #94#return; {3044#(< ~counter~0 100)} is VALID [2022-04-08 11:28:18,572 INFO L290 TraceCheckUtils]: 48: Hoare triple {2847#true} assume true; {2847#true} is VALID [2022-04-08 11:28:18,572 INFO L290 TraceCheckUtils]: 47: Hoare triple {2847#true} assume !(0 == ~cond); {2847#true} is VALID [2022-04-08 11:28:18,572 INFO L290 TraceCheckUtils]: 46: Hoare triple {2847#true} ~cond := #in~cond; {2847#true} is VALID [2022-04-08 11:28:18,572 INFO L272 TraceCheckUtils]: 45: Hoare triple {3044#(< ~counter~0 100)} call __VERIFIER_assert((if 0 == (~p~0 * ~p~0 - ~n~0 * ~q~0 + ~q~0 * ~r~0) % 4294967296 then 1 else 0)); {2847#true} is VALID [2022-04-08 11:28:18,573 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {2847#true} {3044#(< ~counter~0 100)} #92#return; {3044#(< ~counter~0 100)} is VALID [2022-04-08 11:28:18,573 INFO L290 TraceCheckUtils]: 43: Hoare triple {2847#true} assume true; {2847#true} is VALID [2022-04-08 11:28:18,573 INFO L290 TraceCheckUtils]: 42: Hoare triple {2847#true} assume !(0 == ~cond); {2847#true} is VALID [2022-04-08 11:28:18,573 INFO L290 TraceCheckUtils]: 41: Hoare triple {2847#true} ~cond := #in~cond; {2847#true} is VALID [2022-04-08 11:28:18,573 INFO L272 TraceCheckUtils]: 40: Hoare triple {3044#(< ~counter~0 100)} 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)); {2847#true} is VALID [2022-04-08 11:28:18,574 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {2847#true} {3044#(< ~counter~0 100)} #90#return; {3044#(< ~counter~0 100)} is VALID [2022-04-08 11:28:18,575 INFO L290 TraceCheckUtils]: 38: Hoare triple {2847#true} assume true; {2847#true} is VALID [2022-04-08 11:28:18,575 INFO L290 TraceCheckUtils]: 37: Hoare triple {2847#true} assume !(0 == ~cond); {2847#true} is VALID [2022-04-08 11:28:18,575 INFO L290 TraceCheckUtils]: 36: Hoare triple {2847#true} ~cond := #in~cond; {2847#true} is VALID [2022-04-08 11:28:18,575 INFO L272 TraceCheckUtils]: 35: Hoare triple {3044#(< ~counter~0 100)} 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)); {2847#true} is VALID [2022-04-08 11:28:18,576 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2847#true} {3044#(< ~counter~0 100)} #88#return; {3044#(< ~counter~0 100)} is VALID [2022-04-08 11:28:18,576 INFO L290 TraceCheckUtils]: 33: Hoare triple {2847#true} assume true; {2847#true} is VALID [2022-04-08 11:28:18,576 INFO L290 TraceCheckUtils]: 32: Hoare triple {2847#true} assume !(0 == ~cond); {2847#true} is VALID [2022-04-08 11:28:18,576 INFO L290 TraceCheckUtils]: 31: Hoare triple {2847#true} ~cond := #in~cond; {2847#true} is VALID [2022-04-08 11:28:18,576 INFO L272 TraceCheckUtils]: 30: Hoare triple {3044#(< ~counter~0 100)} 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)); {2847#true} is VALID [2022-04-08 11:28:18,577 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {2847#true} {3044#(< ~counter~0 100)} #86#return; {3044#(< ~counter~0 100)} is VALID [2022-04-08 11:28:18,577 INFO L290 TraceCheckUtils]: 28: Hoare triple {2847#true} assume true; {2847#true} is VALID [2022-04-08 11:28:18,577 INFO L290 TraceCheckUtils]: 27: Hoare triple {2847#true} assume !(0 == ~cond); {2847#true} is VALID [2022-04-08 11:28:18,577 INFO L290 TraceCheckUtils]: 26: Hoare triple {2847#true} ~cond := #in~cond; {2847#true} is VALID [2022-04-08 11:28:18,577 INFO L272 TraceCheckUtils]: 25: Hoare triple {3044#(< ~counter~0 100)} call __VERIFIER_assert((if (~p~0 * ~p~0 + ~r~0 * ~q~0) % 4294967296 == ~n~0 * ~q~0 % 4294967296 then 1 else 0)); {2847#true} is VALID [2022-04-08 11:28:18,578 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {2847#true} {3044#(< ~counter~0 100)} #84#return; {3044#(< ~counter~0 100)} is VALID [2022-04-08 11:28:18,578 INFO L290 TraceCheckUtils]: 23: Hoare triple {2847#true} assume true; {2847#true} is VALID [2022-04-08 11:28:18,578 INFO L290 TraceCheckUtils]: 22: Hoare triple {2847#true} assume !(0 == ~cond); {2847#true} is VALID [2022-04-08 11:28:18,578 INFO L290 TraceCheckUtils]: 21: Hoare triple {2847#true} ~cond := #in~cond; {2847#true} is VALID [2022-04-08 11:28:18,578 INFO L272 TraceCheckUtils]: 20: Hoare triple {3044#(< ~counter~0 100)} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {2847#true} is VALID [2022-04-08 11:28:18,578 INFO L290 TraceCheckUtils]: 19: Hoare triple {3044#(< ~counter~0 100)} assume !!(#t~post6 < 100);havoc #t~post6; {3044#(< ~counter~0 100)} is VALID [2022-04-08 11:28:18,579 INFO L290 TraceCheckUtils]: 18: Hoare triple {3147#(< ~counter~0 99)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3044#(< ~counter~0 100)} is VALID [2022-04-08 11:28:18,579 INFO L290 TraceCheckUtils]: 17: Hoare triple {3147#(< ~counter~0 99)} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {3147#(< ~counter~0 99)} is VALID [2022-04-08 11:28:18,579 INFO L290 TraceCheckUtils]: 16: Hoare triple {3147#(< ~counter~0 99)} assume !!(#t~post5 < 100);havoc #t~post5; {3147#(< ~counter~0 99)} is VALID [2022-04-08 11:28:18,580 INFO L290 TraceCheckUtils]: 15: Hoare triple {3157#(< ~counter~0 98)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3147#(< ~counter~0 99)} is VALID [2022-04-08 11:28:18,580 INFO L290 TraceCheckUtils]: 14: Hoare triple {3157#(< ~counter~0 98)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {3157#(< ~counter~0 98)} is VALID [2022-04-08 11:28:18,580 INFO L290 TraceCheckUtils]: 13: Hoare triple {3157#(< ~counter~0 98)} assume !!(#t~post5 < 100);havoc #t~post5; {3157#(< ~counter~0 98)} is VALID [2022-04-08 11:28:18,581 INFO L290 TraceCheckUtils]: 12: Hoare triple {3167#(< ~counter~0 97)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3157#(< ~counter~0 98)} is VALID [2022-04-08 11:28:18,581 INFO L290 TraceCheckUtils]: 11: Hoare triple {3167#(< ~counter~0 97)} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {3167#(< ~counter~0 97)} is VALID [2022-04-08 11:28:18,582 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2847#true} {3167#(< ~counter~0 97)} #82#return; {3167#(< ~counter~0 97)} is VALID [2022-04-08 11:28:18,582 INFO L290 TraceCheckUtils]: 9: Hoare triple {2847#true} assume true; {2847#true} is VALID [2022-04-08 11:28:18,582 INFO L290 TraceCheckUtils]: 8: Hoare triple {2847#true} assume !(0 == ~cond); {2847#true} is VALID [2022-04-08 11:28:18,582 INFO L290 TraceCheckUtils]: 7: Hoare triple {2847#true} ~cond := #in~cond; {2847#true} is VALID [2022-04-08 11:28:18,582 INFO L272 TraceCheckUtils]: 6: Hoare triple {3167#(< ~counter~0 97)} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {2847#true} is VALID [2022-04-08 11:28:18,585 INFO L290 TraceCheckUtils]: 5: Hoare triple {3167#(< ~counter~0 97)} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {3167#(< ~counter~0 97)} is VALID [2022-04-08 11:28:18,585 INFO L272 TraceCheckUtils]: 4: Hoare triple {3167#(< ~counter~0 97)} call #t~ret7 := main(); {3167#(< ~counter~0 97)} is VALID [2022-04-08 11:28:18,585 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3167#(< ~counter~0 97)} {2847#true} #102#return; {3167#(< ~counter~0 97)} is VALID [2022-04-08 11:28:18,586 INFO L290 TraceCheckUtils]: 2: Hoare triple {3167#(< ~counter~0 97)} assume true; {3167#(< ~counter~0 97)} is VALID [2022-04-08 11:28:18,586 INFO L290 TraceCheckUtils]: 1: Hoare triple {2847#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; {3167#(< ~counter~0 97)} is VALID [2022-04-08 11:28:18,586 INFO L272 TraceCheckUtils]: 0: Hoare triple {2847#true} call ULTIMATE.init(); {2847#true} is VALID [2022-04-08 11:28:18,586 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-08 11:28:18,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:28:18,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306551784] [2022-04-08 11:28:18,587 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:28:18,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1589958860] [2022-04-08 11:28:18,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1589958860] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 11:28:18,587 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 11:28:18,587 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-04-08 11:28:18,587 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:28:18,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [578157544] [2022-04-08 11:28:18,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [578157544] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:28:18,587 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:28:18,587 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 11:28:18,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709218978] [2022-04-08 11:28:18,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:28:18,588 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-08 11:28:18,588 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:28:18,588 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-08 11:28:18,620 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-08 11:28:18,620 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 11:28:18,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:28:18,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 11:28:18,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2022-04-08 11:28:18,621 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-08 11:28:31,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:28:31,597 INFO L93 Difference]: Finished difference Result 114 states and 146 transitions. [2022-04-08 11:28:31,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 11:28:31,598 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-08 11:28:31,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:28:31,598 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-08 11:28:31,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 90 transitions. [2022-04-08 11:28:31,600 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-08 11:28:31,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 90 transitions. [2022-04-08 11:28:31,602 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 90 transitions. [2022-04-08 11:28:31,674 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-08 11:28:31,676 INFO L225 Difference]: With dead ends: 114 [2022-04-08 11:28:31,676 INFO L226 Difference]: Without dead ends: 104 [2022-04-08 11:28:31,676 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2022-04-08 11:28:31,677 INFO L913 BasicCegarLoop]: 48 mSDtfsCounter, 21 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-08 11:28:31,677 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 157 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-08 11:28:31,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-04-08 11:28:31,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 98. [2022-04-08 11:28:31,770 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:28:31,770 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-08 11:28:31,771 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-08 11:28:31,771 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-08 11:28:31,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:28:31,775 INFO L93 Difference]: Finished difference Result 104 states and 133 transitions. [2022-04-08 11:28:31,775 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 133 transitions. [2022-04-08 11:28:31,775 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:28:31,775 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:28:31,776 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-08 11:28:31,776 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-08 11:28:31,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:28:31,779 INFO L93 Difference]: Finished difference Result 104 states and 133 transitions. [2022-04-08 11:28:31,780 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 133 transitions. [2022-04-08 11:28:31,780 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:28:31,780 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:28:31,780 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:28:31,780 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:28:31,781 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-08 11:28:31,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 126 transitions. [2022-04-08 11:28:31,784 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 126 transitions. Word has length 58 [2022-04-08 11:28:31,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:28:31,785 INFO L478 AbstractCegarLoop]: Abstraction has 98 states and 126 transitions. [2022-04-08 11:28:31,785 INFO L479 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-08 11:28:31,785 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 98 states and 126 transitions. [2022-04-08 11:28:32,328 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-08 11:28:32,329 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 126 transitions. [2022-04-08 11:28:32,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-04-08 11:28:32,329 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:28:32,330 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 11:28:32,334 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-08 11:28:32,531 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:28:32,532 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:28:32,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:28:32,532 INFO L85 PathProgramCache]: Analyzing trace with hash 109392637, now seen corresponding path program 1 times [2022-04-08 11:28:32,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:28:32,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1336247448] [2022-04-08 11:28:32,538 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 11:28:32,538 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 11:28:32,538 INFO L85 PathProgramCache]: Analyzing trace with hash 109392637, now seen corresponding path program 2 times [2022-04-08 11:28:32,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:28:32,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338885588] [2022-04-08 11:28:32,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:28:32,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:28:32,557 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:28:32,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1762282901] [2022-04-08 11:28:32,557 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 11:28:32,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:28:32,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:28:32,558 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-08 11:28:32,562 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process