/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/hard-u.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 10:47:53,819 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 10:47:53,821 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 10:47:53,854 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 10:47:53,854 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 10:47:53,855 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 10:47:53,858 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 10:47:53,859 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 10:47:53,860 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 10:47:53,863 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 10:47:53,864 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 10:47:53,865 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 10:47:53,865 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 10:47:53,866 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 10:47:53,867 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 10:47:53,869 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 10:47:53,869 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 10:47:53,870 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 10:47:53,871 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 10:47:53,875 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 10:47:53,876 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 10:47:53,876 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 10:47:53,877 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 10:47:53,877 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 10:47:53,878 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 10:47:53,883 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 10:47:53,883 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 10:47:53,883 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 10:47:53,883 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 10:47:53,884 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 10:47:53,884 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 10:47:53,884 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 10:47:53,886 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 10:47:53,886 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 10:47:53,886 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 10:47:53,887 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 10:47:53,887 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 10:47:53,887 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 10:47:53,887 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 10:47:53,887 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 10:47:53,888 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 10:47:53,889 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 10:47:53,889 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-28 10:47:53,898 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 10:47:53,898 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 10:47:53,899 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 10:47:53,899 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 10:47:53,899 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 10:47:53,899 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 10:47:53,899 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 10:47:53,899 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 10:47:53,899 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 10:47:53,900 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 10:47:53,900 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 10:47:53,900 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 10:47:53,900 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 10:47:53,900 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 10:47:53,900 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 10:47:53,900 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 10:47:53,900 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 10:47:53,900 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 10:47:53,901 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 10:47:53,901 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 10:47:53,901 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 10:47:53,901 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 10:47:53,901 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-28 10:47:54,058 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 10:47:54,076 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 10:47:54,077 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 10:47:54,078 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 10:47:54,078 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 10:47:54,079 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench/hard-u.c [2022-04-28 10:47:54,127 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/995a9a990/c344d18bc142469c93a501129e9d7c9f/FLAG89651e474 [2022-04-28 10:47:54,459 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 10:47:54,459 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/hard-u.c [2022-04-28 10:47:54,463 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/995a9a990/c344d18bc142469c93a501129e9d7c9f/FLAG89651e474 [2022-04-28 10:47:54,471 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/995a9a990/c344d18bc142469c93a501129e9d7c9f [2022-04-28 10:47:54,472 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 10:47:54,473 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 10:47:54,476 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 10:47:54,476 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 10:47:54,486 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 10:47:54,487 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 10:47:54" (1/1) ... [2022-04-28 10:47:54,487 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6124ad47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:47:54, skipping insertion in model container [2022-04-28 10:47:54,487 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 10:47:54" (1/1) ... [2022-04-28 10:47:54,494 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 10:47:54,503 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 10:47:54,620 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/hard-u.c[537,550] [2022-04-28 10:47:54,633 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 10:47:54,638 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 10:47:54,645 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/hard-u.c[537,550] [2022-04-28 10:47:54,650 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 10:47:54,657 INFO L208 MainTranslator]: Completed translation [2022-04-28 10:47:54,657 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:47:54 WrapperNode [2022-04-28 10:47:54,657 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 10:47:54,658 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 10:47:54,658 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 10:47:54,658 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 10:47:54,664 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:47:54" (1/1) ... [2022-04-28 10:47:54,664 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:47:54" (1/1) ... [2022-04-28 10:47:54,668 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:47:54" (1/1) ... [2022-04-28 10:47:54,668 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:47:54" (1/1) ... [2022-04-28 10:47:54,671 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:47:54" (1/1) ... [2022-04-28 10:47:54,674 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:47:54" (1/1) ... [2022-04-28 10:47:54,675 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:47:54" (1/1) ... [2022-04-28 10:47:54,676 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 10:47:54,676 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 10:47:54,676 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 10:47:54,676 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 10:47:54,677 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:47:54" (1/1) ... [2022-04-28 10:47:54,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 10:47:54,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:47:54,696 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-28 10:47:54,703 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-28 10:47:54,725 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 10:47:54,725 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 10:47:54,725 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 10:47:54,725 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 10:47:54,725 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 10:47:54,725 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 10:47:54,725 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 10:47:54,725 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 10:47:54,726 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 10:47:54,726 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 10:47:54,726 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-28 10:47:54,726 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 10:47:54,726 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 10:47:54,726 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 10:47:54,726 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 10:47:54,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 10:47:54,726 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 10:47:54,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 10:47:54,726 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 10:47:54,726 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 10:47:54,763 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 10:47:54,765 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 10:47:54,873 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 10:47:54,877 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 10:47:54,877 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-28 10:47:54,879 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 10:47:54 BoogieIcfgContainer [2022-04-28 10:47:54,879 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 10:47:54,880 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 10:47:54,880 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 10:47:54,885 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 10:47:54,885 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 10:47:54" (1/3) ... [2022-04-28 10:47:54,886 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18434532 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 10:47:54, skipping insertion in model container [2022-04-28 10:47:54,886 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:47:54" (2/3) ... [2022-04-28 10:47:54,886 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18434532 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 10:47:54, skipping insertion in model container [2022-04-28 10:47:54,886 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 10:47:54" (3/3) ... [2022-04-28 10:47:54,887 INFO L111 eAbstractionObserver]: Analyzing ICFG hard-u.c [2022-04-28 10:47:54,896 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 10:47:54,896 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 10:47:54,947 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 10:47:54,951 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7d4f0844, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5b7708d [2022-04-28 10:47:54,951 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 10:47:54,967 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 states have internal predecessors, (29), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 10:47:54,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 10:47:54,972 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:47:54,972 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:47:54,972 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:47:54,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:47:54,976 INFO L85 PathProgramCache]: Analyzing trace with hash -977830905, now seen corresponding path program 1 times [2022-04-28 10:47:54,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:47:54,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1214490170] [2022-04-28 10:47:55,002 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 10:47:55,002 INFO L85 PathProgramCache]: Analyzing trace with hash -977830905, now seen corresponding path program 2 times [2022-04-28 10:47:55,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:47:55,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826795592] [2022-04-28 10:47:55,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:47:55,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:47:55,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:47:55,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:47:55,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:47:55,163 INFO L290 TraceCheckUtils]: 0: Hoare triple {47#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {38#true} is VALID [2022-04-28 10:47:55,163 INFO L290 TraceCheckUtils]: 1: Hoare triple {38#true} assume true; {38#true} is VALID [2022-04-28 10:47:55,164 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {38#true} {38#true} #94#return; {38#true} is VALID [2022-04-28 10:47:55,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 10:47:55,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:47:55,187 INFO L290 TraceCheckUtils]: 0: Hoare triple {38#true} ~cond := #in~cond; {38#true} is VALID [2022-04-28 10:47:55,188 INFO L290 TraceCheckUtils]: 1: Hoare triple {38#true} assume 0 == ~cond;assume false; {39#false} is VALID [2022-04-28 10:47:55,188 INFO L290 TraceCheckUtils]: 2: Hoare triple {39#false} assume true; {39#false} is VALID [2022-04-28 10:47:55,188 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39#false} {38#true} #78#return; {39#false} is VALID [2022-04-28 10:47:55,190 INFO L272 TraceCheckUtils]: 0: Hoare triple {38#true} call ULTIMATE.init(); {47#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:47:55,190 INFO L290 TraceCheckUtils]: 1: Hoare triple {47#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {38#true} is VALID [2022-04-28 10:47:55,190 INFO L290 TraceCheckUtils]: 2: Hoare triple {38#true} assume true; {38#true} is VALID [2022-04-28 10:47:55,190 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38#true} {38#true} #94#return; {38#true} is VALID [2022-04-28 10:47:55,190 INFO L272 TraceCheckUtils]: 4: Hoare triple {38#true} call #t~ret6 := main(); {38#true} is VALID [2022-04-28 10:47:55,191 INFO L290 TraceCheckUtils]: 5: Hoare triple {38#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {38#true} is VALID [2022-04-28 10:47:55,191 INFO L272 TraceCheckUtils]: 6: Hoare triple {38#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {38#true} is VALID [2022-04-28 10:47:55,191 INFO L290 TraceCheckUtils]: 7: Hoare triple {38#true} ~cond := #in~cond; {38#true} is VALID [2022-04-28 10:47:55,191 INFO L290 TraceCheckUtils]: 8: Hoare triple {38#true} assume 0 == ~cond;assume false; {39#false} is VALID [2022-04-28 10:47:55,192 INFO L290 TraceCheckUtils]: 9: Hoare triple {39#false} assume true; {39#false} is VALID [2022-04-28 10:47:55,192 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {39#false} {38#true} #78#return; {39#false} is VALID [2022-04-28 10:47:55,192 INFO L290 TraceCheckUtils]: 11: Hoare triple {39#false} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {39#false} is VALID [2022-04-28 10:47:55,192 INFO L290 TraceCheckUtils]: 12: Hoare triple {39#false} assume !false; {39#false} is VALID [2022-04-28 10:47:55,192 INFO L272 TraceCheckUtils]: 13: Hoare triple {39#false} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {39#false} is VALID [2022-04-28 10:47:55,192 INFO L290 TraceCheckUtils]: 14: Hoare triple {39#false} ~cond := #in~cond; {39#false} is VALID [2022-04-28 10:47:55,193 INFO L290 TraceCheckUtils]: 15: Hoare triple {39#false} assume 0 == ~cond; {39#false} is VALID [2022-04-28 10:47:55,193 INFO L290 TraceCheckUtils]: 16: Hoare triple {39#false} assume !false; {39#false} is VALID [2022-04-28 10:47:55,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:47:55,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:47:55,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826795592] [2022-04-28 10:47:55,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826795592] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:47:55,194 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:47:55,194 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 10:47:55,196 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:47:55,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1214490170] [2022-04-28 10:47:55,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1214490170] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:47:55,197 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:47:55,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 10:47:55,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081057300] [2022-04-28 10:47:55,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:47:55,201 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 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 17 [2022-04-28 10:47:55,202 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:47:55,204 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 10:47:55,230 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:47:55,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 10:47:55,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:47:55,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 10:47:55,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 10:47:55,253 INFO L87 Difference]: Start difference. First operand has 35 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 states have internal predecessors, (29), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 10:47:55,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:47:55,417 INFO L93 Difference]: Finished difference Result 61 states and 95 transitions. [2022-04-28 10:47:55,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 10:47:55,418 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 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 17 [2022-04-28 10:47:55,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:47:55,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 10:47:55,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2022-04-28 10:47:55,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 10:47:55,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2022-04-28 10:47:55,443 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 95 transitions. [2022-04-28 10:47:55,547 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:47:55,555 INFO L225 Difference]: With dead ends: 61 [2022-04-28 10:47:55,555 INFO L226 Difference]: Without dead ends: 30 [2022-04-28 10:47:55,557 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 10:47:55,560 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 20 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:47:55,561 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 38 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 10:47:55,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-28 10:47:55,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-04-28 10:47:55,580 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:47:55,581 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 30 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 10:47:55,581 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 30 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 10:47:55,582 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 30 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 10:47:55,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:47:55,585 INFO L93 Difference]: Finished difference Result 30 states and 38 transitions. [2022-04-28 10:47:55,585 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2022-04-28 10:47:55,585 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:47:55,585 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:47:55,586 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 30 states. [2022-04-28 10:47:55,586 INFO L87 Difference]: Start difference. First operand has 30 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 30 states. [2022-04-28 10:47:55,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:47:55,588 INFO L93 Difference]: Finished difference Result 30 states and 38 transitions. [2022-04-28 10:47:55,588 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2022-04-28 10:47:55,588 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:47:55,589 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:47:55,589 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:47:55,589 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:47:55,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 10:47:55,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2022-04-28 10:47:55,591 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 17 [2022-04-28 10:47:55,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:47:55,592 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2022-04-28 10:47:55,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 10:47:55,592 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 38 transitions. [2022-04-28 10:47:55,639 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:47:55,640 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2022-04-28 10:47:55,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 10:47:55,640 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:47:55,640 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:47:55,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 10:47:55,641 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:47:55,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:47:55,641 INFO L85 PathProgramCache]: Analyzing trace with hash -297772535, now seen corresponding path program 1 times [2022-04-28 10:47:55,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:47:55,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [782875928] [2022-04-28 10:47:55,642 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 10:47:55,642 INFO L85 PathProgramCache]: Analyzing trace with hash -297772535, now seen corresponding path program 2 times [2022-04-28 10:47:55,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:47:55,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909180979] [2022-04-28 10:47:55,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:47:55,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:47:55,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:47:55,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:47:55,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:47:55,734 INFO L290 TraceCheckUtils]: 0: Hoare triple {304#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {292#true} is VALID [2022-04-28 10:47:55,735 INFO L290 TraceCheckUtils]: 1: Hoare triple {292#true} assume true; {292#true} is VALID [2022-04-28 10:47:55,735 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {292#true} {292#true} #94#return; {292#true} is VALID [2022-04-28 10:47:55,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 10:47:55,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:47:55,748 INFO L290 TraceCheckUtils]: 0: Hoare triple {292#true} ~cond := #in~cond; {292#true} is VALID [2022-04-28 10:47:55,748 INFO L290 TraceCheckUtils]: 1: Hoare triple {292#true} assume !(0 == ~cond); {292#true} is VALID [2022-04-28 10:47:55,748 INFO L290 TraceCheckUtils]: 2: Hoare triple {292#true} assume true; {292#true} is VALID [2022-04-28 10:47:55,748 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {292#true} {292#true} #78#return; {292#true} is VALID [2022-04-28 10:47:55,749 INFO L272 TraceCheckUtils]: 0: Hoare triple {292#true} call ULTIMATE.init(); {304#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:47:55,749 INFO L290 TraceCheckUtils]: 1: Hoare triple {304#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {292#true} is VALID [2022-04-28 10:47:55,749 INFO L290 TraceCheckUtils]: 2: Hoare triple {292#true} assume true; {292#true} is VALID [2022-04-28 10:47:55,750 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {292#true} {292#true} #94#return; {292#true} is VALID [2022-04-28 10:47:55,750 INFO L272 TraceCheckUtils]: 4: Hoare triple {292#true} call #t~ret6 := main(); {292#true} is VALID [2022-04-28 10:47:55,750 INFO L290 TraceCheckUtils]: 5: Hoare triple {292#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {292#true} is VALID [2022-04-28 10:47:55,750 INFO L272 TraceCheckUtils]: 6: Hoare triple {292#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {292#true} is VALID [2022-04-28 10:47:55,750 INFO L290 TraceCheckUtils]: 7: Hoare triple {292#true} ~cond := #in~cond; {292#true} is VALID [2022-04-28 10:47:55,750 INFO L290 TraceCheckUtils]: 8: Hoare triple {292#true} assume !(0 == ~cond); {292#true} is VALID [2022-04-28 10:47:55,757 INFO L290 TraceCheckUtils]: 9: Hoare triple {292#true} assume true; {292#true} is VALID [2022-04-28 10:47:55,757 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {292#true} {292#true} #78#return; {292#true} is VALID [2022-04-28 10:47:55,758 INFO L290 TraceCheckUtils]: 11: Hoare triple {292#true} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {301#(= main_~q~0 0)} is VALID [2022-04-28 10:47:55,758 INFO L290 TraceCheckUtils]: 12: Hoare triple {301#(= main_~q~0 0)} assume !false; {301#(= main_~q~0 0)} is VALID [2022-04-28 10:47:55,759 INFO L272 TraceCheckUtils]: 13: Hoare triple {301#(= main_~q~0 0)} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {302#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:47:55,760 INFO L290 TraceCheckUtils]: 14: Hoare triple {302#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {303#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 10:47:55,761 INFO L290 TraceCheckUtils]: 15: Hoare triple {303#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {293#false} is VALID [2022-04-28 10:47:55,761 INFO L290 TraceCheckUtils]: 16: Hoare triple {293#false} assume !false; {293#false} is VALID [2022-04-28 10:47:55,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:47:55,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:47:55,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909180979] [2022-04-28 10:47:55,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909180979] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:47:55,761 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:47:55,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 10:47:55,762 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:47:55,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [782875928] [2022-04-28 10:47:55,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [782875928] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:47:55,762 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:47:55,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 10:47:55,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449862995] [2022-04-28 10:47:55,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:47:55,763 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 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 17 [2022-04-28 10:47:55,763 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:47:55,763 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 10:47:55,777 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:47:55,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 10:47:55,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:47:55,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 10:47:55,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 10:47:55,778 INFO L87 Difference]: Start difference. First operand 30 states and 38 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 10:47:56,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:47:56,137 INFO L93 Difference]: Finished difference Result 43 states and 55 transitions. [2022-04-28 10:47:56,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 10:47:56,137 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 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 17 [2022-04-28 10:47:56,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:47:56,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 10:47:56,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 55 transitions. [2022-04-28 10:47:56,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 10:47:56,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 55 transitions. [2022-04-28 10:47:56,141 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 55 transitions. [2022-04-28 10:47:56,204 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:47:56,210 INFO L225 Difference]: With dead ends: 43 [2022-04-28 10:47:56,210 INFO L226 Difference]: Without dead ends: 41 [2022-04-28 10:47:56,210 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-28 10:47:56,213 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 37 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 10:47:56,214 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 45 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 10:47:56,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-04-28 10:47:56,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 34. [2022-04-28 10:47:56,219 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:47:56,220 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand has 34 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 10:47:56,220 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand has 34 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 10:47:56,220 INFO L87 Difference]: Start difference. First operand 41 states. Second operand has 34 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 10:47:56,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:47:56,222 INFO L93 Difference]: Finished difference Result 41 states and 53 transitions. [2022-04-28 10:47:56,222 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 53 transitions. [2022-04-28 10:47:56,223 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:47:56,223 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:47:56,223 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 41 states. [2022-04-28 10:47:56,224 INFO L87 Difference]: Start difference. First operand has 34 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 41 states. [2022-04-28 10:47:56,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:47:56,226 INFO L93 Difference]: Finished difference Result 41 states and 53 transitions. [2022-04-28 10:47:56,226 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 53 transitions. [2022-04-28 10:47:56,226 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:47:56,226 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:47:56,226 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:47:56,227 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:47:56,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 10:47:56,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2022-04-28 10:47:56,231 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 41 transitions. Word has length 17 [2022-04-28 10:47:56,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:47:56,231 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 41 transitions. [2022-04-28 10:47:56,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 10:47:56,232 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 41 transitions. [2022-04-28 10:47:56,268 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:47:56,268 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2022-04-28 10:47:56,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 10:47:56,270 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:47:56,270 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:47:56,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 10:47:56,270 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:47:56,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:47:56,270 INFO L85 PathProgramCache]: Analyzing trace with hash -1294462534, now seen corresponding path program 1 times [2022-04-28 10:47:56,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:47:56,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1940995066] [2022-04-28 10:47:56,271 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 10:47:56,271 INFO L85 PathProgramCache]: Analyzing trace with hash -1294462534, now seen corresponding path program 2 times [2022-04-28 10:47:56,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:47:56,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384540996] [2022-04-28 10:47:56,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:47:56,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:47:56,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:47:56,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:47:56,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:47:56,342 INFO L290 TraceCheckUtils]: 0: Hoare triple {567#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {551#true} is VALID [2022-04-28 10:47:56,342 INFO L290 TraceCheckUtils]: 1: Hoare triple {551#true} assume true; {551#true} is VALID [2022-04-28 10:47:56,342 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {551#true} {551#true} #94#return; {551#true} is VALID [2022-04-28 10:47:56,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 10:47:56,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:47:56,346 INFO L290 TraceCheckUtils]: 0: Hoare triple {551#true} ~cond := #in~cond; {551#true} is VALID [2022-04-28 10:47:56,346 INFO L290 TraceCheckUtils]: 1: Hoare triple {551#true} assume !(0 == ~cond); {551#true} is VALID [2022-04-28 10:47:56,346 INFO L290 TraceCheckUtils]: 2: Hoare triple {551#true} assume true; {551#true} is VALID [2022-04-28 10:47:56,346 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {551#true} {551#true} #78#return; {551#true} is VALID [2022-04-28 10:47:56,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-04-28 10:47:56,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:47:56,351 INFO L290 TraceCheckUtils]: 0: Hoare triple {551#true} ~cond := #in~cond; {551#true} is VALID [2022-04-28 10:47:56,351 INFO L290 TraceCheckUtils]: 1: Hoare triple {551#true} assume !(0 == ~cond); {551#true} is VALID [2022-04-28 10:47:56,351 INFO L290 TraceCheckUtils]: 2: Hoare triple {551#true} assume true; {551#true} is VALID [2022-04-28 10:47:56,352 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {551#true} {560#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} #80#return; {560#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} is VALID [2022-04-28 10:47:56,352 INFO L272 TraceCheckUtils]: 0: Hoare triple {551#true} call ULTIMATE.init(); {567#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:47:56,352 INFO L290 TraceCheckUtils]: 1: Hoare triple {567#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {551#true} is VALID [2022-04-28 10:47:56,352 INFO L290 TraceCheckUtils]: 2: Hoare triple {551#true} assume true; {551#true} is VALID [2022-04-28 10:47:56,353 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {551#true} {551#true} #94#return; {551#true} is VALID [2022-04-28 10:47:56,353 INFO L272 TraceCheckUtils]: 4: Hoare triple {551#true} call #t~ret6 := main(); {551#true} is VALID [2022-04-28 10:47:56,353 INFO L290 TraceCheckUtils]: 5: Hoare triple {551#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {551#true} is VALID [2022-04-28 10:47:56,353 INFO L272 TraceCheckUtils]: 6: Hoare triple {551#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {551#true} is VALID [2022-04-28 10:47:56,353 INFO L290 TraceCheckUtils]: 7: Hoare triple {551#true} ~cond := #in~cond; {551#true} is VALID [2022-04-28 10:47:56,353 INFO L290 TraceCheckUtils]: 8: Hoare triple {551#true} assume !(0 == ~cond); {551#true} is VALID [2022-04-28 10:47:56,353 INFO L290 TraceCheckUtils]: 9: Hoare triple {551#true} assume true; {551#true} is VALID [2022-04-28 10:47:56,353 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {551#true} {551#true} #78#return; {551#true} is VALID [2022-04-28 10:47:56,354 INFO L290 TraceCheckUtils]: 11: Hoare triple {551#true} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {560#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} is VALID [2022-04-28 10:47:56,354 INFO L290 TraceCheckUtils]: 12: Hoare triple {560#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} assume !false; {560#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} is VALID [2022-04-28 10:47:56,354 INFO L272 TraceCheckUtils]: 13: Hoare triple {560#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {551#true} is VALID [2022-04-28 10:47:56,354 INFO L290 TraceCheckUtils]: 14: Hoare triple {551#true} ~cond := #in~cond; {551#true} is VALID [2022-04-28 10:47:56,354 INFO L290 TraceCheckUtils]: 15: Hoare triple {551#true} assume !(0 == ~cond); {551#true} is VALID [2022-04-28 10:47:56,355 INFO L290 TraceCheckUtils]: 16: Hoare triple {551#true} assume true; {551#true} is VALID [2022-04-28 10:47:56,355 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {551#true} {560#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} #80#return; {560#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} is VALID [2022-04-28 10:47:56,356 INFO L272 TraceCheckUtils]: 18: Hoare triple {560#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} call __VERIFIER_assert((if ~r~0 % 4294967296 == ~A~0 % 4294967296 then 1 else 0)); {565#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:47:56,356 INFO L290 TraceCheckUtils]: 19: Hoare triple {565#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {566#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 10:47:56,356 INFO L290 TraceCheckUtils]: 20: Hoare triple {566#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {552#false} is VALID [2022-04-28 10:47:56,357 INFO L290 TraceCheckUtils]: 21: Hoare triple {552#false} assume !false; {552#false} is VALID [2022-04-28 10:47:56,357 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:47:56,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:47:56,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384540996] [2022-04-28 10:47:56,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384540996] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:47:56,357 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:47:56,357 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 10:47:56,358 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:47:56,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1940995066] [2022-04-28 10:47:56,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1940995066] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:47:56,358 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:47:56,358 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 10:47:56,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851171204] [2022-04-28 10:47:56,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:47:56,358 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-28 10:47:56,359 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:47:56,359 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 10:47:56,371 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:47:56,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 10:47:56,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:47:56,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 10:47:56,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 10:47:56,371 INFO L87 Difference]: Start difference. First operand 34 states and 41 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 10:47:56,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:47:56,738 INFO L93 Difference]: Finished difference Result 47 states and 58 transitions. [2022-04-28 10:47:56,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 10:47:56,739 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-28 10:47:56,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:47:56,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 10:47:56,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 55 transitions. [2022-04-28 10:47:56,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 10:47:56,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 55 transitions. [2022-04-28 10:47:56,742 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 55 transitions. [2022-04-28 10:47:56,789 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:47:56,790 INFO L225 Difference]: With dead ends: 47 [2022-04-28 10:47:56,790 INFO L226 Difference]: Without dead ends: 45 [2022-04-28 10:47:56,790 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-28 10:47:56,791 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 32 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:47:56,791 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 45 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 10:47:56,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-28 10:47:56,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 38. [2022-04-28 10:47:56,797 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:47:56,797 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 38 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 10:47:56,797 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 38 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 10:47:56,798 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 38 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 10:47:56,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:47:56,800 INFO L93 Difference]: Finished difference Result 45 states and 56 transitions. [2022-04-28 10:47:56,800 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 56 transitions. [2022-04-28 10:47:56,800 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:47:56,800 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:47:56,800 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 45 states. [2022-04-28 10:47:56,801 INFO L87 Difference]: Start difference. First operand has 38 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 45 states. [2022-04-28 10:47:56,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:47:56,802 INFO L93 Difference]: Finished difference Result 45 states and 56 transitions. [2022-04-28 10:47:56,802 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 56 transitions. [2022-04-28 10:47:56,803 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:47:56,807 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:47:56,807 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:47:56,807 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:47:56,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 10:47:56,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2022-04-28 10:47:56,809 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 22 [2022-04-28 10:47:56,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:47:56,810 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2022-04-28 10:47:56,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 10:47:56,810 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 44 transitions. [2022-04-28 10:47:56,845 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:47:56,845 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2022-04-28 10:47:56,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-28 10:47:56,846 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:47:56,846 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:47:56,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-28 10:47:56,848 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:47:56,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:47:56,849 INFO L85 PathProgramCache]: Analyzing trace with hash -1449027479, now seen corresponding path program 1 times [2022-04-28 10:47:56,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:47:56,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [820564318] [2022-04-28 10:47:56,849 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 10:47:56,849 INFO L85 PathProgramCache]: Analyzing trace with hash -1449027479, now seen corresponding path program 2 times [2022-04-28 10:47:56,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:47:56,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513110435] [2022-04-28 10:47:56,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:47:56,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:47:56,877 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 10:47:56,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1398437737] [2022-04-28 10:47:56,877 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:47:56,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:47:56,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:47:56,904 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:47:56,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-28 10:47:56,946 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:47:56,946 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:47:56,951 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 10:47:56,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:47:56,962 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:47:57,112 INFO L272 TraceCheckUtils]: 0: Hoare triple {838#true} call ULTIMATE.init(); {838#true} is VALID [2022-04-28 10:47:57,112 INFO L290 TraceCheckUtils]: 1: Hoare triple {838#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(9, 2);call #Ultimate.allocInit(12, 3); {838#true} is VALID [2022-04-28 10:47:57,112 INFO L290 TraceCheckUtils]: 2: Hoare triple {838#true} assume true; {838#true} is VALID [2022-04-28 10:47:57,114 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {838#true} {838#true} #94#return; {838#true} is VALID [2022-04-28 10:47:57,114 INFO L272 TraceCheckUtils]: 4: Hoare triple {838#true} call #t~ret6 := main(); {838#true} is VALID [2022-04-28 10:47:57,114 INFO L290 TraceCheckUtils]: 5: Hoare triple {838#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {838#true} is VALID [2022-04-28 10:47:57,114 INFO L272 TraceCheckUtils]: 6: Hoare triple {838#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {838#true} is VALID [2022-04-28 10:47:57,114 INFO L290 TraceCheckUtils]: 7: Hoare triple {838#true} ~cond := #in~cond; {838#true} is VALID [2022-04-28 10:47:57,115 INFO L290 TraceCheckUtils]: 8: Hoare triple {838#true} assume !(0 == ~cond); {838#true} is VALID [2022-04-28 10:47:57,115 INFO L290 TraceCheckUtils]: 9: Hoare triple {838#true} assume true; {838#true} is VALID [2022-04-28 10:47:57,115 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {838#true} {838#true} #78#return; {838#true} is VALID [2022-04-28 10:47:57,115 INFO L290 TraceCheckUtils]: 11: Hoare triple {838#true} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {876#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 10:47:57,116 INFO L290 TraceCheckUtils]: 12: Hoare triple {876#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} assume !false; {876#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 10:47:57,116 INFO L272 TraceCheckUtils]: 13: Hoare triple {876#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {838#true} is VALID [2022-04-28 10:47:57,116 INFO L290 TraceCheckUtils]: 14: Hoare triple {838#true} ~cond := #in~cond; {838#true} is VALID [2022-04-28 10:47:57,116 INFO L290 TraceCheckUtils]: 15: Hoare triple {838#true} assume !(0 == ~cond); {838#true} is VALID [2022-04-28 10:47:57,116 INFO L290 TraceCheckUtils]: 16: Hoare triple {838#true} assume true; {838#true} is VALID [2022-04-28 10:47:57,117 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {838#true} {876#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} #80#return; {876#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 10:47:57,117 INFO L272 TraceCheckUtils]: 18: Hoare triple {876#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~r~0 % 4294967296 == ~A~0 % 4294967296 then 1 else 0)); {838#true} is VALID [2022-04-28 10:47:57,117 INFO L290 TraceCheckUtils]: 19: Hoare triple {838#true} ~cond := #in~cond; {838#true} is VALID [2022-04-28 10:47:57,117 INFO L290 TraceCheckUtils]: 20: Hoare triple {838#true} assume !(0 == ~cond); {838#true} is VALID [2022-04-28 10:47:57,117 INFO L290 TraceCheckUtils]: 21: Hoare triple {838#true} assume true; {838#true} is VALID [2022-04-28 10:47:57,118 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {838#true} {876#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} #82#return; {876#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 10:47:57,119 INFO L272 TraceCheckUtils]: 23: Hoare triple {876#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~d~0 % 4294967296 == ~B~0 * ~p~0 % 4294967296 then 1 else 0)); {913#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:47:57,119 INFO L290 TraceCheckUtils]: 24: Hoare triple {913#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {917#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:47:57,119 INFO L290 TraceCheckUtils]: 25: Hoare triple {917#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {839#false} is VALID [2022-04-28 10:47:57,119 INFO L290 TraceCheckUtils]: 26: Hoare triple {839#false} assume !false; {839#false} is VALID [2022-04-28 10:47:57,120 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 10:47:57,120 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 10:47:57,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:47:57,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513110435] [2022-04-28 10:47:57,120 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 10:47:57,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1398437737] [2022-04-28 10:47:57,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1398437737] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:47:57,120 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:47:57,120 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 10:47:57,121 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:47:57,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [820564318] [2022-04-28 10:47:57,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [820564318] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:47:57,121 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:47:57,121 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 10:47:57,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812801362] [2022-04-28 10:47:57,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:47:57,121 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2022-04-28 10:47:57,122 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:47:57,122 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 10:47:57,136 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:47:57,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 10:47:57,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:47:57,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 10:47:57,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 10:47:57,137 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 10:47:59,256 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-28 10:47:59,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:47:59,489 INFO L93 Difference]: Finished difference Result 55 states and 68 transitions. [2022-04-28 10:47:59,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 10:47:59,489 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2022-04-28 10:47:59,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:47:59,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 10:47:59,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 62 transitions. [2022-04-28 10:47:59,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 10:47:59,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 62 transitions. [2022-04-28 10:47:59,492 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 62 transitions. [2022-04-28 10:47:59,545 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:47:59,546 INFO L225 Difference]: With dead ends: 55 [2022-04-28 10:47:59,546 INFO L226 Difference]: Without dead ends: 52 [2022-04-28 10:47:59,546 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 10:47:59,547 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 8 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:47:59,547 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 124 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 1 Unknown, 0 Unchecked, 2.0s Time] [2022-04-28 10:47:59,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-28 10:47:59,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-04-28 10:47:59,565 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:47:59,566 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 52 states, 29 states have (on average 1.206896551724138) internal successors, (35), 31 states have internal predecessors, (35), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 10:47:59,567 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 52 states, 29 states have (on average 1.206896551724138) internal successors, (35), 31 states have internal predecessors, (35), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 10:47:59,567 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 52 states, 29 states have (on average 1.206896551724138) internal successors, (35), 31 states have internal predecessors, (35), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 10:47:59,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:47:59,570 INFO L93 Difference]: Finished difference Result 52 states and 64 transitions. [2022-04-28 10:47:59,570 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 64 transitions. [2022-04-28 10:47:59,570 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:47:59,571 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:47:59,572 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 29 states have (on average 1.206896551724138) internal successors, (35), 31 states have internal predecessors, (35), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 52 states. [2022-04-28 10:47:59,572 INFO L87 Difference]: Start difference. First operand has 52 states, 29 states have (on average 1.206896551724138) internal successors, (35), 31 states have internal predecessors, (35), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 52 states. [2022-04-28 10:47:59,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:47:59,576 INFO L93 Difference]: Finished difference Result 52 states and 64 transitions. [2022-04-28 10:47:59,576 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 64 transitions. [2022-04-28 10:47:59,577 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:47:59,577 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:47:59,577 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:47:59,577 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:47:59,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 29 states have (on average 1.206896551724138) internal successors, (35), 31 states have internal predecessors, (35), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 10:47:59,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 64 transitions. [2022-04-28 10:47:59,580 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 64 transitions. Word has length 27 [2022-04-28 10:47:59,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:47:59,580 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 64 transitions. [2022-04-28 10:47:59,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 10:47:59,580 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 64 transitions. [2022-04-28 10:47:59,649 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:47:59,649 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 64 transitions. [2022-04-28 10:47:59,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-28 10:47:59,650 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:47:59,650 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:47:59,666 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-28 10:47:59,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:47:59,851 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:47:59,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:47:59,851 INFO L85 PathProgramCache]: Analyzing trace with hash 905213191, now seen corresponding path program 1 times [2022-04-28 10:47:59,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:47:59,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1062680446] [2022-04-28 10:47:59,851 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 10:47:59,852 INFO L85 PathProgramCache]: Analyzing trace with hash 905213191, now seen corresponding path program 2 times [2022-04-28 10:47:59,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:47:59,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291996911] [2022-04-28 10:47:59,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:47:59,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:47:59,865 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 10:47:59,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1361666953] [2022-04-28 10:47:59,865 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:47:59,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:47:59,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:47:59,866 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:47:59,870 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-28 10:47:59,902 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:47:59,903 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:47:59,903 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-28 10:47:59,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:47:59,912 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:48:00,382 INFO L272 TraceCheckUtils]: 0: Hoare triple {1243#true} call ULTIMATE.init(); {1243#true} is VALID [2022-04-28 10:48:00,383 INFO L290 TraceCheckUtils]: 1: Hoare triple {1243#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(9, 2);call #Ultimate.allocInit(12, 3); {1243#true} is VALID [2022-04-28 10:48:00,383 INFO L290 TraceCheckUtils]: 2: Hoare triple {1243#true} assume true; {1243#true} is VALID [2022-04-28 10:48:00,383 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1243#true} {1243#true} #94#return; {1243#true} is VALID [2022-04-28 10:48:00,383 INFO L272 TraceCheckUtils]: 4: Hoare triple {1243#true} call #t~ret6 := main(); {1243#true} is VALID [2022-04-28 10:48:00,383 INFO L290 TraceCheckUtils]: 5: Hoare triple {1243#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {1243#true} is VALID [2022-04-28 10:48:00,383 INFO L272 TraceCheckUtils]: 6: Hoare triple {1243#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {1243#true} is VALID [2022-04-28 10:48:00,383 INFO L290 TraceCheckUtils]: 7: Hoare triple {1243#true} ~cond := #in~cond; {1243#true} is VALID [2022-04-28 10:48:00,384 INFO L290 TraceCheckUtils]: 8: Hoare triple {1243#true} assume !(0 == ~cond); {1243#true} is VALID [2022-04-28 10:48:00,384 INFO L290 TraceCheckUtils]: 9: Hoare triple {1243#true} assume true; {1243#true} is VALID [2022-04-28 10:48:00,384 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1243#true} {1243#true} #78#return; {1243#true} is VALID [2022-04-28 10:48:00,386 INFO L290 TraceCheckUtils]: 11: Hoare triple {1243#true} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {1281#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} is VALID [2022-04-28 10:48:00,397 INFO L290 TraceCheckUtils]: 12: Hoare triple {1281#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} assume !false; {1281#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} is VALID [2022-04-28 10:48:00,397 INFO L272 TraceCheckUtils]: 13: Hoare triple {1281#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {1243#true} is VALID [2022-04-28 10:48:00,397 INFO L290 TraceCheckUtils]: 14: Hoare triple {1243#true} ~cond := #in~cond; {1243#true} is VALID [2022-04-28 10:48:00,397 INFO L290 TraceCheckUtils]: 15: Hoare triple {1243#true} assume !(0 == ~cond); {1243#true} is VALID [2022-04-28 10:48:00,397 INFO L290 TraceCheckUtils]: 16: Hoare triple {1243#true} assume true; {1243#true} is VALID [2022-04-28 10:48:00,401 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1243#true} {1281#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} #80#return; {1281#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} is VALID [2022-04-28 10:48:00,401 INFO L272 TraceCheckUtils]: 18: Hoare triple {1281#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} call __VERIFIER_assert((if ~r~0 % 4294967296 == ~A~0 % 4294967296 then 1 else 0)); {1243#true} is VALID [2022-04-28 10:48:00,401 INFO L290 TraceCheckUtils]: 19: Hoare triple {1243#true} ~cond := #in~cond; {1243#true} is VALID [2022-04-28 10:48:00,402 INFO L290 TraceCheckUtils]: 20: Hoare triple {1243#true} assume !(0 == ~cond); {1243#true} is VALID [2022-04-28 10:48:00,402 INFO L290 TraceCheckUtils]: 21: Hoare triple {1243#true} assume true; {1243#true} is VALID [2022-04-28 10:48:00,402 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1243#true} {1281#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} #82#return; {1281#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} is VALID [2022-04-28 10:48:00,402 INFO L272 TraceCheckUtils]: 23: Hoare triple {1281#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} call __VERIFIER_assert((if ~d~0 % 4294967296 == ~B~0 * ~p~0 % 4294967296 then 1 else 0)); {1243#true} is VALID [2022-04-28 10:48:00,402 INFO L290 TraceCheckUtils]: 24: Hoare triple {1243#true} ~cond := #in~cond; {1243#true} is VALID [2022-04-28 10:48:00,402 INFO L290 TraceCheckUtils]: 25: Hoare triple {1243#true} assume !(0 == ~cond); {1243#true} is VALID [2022-04-28 10:48:00,403 INFO L290 TraceCheckUtils]: 26: Hoare triple {1243#true} assume true; {1243#true} is VALID [2022-04-28 10:48:00,403 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1243#true} {1281#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} #84#return; {1281#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} is VALID [2022-04-28 10:48:00,404 INFO L290 TraceCheckUtils]: 28: Hoare triple {1281#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} assume !(~r~0 % 4294967296 >= ~d~0 % 4294967296); {1333#(and (= main_~A~0 main_~r~0) (not (<= (mod main_~B~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} is VALID [2022-04-28 10:48:00,404 INFO L290 TraceCheckUtils]: 29: Hoare triple {1333#(and (= main_~A~0 main_~r~0) (not (<= (mod main_~B~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} assume !false; {1333#(and (= main_~A~0 main_~r~0) (not (<= (mod main_~B~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} is VALID [2022-04-28 10:48:00,405 INFO L272 TraceCheckUtils]: 30: Hoare triple {1333#(and (= main_~A~0 main_~r~0) (not (<= (mod main_~B~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~B~0 + ~r~0) % 4294967296 then 1 else 0)); {1340#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:48:00,405 INFO L290 TraceCheckUtils]: 31: Hoare triple {1340#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1344#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:48:00,405 INFO L290 TraceCheckUtils]: 32: Hoare triple {1344#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1244#false} is VALID [2022-04-28 10:48:00,405 INFO L290 TraceCheckUtils]: 33: Hoare triple {1244#false} assume !false; {1244#false} is VALID [2022-04-28 10:48:00,406 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-28 10:48:00,406 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 10:48:00,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:48:00,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291996911] [2022-04-28 10:48:00,406 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 10:48:00,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1361666953] [2022-04-28 10:48:00,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1361666953] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:48:00,406 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:48:00,406 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 10:48:00,406 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:48:00,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1062680446] [2022-04-28 10:48:00,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1062680446] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:48:00,407 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:48:00,407 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 10:48:00,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844621655] [2022-04-28 10:48:00,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:48:00,407 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), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34 [2022-04-28 10:48:00,407 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:48:00,408 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), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 10:48:00,427 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:48:00,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 10:48:00,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:48:00,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 10:48:00,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 10:48:00,428 INFO L87 Difference]: Start difference. First operand 52 states and 64 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 10:48:01,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:48:01,338 INFO L93 Difference]: Finished difference Result 73 states and 87 transitions. [2022-04-28 10:48:01,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 10:48:01,338 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), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34 [2022-04-28 10:48:01,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:48:01,339 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), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 10:48:01,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 72 transitions. [2022-04-28 10:48:01,340 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), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 10:48:01,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 72 transitions. [2022-04-28 10:48:01,341 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 72 transitions. [2022-04-28 10:48:01,421 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-28 10:48:01,423 INFO L225 Difference]: With dead ends: 73 [2022-04-28 10:48:01,423 INFO L226 Difference]: Without dead ends: 70 [2022-04-28 10:48:01,423 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-28 10:48:01,424 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 12 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 10:48:01,424 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 135 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 10:48:01,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-04-28 10:48:01,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2022-04-28 10:48:01,449 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:48:01,449 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand has 69 states, 41 states have (on average 1.170731707317073) internal successors, (48), 43 states have internal predecessors, (48), 18 states have call successors, (18), 10 states have call predecessors, (18), 9 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 10:48:01,450 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand has 69 states, 41 states have (on average 1.170731707317073) internal successors, (48), 43 states have internal predecessors, (48), 18 states have call successors, (18), 10 states have call predecessors, (18), 9 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 10:48:01,450 INFO L87 Difference]: Start difference. First operand 70 states. Second operand has 69 states, 41 states have (on average 1.170731707317073) internal successors, (48), 43 states have internal predecessors, (48), 18 states have call successors, (18), 10 states have call predecessors, (18), 9 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 10:48:01,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:48:01,452 INFO L93 Difference]: Finished difference Result 70 states and 83 transitions. [2022-04-28 10:48:01,452 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 83 transitions. [2022-04-28 10:48:01,452 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:48:01,452 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:48:01,453 INFO L74 IsIncluded]: Start isIncluded. First operand has 69 states, 41 states have (on average 1.170731707317073) internal successors, (48), 43 states have internal predecessors, (48), 18 states have call successors, (18), 10 states have call predecessors, (18), 9 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) Second operand 70 states. [2022-04-28 10:48:01,453 INFO L87 Difference]: Start difference. First operand has 69 states, 41 states have (on average 1.170731707317073) internal successors, (48), 43 states have internal predecessors, (48), 18 states have call successors, (18), 10 states have call predecessors, (18), 9 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) Second operand 70 states. [2022-04-28 10:48:01,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:48:01,455 INFO L93 Difference]: Finished difference Result 70 states and 83 transitions. [2022-04-28 10:48:01,455 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 83 transitions. [2022-04-28 10:48:01,455 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:48:01,455 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:48:01,455 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:48:01,455 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:48:01,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 41 states have (on average 1.170731707317073) internal successors, (48), 43 states have internal predecessors, (48), 18 states have call successors, (18), 10 states have call predecessors, (18), 9 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 10:48:01,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 82 transitions. [2022-04-28 10:48:01,457 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 82 transitions. Word has length 34 [2022-04-28 10:48:01,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:48:01,457 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 82 transitions. [2022-04-28 10:48:01,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 10:48:01,458 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 69 states and 82 transitions. [2022-04-28 10:48:01,561 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-28 10:48:01,561 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 82 transitions. [2022-04-28 10:48:01,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-28 10:48:01,562 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:48:01,562 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:48:01,593 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-28 10:48:01,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:48:01,763 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:48:01,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:48:01,763 INFO L85 PathProgramCache]: Analyzing trace with hash -1576096488, now seen corresponding path program 1 times [2022-04-28 10:48:01,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:48:01,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1171370556] [2022-04-28 10:48:02,598 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:48:02,599 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:48:02,599 INFO L85 PathProgramCache]: Analyzing trace with hash -1576096488, now seen corresponding path program 2 times [2022-04-28 10:48:02,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:48:02,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476769900] [2022-04-28 10:48:02,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:48:02,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:48:02,617 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 10:48:02,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1626981056] [2022-04-28 10:48:02,617 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:48:02,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:48:02,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:48:02,618 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:48:02,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-28 10:48:02,715 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:48:02,715 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:48:02,716 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-28 10:48:02,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:48:02,733 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:48:02,891 INFO L272 TraceCheckUtils]: 0: Hoare triple {1778#true} call ULTIMATE.init(); {1778#true} is VALID [2022-04-28 10:48:02,892 INFO L290 TraceCheckUtils]: 1: Hoare triple {1778#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(9, 2);call #Ultimate.allocInit(12, 3); {1778#true} is VALID [2022-04-28 10:48:02,892 INFO L290 TraceCheckUtils]: 2: Hoare triple {1778#true} assume true; {1778#true} is VALID [2022-04-28 10:48:02,892 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1778#true} {1778#true} #94#return; {1778#true} is VALID [2022-04-28 10:48:02,892 INFO L272 TraceCheckUtils]: 4: Hoare triple {1778#true} call #t~ret6 := main(); {1778#true} is VALID [2022-04-28 10:48:02,892 INFO L290 TraceCheckUtils]: 5: Hoare triple {1778#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {1778#true} is VALID [2022-04-28 10:48:02,892 INFO L272 TraceCheckUtils]: 6: Hoare triple {1778#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {1778#true} is VALID [2022-04-28 10:48:02,892 INFO L290 TraceCheckUtils]: 7: Hoare triple {1778#true} ~cond := #in~cond; {1778#true} is VALID [2022-04-28 10:48:02,892 INFO L290 TraceCheckUtils]: 8: Hoare triple {1778#true} assume !(0 == ~cond); {1778#true} is VALID [2022-04-28 10:48:02,892 INFO L290 TraceCheckUtils]: 9: Hoare triple {1778#true} assume true; {1778#true} is VALID [2022-04-28 10:48:02,892 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1778#true} {1778#true} #78#return; {1778#true} is VALID [2022-04-28 10:48:02,893 INFO L290 TraceCheckUtils]: 11: Hoare triple {1778#true} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {1816#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 10:48:02,893 INFO L290 TraceCheckUtils]: 12: Hoare triple {1816#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} assume !false; {1816#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 10:48:02,893 INFO L272 TraceCheckUtils]: 13: Hoare triple {1816#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {1778#true} is VALID [2022-04-28 10:48:02,893 INFO L290 TraceCheckUtils]: 14: Hoare triple {1778#true} ~cond := #in~cond; {1778#true} is VALID [2022-04-28 10:48:02,893 INFO L290 TraceCheckUtils]: 15: Hoare triple {1778#true} assume !(0 == ~cond); {1778#true} is VALID [2022-04-28 10:48:02,893 INFO L290 TraceCheckUtils]: 16: Hoare triple {1778#true} assume true; {1778#true} is VALID [2022-04-28 10:48:02,894 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1778#true} {1816#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} #80#return; {1816#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 10:48:02,894 INFO L272 TraceCheckUtils]: 18: Hoare triple {1816#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~r~0 % 4294967296 == ~A~0 % 4294967296 then 1 else 0)); {1778#true} is VALID [2022-04-28 10:48:02,894 INFO L290 TraceCheckUtils]: 19: Hoare triple {1778#true} ~cond := #in~cond; {1778#true} is VALID [2022-04-28 10:48:02,894 INFO L290 TraceCheckUtils]: 20: Hoare triple {1778#true} assume !(0 == ~cond); {1778#true} is VALID [2022-04-28 10:48:02,894 INFO L290 TraceCheckUtils]: 21: Hoare triple {1778#true} assume true; {1778#true} is VALID [2022-04-28 10:48:02,895 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1778#true} {1816#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} #82#return; {1816#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 10:48:02,895 INFO L272 TraceCheckUtils]: 23: Hoare triple {1816#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~d~0 % 4294967296 == ~B~0 * ~p~0 % 4294967296 then 1 else 0)); {1778#true} is VALID [2022-04-28 10:48:02,895 INFO L290 TraceCheckUtils]: 24: Hoare triple {1778#true} ~cond := #in~cond; {1778#true} is VALID [2022-04-28 10:48:02,895 INFO L290 TraceCheckUtils]: 25: Hoare triple {1778#true} assume !(0 == ~cond); {1778#true} is VALID [2022-04-28 10:48:02,895 INFO L290 TraceCheckUtils]: 26: Hoare triple {1778#true} assume true; {1778#true} is VALID [2022-04-28 10:48:02,896 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1778#true} {1816#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} #84#return; {1816#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 10:48:02,896 INFO L290 TraceCheckUtils]: 28: Hoare triple {1816#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} assume !!(~r~0 % 4294967296 >= ~d~0 % 4294967296);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {1868#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2))} is VALID [2022-04-28 10:48:02,896 INFO L290 TraceCheckUtils]: 29: Hoare triple {1868#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2))} assume !false; {1868#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2))} is VALID [2022-04-28 10:48:02,897 INFO L272 TraceCheckUtils]: 30: Hoare triple {1868#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2))} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {1778#true} is VALID [2022-04-28 10:48:02,897 INFO L290 TraceCheckUtils]: 31: Hoare triple {1778#true} ~cond := #in~cond; {1778#true} is VALID [2022-04-28 10:48:02,897 INFO L290 TraceCheckUtils]: 32: Hoare triple {1778#true} assume !(0 == ~cond); {1778#true} is VALID [2022-04-28 10:48:02,897 INFO L290 TraceCheckUtils]: 33: Hoare triple {1778#true} assume true; {1778#true} is VALID [2022-04-28 10:48:02,897 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1778#true} {1868#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2))} #80#return; {1868#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2))} is VALID [2022-04-28 10:48:02,897 INFO L272 TraceCheckUtils]: 35: Hoare triple {1868#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2))} call __VERIFIER_assert((if ~r~0 % 4294967296 == ~A~0 % 4294967296 then 1 else 0)); {1778#true} is VALID [2022-04-28 10:48:02,898 INFO L290 TraceCheckUtils]: 36: Hoare triple {1778#true} ~cond := #in~cond; {1778#true} is VALID [2022-04-28 10:48:02,898 INFO L290 TraceCheckUtils]: 37: Hoare triple {1778#true} assume !(0 == ~cond); {1778#true} is VALID [2022-04-28 10:48:02,898 INFO L290 TraceCheckUtils]: 38: Hoare triple {1778#true} assume true; {1778#true} is VALID [2022-04-28 10:48:02,899 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {1778#true} {1868#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2))} #82#return; {1868#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2))} is VALID [2022-04-28 10:48:02,902 INFO L272 TraceCheckUtils]: 40: Hoare triple {1868#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2))} call __VERIFIER_assert((if ~d~0 % 4294967296 == ~B~0 * ~p~0 % 4294967296 then 1 else 0)); {1905#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:48:02,902 INFO L290 TraceCheckUtils]: 41: Hoare triple {1905#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1909#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:48:02,903 INFO L290 TraceCheckUtils]: 42: Hoare triple {1909#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1779#false} is VALID [2022-04-28 10:48:02,903 INFO L290 TraceCheckUtils]: 43: Hoare triple {1779#false} assume !false; {1779#false} is VALID [2022-04-28 10:48:02,903 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-28 10:48:02,903 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:48:03,746 INFO L290 TraceCheckUtils]: 43: Hoare triple {1779#false} assume !false; {1779#false} is VALID [2022-04-28 10:48:03,747 INFO L290 TraceCheckUtils]: 42: Hoare triple {1909#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1779#false} is VALID [2022-04-28 10:48:03,747 INFO L290 TraceCheckUtils]: 41: Hoare triple {1905#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1909#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:48:03,748 INFO L272 TraceCheckUtils]: 40: Hoare triple {1925#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} call __VERIFIER_assert((if ~d~0 % 4294967296 == ~B~0 * ~p~0 % 4294967296 then 1 else 0)); {1905#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:48:03,748 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {1778#true} {1925#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} #82#return; {1925#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} is VALID [2022-04-28 10:48:03,748 INFO L290 TraceCheckUtils]: 38: Hoare triple {1778#true} assume true; {1778#true} is VALID [2022-04-28 10:48:03,748 INFO L290 TraceCheckUtils]: 37: Hoare triple {1778#true} assume !(0 == ~cond); {1778#true} is VALID [2022-04-28 10:48:03,748 INFO L290 TraceCheckUtils]: 36: Hoare triple {1778#true} ~cond := #in~cond; {1778#true} is VALID [2022-04-28 10:48:03,748 INFO L272 TraceCheckUtils]: 35: Hoare triple {1925#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} call __VERIFIER_assert((if ~r~0 % 4294967296 == ~A~0 % 4294967296 then 1 else 0)); {1778#true} is VALID [2022-04-28 10:48:03,749 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1778#true} {1925#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} #80#return; {1925#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} is VALID [2022-04-28 10:48:03,749 INFO L290 TraceCheckUtils]: 33: Hoare triple {1778#true} assume true; {1778#true} is VALID [2022-04-28 10:48:03,749 INFO L290 TraceCheckUtils]: 32: Hoare triple {1778#true} assume !(0 == ~cond); {1778#true} is VALID [2022-04-28 10:48:03,749 INFO L290 TraceCheckUtils]: 31: Hoare triple {1778#true} ~cond := #in~cond; {1778#true} is VALID [2022-04-28 10:48:03,749 INFO L272 TraceCheckUtils]: 30: Hoare triple {1925#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {1778#true} is VALID [2022-04-28 10:48:03,750 INFO L290 TraceCheckUtils]: 29: Hoare triple {1925#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} assume !false; {1925#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} is VALID [2022-04-28 10:48:05,754 WARN L290 TraceCheckUtils]: 28: Hoare triple {1962#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} assume !!(~r~0 % 4294967296 >= ~d~0 % 4294967296);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {1925#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} is UNKNOWN [2022-04-28 10:48:05,754 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1778#true} {1962#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} #84#return; {1962#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} is VALID [2022-04-28 10:48:05,755 INFO L290 TraceCheckUtils]: 26: Hoare triple {1778#true} assume true; {1778#true} is VALID [2022-04-28 10:48:05,755 INFO L290 TraceCheckUtils]: 25: Hoare triple {1778#true} assume !(0 == ~cond); {1778#true} is VALID [2022-04-28 10:48:05,755 INFO L290 TraceCheckUtils]: 24: Hoare triple {1778#true} ~cond := #in~cond; {1778#true} is VALID [2022-04-28 10:48:05,755 INFO L272 TraceCheckUtils]: 23: Hoare triple {1962#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} call __VERIFIER_assert((if ~d~0 % 4294967296 == ~B~0 * ~p~0 % 4294967296 then 1 else 0)); {1778#true} is VALID [2022-04-28 10:48:05,755 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1778#true} {1962#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} #82#return; {1962#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} is VALID [2022-04-28 10:48:05,755 INFO L290 TraceCheckUtils]: 21: Hoare triple {1778#true} assume true; {1778#true} is VALID [2022-04-28 10:48:05,756 INFO L290 TraceCheckUtils]: 20: Hoare triple {1778#true} assume !(0 == ~cond); {1778#true} is VALID [2022-04-28 10:48:05,756 INFO L290 TraceCheckUtils]: 19: Hoare triple {1778#true} ~cond := #in~cond; {1778#true} is VALID [2022-04-28 10:48:05,756 INFO L272 TraceCheckUtils]: 18: Hoare triple {1962#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} call __VERIFIER_assert((if ~r~0 % 4294967296 == ~A~0 % 4294967296 then 1 else 0)); {1778#true} is VALID [2022-04-28 10:48:05,757 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1778#true} {1962#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} #80#return; {1962#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} is VALID [2022-04-28 10:48:05,757 INFO L290 TraceCheckUtils]: 16: Hoare triple {1778#true} assume true; {1778#true} is VALID [2022-04-28 10:48:05,757 INFO L290 TraceCheckUtils]: 15: Hoare triple {1778#true} assume !(0 == ~cond); {1778#true} is VALID [2022-04-28 10:48:05,757 INFO L290 TraceCheckUtils]: 14: Hoare triple {1778#true} ~cond := #in~cond; {1778#true} is VALID [2022-04-28 10:48:05,757 INFO L272 TraceCheckUtils]: 13: Hoare triple {1962#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {1778#true} is VALID [2022-04-28 10:48:05,758 INFO L290 TraceCheckUtils]: 12: Hoare triple {1962#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} assume !false; {1962#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} is VALID [2022-04-28 10:48:05,758 INFO L290 TraceCheckUtils]: 11: Hoare triple {1778#true} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {1962#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} is VALID [2022-04-28 10:48:05,758 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1778#true} {1778#true} #78#return; {1778#true} is VALID [2022-04-28 10:48:05,758 INFO L290 TraceCheckUtils]: 9: Hoare triple {1778#true} assume true; {1778#true} is VALID [2022-04-28 10:48:05,758 INFO L290 TraceCheckUtils]: 8: Hoare triple {1778#true} assume !(0 == ~cond); {1778#true} is VALID [2022-04-28 10:48:05,758 INFO L290 TraceCheckUtils]: 7: Hoare triple {1778#true} ~cond := #in~cond; {1778#true} is VALID [2022-04-28 10:48:05,759 INFO L272 TraceCheckUtils]: 6: Hoare triple {1778#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {1778#true} is VALID [2022-04-28 10:48:05,759 INFO L290 TraceCheckUtils]: 5: Hoare triple {1778#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {1778#true} is VALID [2022-04-28 10:48:05,759 INFO L272 TraceCheckUtils]: 4: Hoare triple {1778#true} call #t~ret6 := main(); {1778#true} is VALID [2022-04-28 10:48:05,759 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1778#true} {1778#true} #94#return; {1778#true} is VALID [2022-04-28 10:48:05,759 INFO L290 TraceCheckUtils]: 2: Hoare triple {1778#true} assume true; {1778#true} is VALID [2022-04-28 10:48:05,759 INFO L290 TraceCheckUtils]: 1: Hoare triple {1778#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(9, 2);call #Ultimate.allocInit(12, 3); {1778#true} is VALID [2022-04-28 10:48:05,759 INFO L272 TraceCheckUtils]: 0: Hoare triple {1778#true} call ULTIMATE.init(); {1778#true} is VALID [2022-04-28 10:48:05,759 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-28 10:48:05,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:48:05,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476769900] [2022-04-28 10:48:05,759 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 10:48:05,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1626981056] [2022-04-28 10:48:05,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1626981056] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-28 10:48:05,760 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-28 10:48:05,760 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 8 [2022-04-28 10:48:05,760 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:48:05,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1171370556] [2022-04-28 10:48:05,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1171370556] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:48:05,760 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:48:05,760 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 10:48:05,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667088892] [2022-04-28 10:48:05,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:48:05,761 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), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 44 [2022-04-28 10:48:05,761 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:48:05,761 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), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 10:48:06,428 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:48:06,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 10:48:06,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:48:06,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 10:48:06,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-04-28 10:48:06,429 INFO L87 Difference]: Start difference. First operand 69 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), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 10:48:12,036 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 10:48:14,440 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 10:48:16,576 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 10:48:18,731 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 10:48:20,897 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 10:48:25,052 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 10:48:27,193 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 10:48:27,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:48:27,414 INFO L93 Difference]: Finished difference Result 81 states and 97 transitions. [2022-04-28 10:48:27,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 10:48:27,414 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), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 44 [2022-04-28 10:48:27,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:48:27,414 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), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 10:48:27,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2022-04-28 10:48:27,415 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), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 10:48:27,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2022-04-28 10:48:27,416 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 53 transitions. [2022-04-28 10:48:29,488 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 52 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 10:48:29,490 INFO L225 Difference]: With dead ends: 81 [2022-04-28 10:48:29,490 INFO L226 Difference]: Without dead ends: 79 [2022-04-28 10:48:29,490 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-04-28 10:48:29,491 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 8 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.4s IncrementalHoareTripleChecker+Time [2022-04-28 10:48:29,491 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 134 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 7 Unknown, 0 Unchecked, 16.4s Time] [2022-04-28 10:48:29,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-04-28 10:48:29,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 76. [2022-04-28 10:48:29,535 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:48:29,535 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 states. Second operand has 76 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 48 states have internal predecessors, (52), 20 states have call successors, (20), 11 states have call predecessors, (20), 10 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 10:48:29,535 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand has 76 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 48 states have internal predecessors, (52), 20 states have call successors, (20), 11 states have call predecessors, (20), 10 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 10:48:29,535 INFO L87 Difference]: Start difference. First operand 79 states. Second operand has 76 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 48 states have internal predecessors, (52), 20 states have call successors, (20), 11 states have call predecessors, (20), 10 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 10:48:29,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:48:29,538 INFO L93 Difference]: Finished difference Result 79 states and 95 transitions. [2022-04-28 10:48:29,538 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 95 transitions. [2022-04-28 10:48:29,538 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:48:29,538 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:48:29,539 INFO L74 IsIncluded]: Start isIncluded. First operand has 76 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 48 states have internal predecessors, (52), 20 states have call successors, (20), 11 states have call predecessors, (20), 10 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) Second operand 79 states. [2022-04-28 10:48:29,539 INFO L87 Difference]: Start difference. First operand has 76 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 48 states have internal predecessors, (52), 20 states have call successors, (20), 11 states have call predecessors, (20), 10 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) Second operand 79 states. [2022-04-28 10:48:29,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:48:29,541 INFO L93 Difference]: Finished difference Result 79 states and 95 transitions. [2022-04-28 10:48:29,541 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 95 transitions. [2022-04-28 10:48:29,541 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:48:29,541 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:48:29,541 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:48:29,541 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:48:29,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 48 states have internal predecessors, (52), 20 states have call successors, (20), 11 states have call predecessors, (20), 10 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 10:48:29,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 90 transitions. [2022-04-28 10:48:29,543 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 90 transitions. Word has length 44 [2022-04-28 10:48:29,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:48:29,544 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 90 transitions. [2022-04-28 10:48:29,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 10:48:29,544 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 76 states and 90 transitions. [2022-04-28 10:48:32,413 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 89 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 10:48:32,414 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 90 transitions. [2022-04-28 10:48:32,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-28 10:48:32,414 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:48:32,414 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 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] [2022-04-28 10:48:32,420 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-28 10:48:32,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:48:32,618 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:48:32,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:48:32,618 INFO L85 PathProgramCache]: Analyzing trace with hash 1352613400, now seen corresponding path program 1 times [2022-04-28 10:48:32,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:48:32,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [993571395] [2022-04-28 10:48:32,619 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 10:48:32,619 INFO L85 PathProgramCache]: Analyzing trace with hash 1352613400, now seen corresponding path program 2 times [2022-04-28 10:48:32,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:48:32,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170415287] [2022-04-28 10:48:32,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:48:32,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:48:32,642 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 10:48:32,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [850976325] [2022-04-28 10:48:32,643 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:48:32,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:48:32,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:48:32,647 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:48:32,648 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process