/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_unwindbound10.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 04:56:09,973 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 04:56:09,974 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 04:56:09,994 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 04:56:09,995 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 04:56:09,998 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 04:56:10,001 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 04:56:10,006 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 04:56:10,007 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 04:56:10,012 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 04:56:10,013 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 04:56:10,014 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 04:56:10,014 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 04:56:10,016 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 04:56:10,017 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 04:56:10,017 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 04:56:10,018 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 04:56:10,019 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 04:56:10,022 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 04:56:10,027 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 04:56:10,029 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 04:56:10,029 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 04:56:10,030 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 04:56:10,031 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 04:56:10,031 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 04:56:10,036 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 04:56:10,037 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 04:56:10,037 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 04:56:10,038 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 04:56:10,038 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 04:56:10,039 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 04:56:10,039 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 04:56:10,040 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 04:56:10,041 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 04:56:10,041 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 04:56:10,042 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 04:56:10,042 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 04:56:10,042 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 04:56:10,042 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 04:56:10,043 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 04:56:10,043 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 04:56:10,044 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 04:56:10,045 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-08 04:56:10,052 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 04:56:10,053 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 04:56:10,053 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 04:56:10,053 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-08 04:56:10,054 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 04:56:10,054 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-08 04:56:10,054 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 04:56:10,054 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 04:56:10,054 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 04:56:10,055 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 04:56:10,055 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-08 04:56:10,055 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 04:56:10,055 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 04:56:10,055 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 04:56:10,055 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 04:56:10,055 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 04:56:10,055 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 04:56:10,056 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 04:56:10,056 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 04:56:10,056 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 04:56:10,056 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 04:56:10,056 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 04:56:10,056 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 04:56:10,056 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 04:56:10,056 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-08 04:56:10,056 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-08 04:56:10,237 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 04:56:10,254 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 04:56:10,256 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 04:56:10,257 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 04:56:10,257 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 04:56:10,258 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_unwindbound10.c [2022-04-08 04:56:10,309 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/233606a95/d04b1348ed10489db508edc64d1ff0c0/FLAG46d53ad9c [2022-04-08 04:56:10,685 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 04:56:10,685 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_unwindbound10.c [2022-04-08 04:56:10,690 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/233606a95/d04b1348ed10489db508edc64d1ff0c0/FLAG46d53ad9c [2022-04-08 04:56:10,703 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/233606a95/d04b1348ed10489db508edc64d1ff0c0 [2022-04-08 04:56:10,704 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 04:56:10,705 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 04:56:10,707 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 04:56:10,708 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 04:56:10,710 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 04:56:10,714 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 04:56:10" (1/1) ... [2022-04-08 04:56:10,714 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@276965f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:56:10, skipping insertion in model container [2022-04-08 04:56:10,715 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 04:56:10" (1/1) ... [2022-04-08 04:56:10,719 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 04:56:10,732 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 04:56:10,873 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_unwindbound10.c[525,538] [2022-04-08 04:56:10,912 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 04:56:10,918 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 04:56:10,925 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_unwindbound10.c[525,538] [2022-04-08 04:56:10,948 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 04:56:10,957 INFO L208 MainTranslator]: Completed translation [2022-04-08 04:56:10,957 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:56:10 WrapperNode [2022-04-08 04:56:10,957 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 04:56:10,958 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 04:56:10,958 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 04:56:10,958 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 04:56:10,972 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:56:10" (1/1) ... [2022-04-08 04:56:10,972 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:56:10" (1/1) ... [2022-04-08 04:56:10,977 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:56:10" (1/1) ... [2022-04-08 04:56:10,978 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:56:10" (1/1) ... [2022-04-08 04:56:10,984 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:56:10" (1/1) ... [2022-04-08 04:56:10,987 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:56:10" (1/1) ... [2022-04-08 04:56:10,987 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:56:10" (1/1) ... [2022-04-08 04:56:10,988 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 04:56:10,989 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 04:56:10,989 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 04:56:10,989 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 04:56:10,994 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:56:10" (1/1) ... [2022-04-08 04:56:10,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 04:56:11,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:56:11,018 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-08 04:56:11,027 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-08 04:56:11,046 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 04:56:11,046 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 04:56:11,047 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 04:56:11,047 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 04:56:11,047 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 04:56:11,047 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 04:56:11,047 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 04:56:11,048 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 04:56:11,048 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 04:56:11,048 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 04:56:11,048 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-08 04:56:11,049 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 04:56:11,049 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 04:56:11,049 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 04:56:11,049 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 04:56:11,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 04:56:11,049 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 04:56:11,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 04:56:11,049 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 04:56:11,050 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 04:56:11,095 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 04:56:11,096 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 04:56:11,264 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 04:56:11,278 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 04:56:11,278 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-08 04:56:11,279 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 04:56:11 BoogieIcfgContainer [2022-04-08 04:56:11,280 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 04:56:11,281 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 04:56:11,281 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 04:56:11,287 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 04:56:11,288 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 04:56:10" (1/3) ... [2022-04-08 04:56:11,288 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6859912c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 04:56:11, skipping insertion in model container [2022-04-08 04:56:11,288 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:56:10" (2/3) ... [2022-04-08 04:56:11,288 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6859912c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 04:56:11, skipping insertion in model container [2022-04-08 04:56:11,288 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 04:56:11" (3/3) ... [2022-04-08 04:56:11,290 INFO L111 eAbstractionObserver]: Analyzing ICFG dijkstra-u_unwindbound10.c [2022-04-08 04:56:11,293 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 04:56:11,293 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 04:56:11,325 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 04:56:11,332 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-08 04:56:11,332 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 04:56:11,348 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 22 states have internal predecessors, (31), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 04:56:11,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-08 04:56:11,353 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:56:11,353 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:56:11,354 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:56:11,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:56:11,358 INFO L85 PathProgramCache]: Analyzing trace with hash -2024343623, now seen corresponding path program 1 times [2022-04-08 04:56:11,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:56:11,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [69079823] [2022-04-08 04:56:11,371 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 04:56:11,371 INFO L85 PathProgramCache]: Analyzing trace with hash -2024343623, now seen corresponding path program 2 times [2022-04-08 04:56:11,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:56:11,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623471822] [2022-04-08 04:56:11,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:56:11,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:56:11,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:56:11,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 04:56:11,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:56:11,536 INFO L290 TraceCheckUtils]: 0: Hoare triple {51#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {42#true} is VALID [2022-04-08 04:56:11,537 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} assume true; {42#true} is VALID [2022-04-08 04:56:11,537 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {42#true} {42#true} #102#return; {42#true} is VALID [2022-04-08 04:56:11,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-08 04:56:11,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:56:11,546 INFO L290 TraceCheckUtils]: 0: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-08 04:56:11,546 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-08 04:56:11,546 INFO L290 TraceCheckUtils]: 2: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-08 04:56:11,547 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43#false} {42#true} #82#return; {43#false} is VALID [2022-04-08 04:56:11,547 INFO L272 TraceCheckUtils]: 0: Hoare triple {42#true} call ULTIMATE.init(); {51#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 04:56:11,548 INFO L290 TraceCheckUtils]: 1: Hoare triple {51#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {42#true} is VALID [2022-04-08 04:56:11,548 INFO L290 TraceCheckUtils]: 2: Hoare triple {42#true} assume true; {42#true} is VALID [2022-04-08 04:56:11,549 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42#true} {42#true} #102#return; {42#true} is VALID [2022-04-08 04:56:11,549 INFO L272 TraceCheckUtils]: 4: Hoare triple {42#true} call #t~ret7 := main(); {42#true} is VALID [2022-04-08 04:56:11,549 INFO L290 TraceCheckUtils]: 5: Hoare triple {42#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {42#true} is VALID [2022-04-08 04:56:11,549 INFO L272 TraceCheckUtils]: 6: Hoare triple {42#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {42#true} is VALID [2022-04-08 04:56:11,549 INFO L290 TraceCheckUtils]: 7: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-08 04:56:11,550 INFO L290 TraceCheckUtils]: 8: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-08 04:56:11,550 INFO L290 TraceCheckUtils]: 9: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-08 04:56:11,550 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {43#false} {42#true} #82#return; {43#false} is VALID [2022-04-08 04:56:11,551 INFO L290 TraceCheckUtils]: 11: Hoare triple {43#false} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {43#false} is VALID [2022-04-08 04:56:11,552 INFO L290 TraceCheckUtils]: 12: Hoare triple {43#false} assume !true; {43#false} is VALID [2022-04-08 04:56:11,552 INFO L290 TraceCheckUtils]: 13: Hoare triple {43#false} assume !true; {43#false} is VALID [2022-04-08 04:56:11,552 INFO L272 TraceCheckUtils]: 14: Hoare triple {43#false} call __VERIFIER_assert((if 0 == (~h~0 * ~h~0 * ~h~0 - 12 * ~h~0 * ~n~0 + 16 * ~n~0 * ~p~0 + 12 * ~h~0 * ~r~0 - 16 * ~p~0 * ~r~0 - ~h~0 - 4 * ~p~0) % 4294967296 then 1 else 0)); {43#false} is VALID [2022-04-08 04:56:11,552 INFO L290 TraceCheckUtils]: 15: Hoare triple {43#false} ~cond := #in~cond; {43#false} is VALID [2022-04-08 04:56:11,552 INFO L290 TraceCheckUtils]: 16: Hoare triple {43#false} assume 0 == ~cond; {43#false} is VALID [2022-04-08 04:56:11,553 INFO L290 TraceCheckUtils]: 17: Hoare triple {43#false} assume !false; {43#false} is VALID [2022-04-08 04:56:11,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 04:56:11,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:56:11,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623471822] [2022-04-08 04:56:11,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623471822] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:56:11,554 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:56:11,555 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 04:56:11,559 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:56:11,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [69079823] [2022-04-08 04:56:11,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [69079823] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:56:11,559 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:56:11,559 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 04:56:11,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285669470] [2022-04-08 04:56:11,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:56:11,565 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-08 04:56:11,566 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:56:11,568 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 04:56:11,590 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:56:11,590 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 04:56:11,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:56:11,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 04:56:11,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 04:56:11,610 INFO L87 Difference]: Start difference. First operand has 39 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 22 states have internal predecessors, (31), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 04:56:13,695 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-08 04:56:16,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:56:16,667 INFO L93 Difference]: Finished difference Result 70 states and 111 transitions. [2022-04-08 04:56:16,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 04:56:16,667 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-08 04:56:16,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:56:16,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 04:56:16,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2022-04-08 04:56:16,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 04:56:16,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2022-04-08 04:56:16,682 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 111 transitions. [2022-04-08 04:56:16,826 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:56:16,832 INFO L225 Difference]: With dead ends: 70 [2022-04-08 04:56:16,833 INFO L226 Difference]: Without dead ends: 35 [2022-04-08 04:56:16,834 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 04:56:16,836 INFO L913 BasicCegarLoop]: 49 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 11 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-08 04:56:16,837 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 53 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 25 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-08 04:56:16,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-08 04:56:16,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2022-04-08 04:56:16,888 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:56:16,888 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 34 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 04:56:16,889 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 34 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 04:56:16,889 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 34 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 04:56:16,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:56:16,894 INFO L93 Difference]: Finished difference Result 35 states and 47 transitions. [2022-04-08 04:56:16,894 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 47 transitions. [2022-04-08 04:56:16,895 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:56:16,895 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:56:16,895 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 35 states. [2022-04-08 04:56:16,895 INFO L87 Difference]: Start difference. First operand has 34 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 35 states. [2022-04-08 04:56:16,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:56:16,900 INFO L93 Difference]: Finished difference Result 35 states and 47 transitions. [2022-04-08 04:56:16,900 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 47 transitions. [2022-04-08 04:56:16,900 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:56:16,901 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:56:16,901 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:56:16,901 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:56:16,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 04:56:16,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 46 transitions. [2022-04-08 04:56:16,906 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 46 transitions. Word has length 18 [2022-04-08 04:56:16,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:56:16,906 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 46 transitions. [2022-04-08 04:56:16,907 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 04:56:16,907 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 46 transitions. [2022-04-08 04:56:16,962 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:56:16,963 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 46 transitions. [2022-04-08 04:56:16,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-08 04:56:16,965 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:56:16,965 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:56:16,965 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 04:56:16,965 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:56:16,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:56:16,966 INFO L85 PathProgramCache]: Analyzing trace with hash -96361696, now seen corresponding path program 1 times [2022-04-08 04:56:16,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:56:16,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [59671942] [2022-04-08 04:56:16,975 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 04:56:16,975 INFO L85 PathProgramCache]: Analyzing trace with hash -96361696, now seen corresponding path program 2 times [2022-04-08 04:56:16,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:56:16,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571527345] [2022-04-08 04:56:16,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:56:16,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:56:16,994 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 04:56:16,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [310358423] [2022-04-08 04:56:16,995 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 04:56:16,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:56:16,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:56:16,999 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 04:56:17,001 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-08 04:56:17,041 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 04:56:17,041 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 04:56:17,043 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-08 04:56:17,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:56:17,073 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:56:17,222 INFO L272 TraceCheckUtils]: 0: Hoare triple {332#true} call ULTIMATE.init(); {332#true} is VALID [2022-04-08 04:56:17,223 INFO L290 TraceCheckUtils]: 1: Hoare triple {332#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {340#(<= ~counter~0 0)} is VALID [2022-04-08 04:56:17,223 INFO L290 TraceCheckUtils]: 2: Hoare triple {340#(<= ~counter~0 0)} assume true; {340#(<= ~counter~0 0)} is VALID [2022-04-08 04:56:17,224 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {340#(<= ~counter~0 0)} {332#true} #102#return; {340#(<= ~counter~0 0)} is VALID [2022-04-08 04:56:17,224 INFO L272 TraceCheckUtils]: 4: Hoare triple {340#(<= ~counter~0 0)} call #t~ret7 := main(); {340#(<= ~counter~0 0)} is VALID [2022-04-08 04:56:17,225 INFO L290 TraceCheckUtils]: 5: Hoare triple {340#(<= ~counter~0 0)} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {340#(<= ~counter~0 0)} is VALID [2022-04-08 04:56:17,225 INFO L272 TraceCheckUtils]: 6: Hoare triple {340#(<= ~counter~0 0)} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {340#(<= ~counter~0 0)} is VALID [2022-04-08 04:56:17,225 INFO L290 TraceCheckUtils]: 7: Hoare triple {340#(<= ~counter~0 0)} ~cond := #in~cond; {340#(<= ~counter~0 0)} is VALID [2022-04-08 04:56:17,226 INFO L290 TraceCheckUtils]: 8: Hoare triple {340#(<= ~counter~0 0)} assume !(0 == ~cond); {340#(<= ~counter~0 0)} is VALID [2022-04-08 04:56:17,226 INFO L290 TraceCheckUtils]: 9: Hoare triple {340#(<= ~counter~0 0)} assume true; {340#(<= ~counter~0 0)} is VALID [2022-04-08 04:56:17,227 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {340#(<= ~counter~0 0)} {340#(<= ~counter~0 0)} #82#return; {340#(<= ~counter~0 0)} is VALID [2022-04-08 04:56:17,227 INFO L290 TraceCheckUtils]: 11: Hoare triple {340#(<= ~counter~0 0)} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {340#(<= ~counter~0 0)} is VALID [2022-04-08 04:56:17,228 INFO L290 TraceCheckUtils]: 12: Hoare triple {340#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {374#(<= |main_#t~post5| 0)} is VALID [2022-04-08 04:56:17,229 INFO L290 TraceCheckUtils]: 13: Hoare triple {374#(<= |main_#t~post5| 0)} assume !(#t~post5 < 10);havoc #t~post5; {333#false} is VALID [2022-04-08 04:56:17,229 INFO L290 TraceCheckUtils]: 14: Hoare triple {333#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {333#false} is VALID [2022-04-08 04:56:17,229 INFO L290 TraceCheckUtils]: 15: Hoare triple {333#false} assume !(#t~post6 < 10);havoc #t~post6; {333#false} is VALID [2022-04-08 04:56:17,229 INFO L272 TraceCheckUtils]: 16: Hoare triple {333#false} call __VERIFIER_assert((if 0 == (~h~0 * ~h~0 * ~h~0 - 12 * ~h~0 * ~n~0 + 16 * ~n~0 * ~p~0 + 12 * ~h~0 * ~r~0 - 16 * ~p~0 * ~r~0 - ~h~0 - 4 * ~p~0) % 4294967296 then 1 else 0)); {333#false} is VALID [2022-04-08 04:56:17,229 INFO L290 TraceCheckUtils]: 17: Hoare triple {333#false} ~cond := #in~cond; {333#false} is VALID [2022-04-08 04:56:17,230 INFO L290 TraceCheckUtils]: 18: Hoare triple {333#false} assume 0 == ~cond; {333#false} is VALID [2022-04-08 04:56:17,230 INFO L290 TraceCheckUtils]: 19: Hoare triple {333#false} assume !false; {333#false} is VALID [2022-04-08 04:56:17,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 04:56:17,231 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 04:56:17,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:56:17,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571527345] [2022-04-08 04:56:17,232 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 04:56:17,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [310358423] [2022-04-08 04:56:17,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [310358423] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:56:17,232 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:56:17,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 04:56:17,233 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:56:17,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [59671942] [2022-04-08 04:56:17,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [59671942] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:56:17,233 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:56:17,233 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 04:56:17,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601850652] [2022-04-08 04:56:17,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:56:17,235 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-08 04:56:17,235 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:56:17,236 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 04:56:17,253 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:56:17,253 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 04:56:17,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:56:17,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 04:56:17,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 04:56:17,255 INFO L87 Difference]: Start difference. First operand 34 states and 46 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 04:56:20,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:56:20,512 INFO L93 Difference]: Finished difference Result 55 states and 78 transitions. [2022-04-08 04:56:20,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 04:56:20,513 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-08 04:56:20,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:56:20,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 04:56:20,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2022-04-08 04:56:20,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 04:56:20,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2022-04-08 04:56:20,518 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 78 transitions. [2022-04-08 04:56:20,589 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:56:20,591 INFO L225 Difference]: With dead ends: 55 [2022-04-08 04:56:20,591 INFO L226 Difference]: Without dead ends: 36 [2022-04-08 04:56:20,592 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 04:56:20,592 INFO L913 BasicCegarLoop]: 44 mSDtfsCounter, 0 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 04:56:20,593 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 119 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 04:56:20,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-08 04:56:20,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-04-08 04:56:20,602 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:56:20,603 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 36 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 04:56:20,603 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 36 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 04:56:20,604 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 36 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 04:56:20,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:56:20,606 INFO L93 Difference]: Finished difference Result 36 states and 48 transitions. [2022-04-08 04:56:20,606 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 48 transitions. [2022-04-08 04:56:20,606 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:56:20,606 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:56:20,607 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 36 states. [2022-04-08 04:56:20,607 INFO L87 Difference]: Start difference. First operand has 36 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 36 states. [2022-04-08 04:56:20,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:56:20,609 INFO L93 Difference]: Finished difference Result 36 states and 48 transitions. [2022-04-08 04:56:20,609 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 48 transitions. [2022-04-08 04:56:20,610 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:56:20,610 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:56:20,610 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:56:20,610 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:56:20,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 04:56:20,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 48 transitions. [2022-04-08 04:56:20,612 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 48 transitions. Word has length 20 [2022-04-08 04:56:20,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:56:20,612 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 48 transitions. [2022-04-08 04:56:20,612 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 04:56:20,613 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 48 transitions. [2022-04-08 04:56:20,651 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:56:20,651 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 48 transitions. [2022-04-08 04:56:20,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-08 04:56:20,652 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:56:20,652 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:56:20,673 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-08 04:56:20,868 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:56:20,869 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:56:20,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:56:20,869 INFO L85 PathProgramCache]: Analyzing trace with hash 962099791, now seen corresponding path program 1 times [2022-04-08 04:56:20,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:56:20,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [709961666] [2022-04-08 04:56:20,870 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 04:56:20,870 INFO L85 PathProgramCache]: Analyzing trace with hash 962099791, now seen corresponding path program 2 times [2022-04-08 04:56:20,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:56:20,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116213252] [2022-04-08 04:56:20,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:56:20,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:56:20,882 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 04:56:20,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1461819271] [2022-04-08 04:56:20,882 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 04:56:20,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:56:20,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:56:20,883 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 04:56:20,885 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-08 04:56:20,918 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 04:56:20,918 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 04:56:20,919 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 04:56:20,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:56:20,929 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:56:21,061 INFO L272 TraceCheckUtils]: 0: Hoare triple {649#true} call ULTIMATE.init(); {649#true} is VALID [2022-04-08 04:56:21,062 INFO L290 TraceCheckUtils]: 1: Hoare triple {649#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {657#(<= ~counter~0 0)} is VALID [2022-04-08 04:56:21,062 INFO L290 TraceCheckUtils]: 2: Hoare triple {657#(<= ~counter~0 0)} assume true; {657#(<= ~counter~0 0)} is VALID [2022-04-08 04:56:21,063 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {657#(<= ~counter~0 0)} {649#true} #102#return; {657#(<= ~counter~0 0)} is VALID [2022-04-08 04:56:21,066 INFO L272 TraceCheckUtils]: 4: Hoare triple {657#(<= ~counter~0 0)} call #t~ret7 := main(); {657#(<= ~counter~0 0)} is VALID [2022-04-08 04:56:21,066 INFO L290 TraceCheckUtils]: 5: Hoare triple {657#(<= ~counter~0 0)} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {657#(<= ~counter~0 0)} is VALID [2022-04-08 04:56:21,067 INFO L272 TraceCheckUtils]: 6: Hoare triple {657#(<= ~counter~0 0)} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {657#(<= ~counter~0 0)} is VALID [2022-04-08 04:56:21,067 INFO L290 TraceCheckUtils]: 7: Hoare triple {657#(<= ~counter~0 0)} ~cond := #in~cond; {657#(<= ~counter~0 0)} is VALID [2022-04-08 04:56:21,068 INFO L290 TraceCheckUtils]: 8: Hoare triple {657#(<= ~counter~0 0)} assume !(0 == ~cond); {657#(<= ~counter~0 0)} is VALID [2022-04-08 04:56:21,068 INFO L290 TraceCheckUtils]: 9: Hoare triple {657#(<= ~counter~0 0)} assume true; {657#(<= ~counter~0 0)} is VALID [2022-04-08 04:56:21,070 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {657#(<= ~counter~0 0)} {657#(<= ~counter~0 0)} #82#return; {657#(<= ~counter~0 0)} is VALID [2022-04-08 04:56:21,071 INFO L290 TraceCheckUtils]: 11: Hoare triple {657#(<= ~counter~0 0)} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {657#(<= ~counter~0 0)} is VALID [2022-04-08 04:56:21,071 INFO L290 TraceCheckUtils]: 12: Hoare triple {657#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {691#(<= ~counter~0 1)} is VALID [2022-04-08 04:56:21,072 INFO L290 TraceCheckUtils]: 13: Hoare triple {691#(<= ~counter~0 1)} assume !!(#t~post5 < 10);havoc #t~post5; {691#(<= ~counter~0 1)} is VALID [2022-04-08 04:56:21,072 INFO L290 TraceCheckUtils]: 14: Hoare triple {691#(<= ~counter~0 1)} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {691#(<= ~counter~0 1)} is VALID [2022-04-08 04:56:21,072 INFO L290 TraceCheckUtils]: 15: Hoare triple {691#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {701#(<= |main_#t~post6| 1)} is VALID [2022-04-08 04:56:21,073 INFO L290 TraceCheckUtils]: 16: Hoare triple {701#(<= |main_#t~post6| 1)} assume !(#t~post6 < 10);havoc #t~post6; {650#false} is VALID [2022-04-08 04:56:21,073 INFO L272 TraceCheckUtils]: 17: Hoare triple {650#false} call __VERIFIER_assert((if 0 == (~h~0 * ~h~0 * ~h~0 - 12 * ~h~0 * ~n~0 + 16 * ~n~0 * ~p~0 + 12 * ~h~0 * ~r~0 - 16 * ~p~0 * ~r~0 - ~h~0 - 4 * ~p~0) % 4294967296 then 1 else 0)); {650#false} is VALID [2022-04-08 04:56:21,073 INFO L290 TraceCheckUtils]: 18: Hoare triple {650#false} ~cond := #in~cond; {650#false} is VALID [2022-04-08 04:56:21,073 INFO L290 TraceCheckUtils]: 19: Hoare triple {650#false} assume 0 == ~cond; {650#false} is VALID [2022-04-08 04:56:21,073 INFO L290 TraceCheckUtils]: 20: Hoare triple {650#false} assume !false; {650#false} is VALID [2022-04-08 04:56:21,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 04:56:21,074 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 04:56:21,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:56:21,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116213252] [2022-04-08 04:56:21,074 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 04:56:21,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1461819271] [2022-04-08 04:56:21,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1461819271] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:56:21,074 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:56:21,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 04:56:21,075 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:56:21,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [709961666] [2022-04-08 04:56:21,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [709961666] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:56:21,075 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:56:21,075 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 04:56:21,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643211062] [2022-04-08 04:56:21,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:56:21,076 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2022-04-08 04:56:21,076 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:56:21,076 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 04:56:21,093 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:56:21,093 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 04:56:21,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:56:21,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 04:56:21,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-08 04:56:21,094 INFO L87 Difference]: Start difference. First operand 36 states and 48 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 04:56:29,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:56:29,337 INFO L93 Difference]: Finished difference Result 49 states and 64 transitions. [2022-04-08 04:56:29,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 04:56:29,337 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2022-04-08 04:56:29,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:56:29,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 04:56:29,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-08 04:56:29,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 04:56:29,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-08 04:56:29,341 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 64 transitions. [2022-04-08 04:56:29,388 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:56:29,390 INFO L225 Difference]: With dead ends: 49 [2022-04-08 04:56:29,390 INFO L226 Difference]: Without dead ends: 40 [2022-04-08 04:56:29,390 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-08 04:56:29,391 INFO L913 BasicCegarLoop]: 43 mSDtfsCounter, 7 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 04:56:29,391 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 149 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 04:56:29,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-08 04:56:29,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2022-04-08 04:56:29,403 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:56:29,403 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand has 39 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 04:56:29,404 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand has 39 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 04:56:29,404 INFO L87 Difference]: Start difference. First operand 40 states. Second operand has 39 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 04:56:29,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:56:29,406 INFO L93 Difference]: Finished difference Result 40 states and 53 transitions. [2022-04-08 04:56:29,406 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 53 transitions. [2022-04-08 04:56:29,406 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:56:29,406 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:56:29,407 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 40 states. [2022-04-08 04:56:29,407 INFO L87 Difference]: Start difference. First operand has 39 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 40 states. [2022-04-08 04:56:29,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:56:29,409 INFO L93 Difference]: Finished difference Result 40 states and 53 transitions. [2022-04-08 04:56:29,409 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 53 transitions. [2022-04-08 04:56:29,409 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:56:29,409 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:56:29,409 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:56:29,409 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:56:29,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 04:56:29,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 52 transitions. [2022-04-08 04:56:29,411 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 52 transitions. Word has length 21 [2022-04-08 04:56:29,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:56:29,411 INFO L478 AbstractCegarLoop]: Abstraction has 39 states and 52 transitions. [2022-04-08 04:56:29,411 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 04:56:29,412 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 52 transitions. [2022-04-08 04:56:29,455 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:56:29,455 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 52 transitions. [2022-04-08 04:56:29,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-08 04:56:29,455 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:56:29,456 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:56:29,472 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-08 04:56:29,671 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-08 04:56:29,672 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:56:29,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:56:29,672 INFO L85 PathProgramCache]: Analyzing trace with hash 963589341, now seen corresponding path program 1 times [2022-04-08 04:56:29,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:56:29,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2121016719] [2022-04-08 04:56:29,673 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 04:56:29,673 INFO L85 PathProgramCache]: Analyzing trace with hash 963589341, now seen corresponding path program 2 times [2022-04-08 04:56:29,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:56:29,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234722655] [2022-04-08 04:56:29,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:56:29,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:56:29,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:56:29,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 04:56:29,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:56:29,883 INFO L290 TraceCheckUtils]: 0: Hoare triple {985#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {972#true} is VALID [2022-04-08 04:56:29,883 INFO L290 TraceCheckUtils]: 1: Hoare triple {972#true} assume true; {972#true} is VALID [2022-04-08 04:56:29,883 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {972#true} {972#true} #102#return; {972#true} is VALID [2022-04-08 04:56:29,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-08 04:56:29,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:56:29,888 INFO L290 TraceCheckUtils]: 0: Hoare triple {972#true} ~cond := #in~cond; {972#true} is VALID [2022-04-08 04:56:29,888 INFO L290 TraceCheckUtils]: 1: Hoare triple {972#true} assume !(0 == ~cond); {972#true} is VALID [2022-04-08 04:56:29,888 INFO L290 TraceCheckUtils]: 2: Hoare triple {972#true} assume true; {972#true} is VALID [2022-04-08 04:56:29,888 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {972#true} {972#true} #82#return; {972#true} is VALID [2022-04-08 04:56:29,889 INFO L272 TraceCheckUtils]: 0: Hoare triple {972#true} call ULTIMATE.init(); {985#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 04:56:29,889 INFO L290 TraceCheckUtils]: 1: Hoare triple {985#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {972#true} is VALID [2022-04-08 04:56:29,889 INFO L290 TraceCheckUtils]: 2: Hoare triple {972#true} assume true; {972#true} is VALID [2022-04-08 04:56:29,889 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {972#true} {972#true} #102#return; {972#true} is VALID [2022-04-08 04:56:29,889 INFO L272 TraceCheckUtils]: 4: Hoare triple {972#true} call #t~ret7 := main(); {972#true} is VALID [2022-04-08 04:56:29,889 INFO L290 TraceCheckUtils]: 5: Hoare triple {972#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {972#true} is VALID [2022-04-08 04:56:29,889 INFO L272 TraceCheckUtils]: 6: Hoare triple {972#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {972#true} is VALID [2022-04-08 04:56:29,890 INFO L290 TraceCheckUtils]: 7: Hoare triple {972#true} ~cond := #in~cond; {972#true} is VALID [2022-04-08 04:56:29,890 INFO L290 TraceCheckUtils]: 8: Hoare triple {972#true} assume !(0 == ~cond); {972#true} is VALID [2022-04-08 04:56:29,890 INFO L290 TraceCheckUtils]: 9: Hoare triple {972#true} assume true; {972#true} is VALID [2022-04-08 04:56:29,890 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {972#true} {972#true} #82#return; {972#true} is VALID [2022-04-08 04:56:29,892 INFO L290 TraceCheckUtils]: 11: Hoare triple {972#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {981#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} is VALID [2022-04-08 04:56:29,893 INFO L290 TraceCheckUtils]: 12: Hoare triple {981#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {981#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} is VALID [2022-04-08 04:56:29,893 INFO L290 TraceCheckUtils]: 13: Hoare triple {981#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} assume !!(#t~post5 < 10);havoc #t~post5; {981#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} is VALID [2022-04-08 04:56:29,894 INFO L290 TraceCheckUtils]: 14: Hoare triple {981#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {982#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0))} is VALID [2022-04-08 04:56:29,894 INFO L290 TraceCheckUtils]: 15: Hoare triple {982#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {982#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0))} is VALID [2022-04-08 04:56:29,895 INFO L290 TraceCheckUtils]: 16: Hoare triple {982#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0))} assume !!(#t~post6 < 10);havoc #t~post6; {982#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0))} is VALID [2022-04-08 04:56:29,896 INFO L272 TraceCheckUtils]: 17: Hoare triple {982#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0))} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {983#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 04:56:29,896 INFO L290 TraceCheckUtils]: 18: Hoare triple {983#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {984#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 04:56:29,896 INFO L290 TraceCheckUtils]: 19: Hoare triple {984#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {973#false} is VALID [2022-04-08 04:56:29,897 INFO L290 TraceCheckUtils]: 20: Hoare triple {973#false} assume !false; {973#false} is VALID [2022-04-08 04:56:29,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 04:56:29,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:56:29,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234722655] [2022-04-08 04:56:29,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234722655] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:56:29,897 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:56:29,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 04:56:29,897 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:56:29,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2121016719] [2022-04-08 04:56:29,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2121016719] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:56:29,898 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:56:29,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 04:56:29,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759798991] [2022-04-08 04:56:29,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:56:29,898 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2022-04-08 04:56:29,898 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:56:29,898 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 04:56:29,912 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:56:29,912 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 04:56:29,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:56:29,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 04:56:29,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-08 04:56:29,913 INFO L87 Difference]: Start difference. First operand 39 states and 52 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 04:56:37,543 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 04:56:40,419 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 04:56:44,339 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 04:56:47,216 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 04:56:49,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:56:49,796 INFO L93 Difference]: Finished difference Result 72 states and 104 transitions. [2022-04-08 04:56:49,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 04:56:49,797 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2022-04-08 04:56:49,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:56:49,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 04:56:49,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 104 transitions. [2022-04-08 04:56:49,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 04:56:49,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 104 transitions. [2022-04-08 04:56:49,801 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 104 transitions. [2022-04-08 04:56:49,982 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:56:49,983 INFO L225 Difference]: With dead ends: 72 [2022-04-08 04:56:49,983 INFO L226 Difference]: Without dead ends: 51 [2022-04-08 04:56:49,984 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-04-08 04:56:49,985 INFO L913 BasicCegarLoop]: 49 mSDtfsCounter, 24 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 37 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.8s IncrementalHoareTripleChecker+Time [2022-04-08 04:56:49,985 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 107 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 206 Invalid, 3 Unknown, 0 Unchecked, 14.8s Time] [2022-04-08 04:56:49,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-08 04:56:50,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-04-08 04:56:50,005 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:56:50,006 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 51 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 29 states have internal predecessors, (34), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 04:56:50,006 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 51 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 29 states have internal predecessors, (34), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 04:56:50,007 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 51 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 29 states have internal predecessors, (34), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 04:56:50,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:56:50,009 INFO L93 Difference]: Finished difference Result 51 states and 69 transitions. [2022-04-08 04:56:50,010 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 69 transitions. [2022-04-08 04:56:50,010 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:56:50,010 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:56:50,011 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 29 states have internal predecessors, (34), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 51 states. [2022-04-08 04:56:50,011 INFO L87 Difference]: Start difference. First operand has 51 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 29 states have internal predecessors, (34), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 51 states. [2022-04-08 04:56:50,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:56:50,014 INFO L93 Difference]: Finished difference Result 51 states and 69 transitions. [2022-04-08 04:56:50,014 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 69 transitions. [2022-04-08 04:56:50,014 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:56:50,015 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:56:50,015 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:56:50,015 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:56:50,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 29 states have internal predecessors, (34), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 04:56:50,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 69 transitions. [2022-04-08 04:56:50,017 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 69 transitions. Word has length 21 [2022-04-08 04:56:50,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:56:50,018 INFO L478 AbstractCegarLoop]: Abstraction has 51 states and 69 transitions. [2022-04-08 04:56:50,018 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 04:56:50,018 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 69 transitions. [2022-04-08 04:56:50,150 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:56:50,151 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 69 transitions. [2022-04-08 04:56:50,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-08 04:56:50,151 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:56:50,151 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:56:50,152 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-08 04:56:50,152 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:56:50,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:56:50,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1701877900, now seen corresponding path program 1 times [2022-04-08 04:56:50,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:56:50,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1403290851] [2022-04-08 04:56:50,173 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 04:56:50,173 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-08 04:56:50,173 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 04:56:50,173 INFO L85 PathProgramCache]: Analyzing trace with hash -1701877900, now seen corresponding path program 2 times [2022-04-08 04:56:50,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:56:50,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044023557] [2022-04-08 04:56:50,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:56:50,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:56:50,183 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 04:56:50,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2052721757] [2022-04-08 04:56:50,184 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 04:56:50,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:56:50,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:56:50,184 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 04:56:50,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-08 04:56:50,219 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 04:56:50,220 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 04:56:50,220 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 04:56:50,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:56:50,229 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:56:50,339 INFO L272 TraceCheckUtils]: 0: Hoare triple {1346#true} call ULTIMATE.init(); {1346#true} is VALID [2022-04-08 04:56:50,339 INFO L290 TraceCheckUtils]: 1: Hoare triple {1346#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1346#true} is VALID [2022-04-08 04:56:50,339 INFO L290 TraceCheckUtils]: 2: Hoare triple {1346#true} assume true; {1346#true} is VALID [2022-04-08 04:56:50,339 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1346#true} {1346#true} #102#return; {1346#true} is VALID [2022-04-08 04:56:50,339 INFO L272 TraceCheckUtils]: 4: Hoare triple {1346#true} call #t~ret7 := main(); {1346#true} is VALID [2022-04-08 04:56:50,339 INFO L290 TraceCheckUtils]: 5: Hoare triple {1346#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {1346#true} is VALID [2022-04-08 04:56:50,339 INFO L272 TraceCheckUtils]: 6: Hoare triple {1346#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {1346#true} is VALID [2022-04-08 04:56:50,340 INFO L290 TraceCheckUtils]: 7: Hoare triple {1346#true} ~cond := #in~cond; {1346#true} is VALID [2022-04-08 04:56:50,340 INFO L290 TraceCheckUtils]: 8: Hoare triple {1346#true} assume !(0 == ~cond); {1346#true} is VALID [2022-04-08 04:56:50,340 INFO L290 TraceCheckUtils]: 9: Hoare triple {1346#true} assume true; {1346#true} is VALID [2022-04-08 04:56:50,340 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1346#true} {1346#true} #82#return; {1346#true} is VALID [2022-04-08 04:56:50,340 INFO L290 TraceCheckUtils]: 11: Hoare triple {1346#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {1384#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-08 04:56:50,341 INFO L290 TraceCheckUtils]: 12: Hoare triple {1384#(and (= main_~p~0 0) (= main_~h~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1384#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-08 04:56:50,341 INFO L290 TraceCheckUtils]: 13: Hoare triple {1384#(and (= main_~p~0 0) (= main_~h~0 0))} assume !!(#t~post5 < 10);havoc #t~post5; {1384#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-08 04:56:50,342 INFO L290 TraceCheckUtils]: 14: Hoare triple {1384#(and (= main_~p~0 0) (= main_~h~0 0))} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {1384#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-08 04:56:50,342 INFO L290 TraceCheckUtils]: 15: Hoare triple {1384#(and (= main_~p~0 0) (= main_~h~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1384#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-08 04:56:50,343 INFO L290 TraceCheckUtils]: 16: Hoare triple {1384#(and (= main_~p~0 0) (= main_~h~0 0))} assume !(#t~post5 < 10);havoc #t~post5; {1384#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-08 04:56:50,343 INFO L290 TraceCheckUtils]: 17: Hoare triple {1384#(and (= main_~p~0 0) (= main_~h~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1384#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-08 04:56:50,343 INFO L290 TraceCheckUtils]: 18: Hoare triple {1384#(and (= main_~p~0 0) (= main_~h~0 0))} assume !(#t~post6 < 10);havoc #t~post6; {1384#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-08 04:56:50,344 INFO L272 TraceCheckUtils]: 19: Hoare triple {1384#(and (= main_~p~0 0) (= main_~h~0 0))} call __VERIFIER_assert((if 0 == (~h~0 * ~h~0 * ~h~0 - 12 * ~h~0 * ~n~0 + 16 * ~n~0 * ~p~0 + 12 * ~h~0 * ~r~0 - 16 * ~p~0 * ~r~0 - ~h~0 - 4 * ~p~0) % 4294967296 then 1 else 0)); {1409#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 04:56:50,345 INFO L290 TraceCheckUtils]: 20: Hoare triple {1409#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1413#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:56:50,345 INFO L290 TraceCheckUtils]: 21: Hoare triple {1413#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1347#false} is VALID [2022-04-08 04:56:50,345 INFO L290 TraceCheckUtils]: 22: Hoare triple {1347#false} assume !false; {1347#false} is VALID [2022-04-08 04:56:50,345 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-08 04:56:50,345 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 04:56:50,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:56:50,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044023557] [2022-04-08 04:56:50,346 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 04:56:50,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2052721757] [2022-04-08 04:56:50,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2052721757] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:56:50,346 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:56:50,346 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 04:56:50,346 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:56:50,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1403290851] [2022-04-08 04:56:50,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1403290851] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:56:50,347 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:56:50,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 04:56:50,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061997078] [2022-04-08 04:56:50,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:56:50,347 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2022-04-08 04:56:50,347 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:56:50,347 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 04:56:50,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-08 04:56:50,371 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 04:56:50,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:56:50,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 04:56:50,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 04:56:50,372 INFO L87 Difference]: Start difference. First operand 51 states and 69 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 04:56:55,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:56:55,643 INFO L93 Difference]: Finished difference Result 73 states and 99 transitions. [2022-04-08 04:56:55,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 04:56:55,643 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2022-04-08 04:56:55,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:56:55,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 04:56:55,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 73 transitions. [2022-04-08 04:56:55,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 04:56:55,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 73 transitions. [2022-04-08 04:56:55,646 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 73 transitions. [2022-04-08 04:56:55,713 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:56:55,714 INFO L225 Difference]: With dead ends: 73 [2022-04-08 04:56:55,714 INFO L226 Difference]: Without dead ends: 52 [2022-04-08 04:56:55,715 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 04:56:55,715 INFO L913 BasicCegarLoop]: 51 mSDtfsCounter, 8 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-08 04:56:55,715 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 157 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-08 04:56:55,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-08 04:56:55,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-04-08 04:56:55,745 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:56:55,747 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 52 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 29 states have internal predecessors, (35), 20 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-08 04:56:55,747 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 52 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 29 states have internal predecessors, (35), 20 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-08 04:56:55,748 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 52 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 29 states have internal predecessors, (35), 20 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-08 04:56:55,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:56:55,751 INFO L93 Difference]: Finished difference Result 52 states and 72 transitions. [2022-04-08 04:56:55,751 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 72 transitions. [2022-04-08 04:56:55,751 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:56:55,751 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:56:55,752 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 29 states have internal predecessors, (35), 20 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 52 states. [2022-04-08 04:56:55,752 INFO L87 Difference]: Start difference. First operand has 52 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 29 states have internal predecessors, (35), 20 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 52 states. [2022-04-08 04:56:55,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:56:55,758 INFO L93 Difference]: Finished difference Result 52 states and 72 transitions. [2022-04-08 04:56:55,758 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 72 transitions. [2022-04-08 04:56:55,758 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:56:55,759 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:56:55,759 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:56:55,759 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:56:55,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 29 states have internal predecessors, (35), 20 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-08 04:56:55,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 72 transitions. [2022-04-08 04:56:55,761 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 72 transitions. Word has length 23 [2022-04-08 04:56:55,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:56:55,761 INFO L478 AbstractCegarLoop]: Abstraction has 52 states and 72 transitions. [2022-04-08 04:56:55,761 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 04:56:55,761 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 72 transitions. [2022-04-08 04:56:55,832 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:56:55,832 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 72 transitions. [2022-04-08 04:56:55,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-08 04:56:55,833 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:56:55,833 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:56:55,849 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-08 04:56:56,043 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:56:56,044 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:56:56,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:56:56,044 INFO L85 PathProgramCache]: Analyzing trace with hash -1700388350, now seen corresponding path program 1 times [2022-04-08 04:56:56,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:56:56,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1106061232] [2022-04-08 04:56:56,050 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 04:56:56,050 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-08 04:56:56,050 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 04:56:56,050 INFO L85 PathProgramCache]: Analyzing trace with hash -1700388350, now seen corresponding path program 2 times [2022-04-08 04:56:56,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:56:56,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180398174] [2022-04-08 04:56:56,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:56:56,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:56:56,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:56:56,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 04:56:56,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:56:56,138 INFO L290 TraceCheckUtils]: 0: Hoare triple {1787#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1780#(<= ~counter~0 0)} is VALID [2022-04-08 04:56:56,139 INFO L290 TraceCheckUtils]: 1: Hoare triple {1780#(<= ~counter~0 0)} assume true; {1780#(<= ~counter~0 0)} is VALID [2022-04-08 04:56:56,139 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1780#(<= ~counter~0 0)} {1775#true} #102#return; {1780#(<= ~counter~0 0)} is VALID [2022-04-08 04:56:56,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-08 04:56:56,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:56:56,143 INFO L290 TraceCheckUtils]: 0: Hoare triple {1775#true} ~cond := #in~cond; {1775#true} is VALID [2022-04-08 04:56:56,143 INFO L290 TraceCheckUtils]: 1: Hoare triple {1775#true} assume !(0 == ~cond); {1775#true} is VALID [2022-04-08 04:56:56,143 INFO L290 TraceCheckUtils]: 2: Hoare triple {1775#true} assume true; {1775#true} is VALID [2022-04-08 04:56:56,144 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1775#true} {1780#(<= ~counter~0 0)} #82#return; {1780#(<= ~counter~0 0)} is VALID [2022-04-08 04:56:56,145 INFO L272 TraceCheckUtils]: 0: Hoare triple {1775#true} call ULTIMATE.init(); {1787#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 04:56:56,145 INFO L290 TraceCheckUtils]: 1: Hoare triple {1787#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1780#(<= ~counter~0 0)} is VALID [2022-04-08 04:56:56,145 INFO L290 TraceCheckUtils]: 2: Hoare triple {1780#(<= ~counter~0 0)} assume true; {1780#(<= ~counter~0 0)} is VALID [2022-04-08 04:56:56,146 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1780#(<= ~counter~0 0)} {1775#true} #102#return; {1780#(<= ~counter~0 0)} is VALID [2022-04-08 04:56:56,146 INFO L272 TraceCheckUtils]: 4: Hoare triple {1780#(<= ~counter~0 0)} call #t~ret7 := main(); {1780#(<= ~counter~0 0)} is VALID [2022-04-08 04:56:56,146 INFO L290 TraceCheckUtils]: 5: Hoare triple {1780#(<= ~counter~0 0)} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {1780#(<= ~counter~0 0)} is VALID [2022-04-08 04:56:56,146 INFO L272 TraceCheckUtils]: 6: Hoare triple {1780#(<= ~counter~0 0)} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {1775#true} is VALID [2022-04-08 04:56:56,147 INFO L290 TraceCheckUtils]: 7: Hoare triple {1775#true} ~cond := #in~cond; {1775#true} is VALID [2022-04-08 04:56:56,147 INFO L290 TraceCheckUtils]: 8: Hoare triple {1775#true} assume !(0 == ~cond); {1775#true} is VALID [2022-04-08 04:56:56,147 INFO L290 TraceCheckUtils]: 9: Hoare triple {1775#true} assume true; {1775#true} is VALID [2022-04-08 04:56:56,147 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1775#true} {1780#(<= ~counter~0 0)} #82#return; {1780#(<= ~counter~0 0)} is VALID [2022-04-08 04:56:56,148 INFO L290 TraceCheckUtils]: 11: Hoare triple {1780#(<= ~counter~0 0)} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {1780#(<= ~counter~0 0)} is VALID [2022-04-08 04:56:56,148 INFO L290 TraceCheckUtils]: 12: Hoare triple {1780#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1785#(<= ~counter~0 1)} is VALID [2022-04-08 04:56:56,148 INFO L290 TraceCheckUtils]: 13: Hoare triple {1785#(<= ~counter~0 1)} assume !!(#t~post5 < 10);havoc #t~post5; {1785#(<= ~counter~0 1)} is VALID [2022-04-08 04:56:56,149 INFO L290 TraceCheckUtils]: 14: Hoare triple {1785#(<= ~counter~0 1)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {1785#(<= ~counter~0 1)} is VALID [2022-04-08 04:56:56,149 INFO L290 TraceCheckUtils]: 15: Hoare triple {1785#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1786#(<= |main_#t~post5| 1)} is VALID [2022-04-08 04:56:56,149 INFO L290 TraceCheckUtils]: 16: Hoare triple {1786#(<= |main_#t~post5| 1)} assume !(#t~post5 < 10);havoc #t~post5; {1776#false} is VALID [2022-04-08 04:56:56,149 INFO L290 TraceCheckUtils]: 17: Hoare triple {1776#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1776#false} is VALID [2022-04-08 04:56:56,150 INFO L290 TraceCheckUtils]: 18: Hoare triple {1776#false} assume !!(#t~post6 < 10);havoc #t~post6; {1776#false} is VALID [2022-04-08 04:56:56,150 INFO L272 TraceCheckUtils]: 19: Hoare triple {1776#false} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {1776#false} is VALID [2022-04-08 04:56:56,150 INFO L290 TraceCheckUtils]: 20: Hoare triple {1776#false} ~cond := #in~cond; {1776#false} is VALID [2022-04-08 04:56:56,150 INFO L290 TraceCheckUtils]: 21: Hoare triple {1776#false} assume 0 == ~cond; {1776#false} is VALID [2022-04-08 04:56:56,150 INFO L290 TraceCheckUtils]: 22: Hoare triple {1776#false} assume !false; {1776#false} is VALID [2022-04-08 04:56:56,150 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 04:56:56,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:56:56,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180398174] [2022-04-08 04:56:56,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180398174] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 04:56:56,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1268685087] [2022-04-08 04:56:56,151 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 04:56:56,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:56:56,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:56:56,152 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 04:56:56,153 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-08 04:56:56,181 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 04:56:56,181 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 04:56:56,182 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-08 04:56:56,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:56:56,188 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:56:56,259 INFO L272 TraceCheckUtils]: 0: Hoare triple {1775#true} call ULTIMATE.init(); {1775#true} is VALID [2022-04-08 04:56:56,259 INFO L290 TraceCheckUtils]: 1: Hoare triple {1775#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1775#true} is VALID [2022-04-08 04:56:56,259 INFO L290 TraceCheckUtils]: 2: Hoare triple {1775#true} assume true; {1775#true} is VALID [2022-04-08 04:56:56,260 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1775#true} {1775#true} #102#return; {1775#true} is VALID [2022-04-08 04:56:56,260 INFO L272 TraceCheckUtils]: 4: Hoare triple {1775#true} call #t~ret7 := main(); {1775#true} is VALID [2022-04-08 04:56:56,260 INFO L290 TraceCheckUtils]: 5: Hoare triple {1775#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {1775#true} is VALID [2022-04-08 04:56:56,260 INFO L272 TraceCheckUtils]: 6: Hoare triple {1775#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {1775#true} is VALID [2022-04-08 04:56:56,261 INFO L290 TraceCheckUtils]: 7: Hoare triple {1775#true} ~cond := #in~cond; {1775#true} is VALID [2022-04-08 04:56:56,261 INFO L290 TraceCheckUtils]: 8: Hoare triple {1775#true} assume !(0 == ~cond); {1775#true} is VALID [2022-04-08 04:56:56,261 INFO L290 TraceCheckUtils]: 9: Hoare triple {1775#true} assume true; {1775#true} is VALID [2022-04-08 04:56:56,262 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1775#true} {1775#true} #82#return; {1775#true} is VALID [2022-04-08 04:56:56,262 INFO L290 TraceCheckUtils]: 11: Hoare triple {1775#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {1775#true} is VALID [2022-04-08 04:56:56,262 INFO L290 TraceCheckUtils]: 12: Hoare triple {1775#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1775#true} is VALID [2022-04-08 04:56:56,262 INFO L290 TraceCheckUtils]: 13: Hoare triple {1775#true} assume !!(#t~post5 < 10);havoc #t~post5; {1775#true} is VALID [2022-04-08 04:56:56,262 INFO L290 TraceCheckUtils]: 14: Hoare triple {1775#true} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {1775#true} is VALID [2022-04-08 04:56:56,263 INFO L290 TraceCheckUtils]: 15: Hoare triple {1775#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1836#(<= (+ |main_#t~post5| 1) ~counter~0)} is VALID [2022-04-08 04:56:56,263 INFO L290 TraceCheckUtils]: 16: Hoare triple {1836#(<= (+ |main_#t~post5| 1) ~counter~0)} assume !(#t~post5 < 10);havoc #t~post5; {1840#(<= 11 ~counter~0)} is VALID [2022-04-08 04:56:56,264 INFO L290 TraceCheckUtils]: 17: Hoare triple {1840#(<= 11 ~counter~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1844#(<= 11 |main_#t~post6|)} is VALID [2022-04-08 04:56:56,264 INFO L290 TraceCheckUtils]: 18: Hoare triple {1844#(<= 11 |main_#t~post6|)} assume !!(#t~post6 < 10);havoc #t~post6; {1776#false} is VALID [2022-04-08 04:56:56,264 INFO L272 TraceCheckUtils]: 19: Hoare triple {1776#false} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {1776#false} is VALID [2022-04-08 04:56:56,264 INFO L290 TraceCheckUtils]: 20: Hoare triple {1776#false} ~cond := #in~cond; {1776#false} is VALID [2022-04-08 04:56:56,264 INFO L290 TraceCheckUtils]: 21: Hoare triple {1776#false} assume 0 == ~cond; {1776#false} is VALID [2022-04-08 04:56:56,264 INFO L290 TraceCheckUtils]: 22: Hoare triple {1776#false} assume !false; {1776#false} is VALID [2022-04-08 04:56:56,265 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-08 04:56:56,265 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 04:56:56,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1268685087] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:56:56,265 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-08 04:56:56,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2022-04-08 04:56:56,265 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:56:56,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1106061232] [2022-04-08 04:56:56,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1106061232] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:56:56,265 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:56:56,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 04:56:56,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036446009] [2022-04-08 04:56:56,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:56:56,266 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2022-04-08 04:56:56,266 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:56:56,266 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 04:56:56,281 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:56:56,281 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 04:56:56,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:56:56,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 04:56:56,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-04-08 04:56:56,281 INFO L87 Difference]: Start difference. First operand 52 states and 72 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 04:56:58,318 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-08 04:57:04,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:57:04,698 INFO L93 Difference]: Finished difference Result 98 states and 135 transitions. [2022-04-08 04:57:04,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 04:57:04,698 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2022-04-08 04:57:04,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:57:04,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 04:57:04,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 86 transitions. [2022-04-08 04:57:04,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 04:57:04,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 86 transitions. [2022-04-08 04:57:04,701 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 86 transitions. [2022-04-08 04:57:04,765 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:57:04,767 INFO L225 Difference]: With dead ends: 98 [2022-04-08 04:57:04,767 INFO L226 Difference]: Without dead ends: 64 [2022-04-08 04:57:04,767 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-04-08 04:57:04,768 INFO L913 BasicCegarLoop]: 45 mSDtfsCounter, 8 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-04-08 04:57:04,768 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 170 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-04-08 04:57:04,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-04-08 04:57:04,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2022-04-08 04:57:04,795 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:57:04,795 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand has 62 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 36 states have internal predecessors, (42), 22 states have call successors, (22), 7 states have call predecessors, (22), 5 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-08 04:57:04,795 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand has 62 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 36 states have internal predecessors, (42), 22 states have call successors, (22), 7 states have call predecessors, (22), 5 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-08 04:57:04,795 INFO L87 Difference]: Start difference. First operand 64 states. Second operand has 62 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 36 states have internal predecessors, (42), 22 states have call successors, (22), 7 states have call predecessors, (22), 5 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-08 04:57:04,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:57:04,828 INFO L93 Difference]: Finished difference Result 64 states and 83 transitions. [2022-04-08 04:57:04,829 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 83 transitions. [2022-04-08 04:57:04,829 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:57:04,829 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:57:04,830 INFO L74 IsIncluded]: Start isIncluded. First operand has 62 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 36 states have internal predecessors, (42), 22 states have call successors, (22), 7 states have call predecessors, (22), 5 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand 64 states. [2022-04-08 04:57:04,831 INFO L87 Difference]: Start difference. First operand has 62 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 36 states have internal predecessors, (42), 22 states have call successors, (22), 7 states have call predecessors, (22), 5 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand 64 states. [2022-04-08 04:57:04,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:57:04,832 INFO L93 Difference]: Finished difference Result 64 states and 83 transitions. [2022-04-08 04:57:04,833 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 83 transitions. [2022-04-08 04:57:04,833 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:57:04,833 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:57:04,833 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:57:04,833 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:57:04,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 36 states have internal predecessors, (42), 22 states have call successors, (22), 7 states have call predecessors, (22), 5 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-08 04:57:04,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 82 transitions. [2022-04-08 04:57:04,835 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 82 transitions. Word has length 23 [2022-04-08 04:57:04,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:57:04,836 INFO L478 AbstractCegarLoop]: Abstraction has 62 states and 82 transitions. [2022-04-08 04:57:04,836 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 04:57:04,836 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 62 states and 82 transitions. [2022-04-08 04:57:04,916 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:57:04,916 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 82 transitions. [2022-04-08 04:57:04,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-08 04:57:04,917 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:57:04,917 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:57:04,935 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-08 04:57:05,117 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:57:05,117 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:57:05,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:57:05,118 INFO L85 PathProgramCache]: Analyzing trace with hash -1562772727, now seen corresponding path program 1 times [2022-04-08 04:57:05,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:57:05,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2061865682] [2022-04-08 04:57:05,122 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 04:57:05,122 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-08 04:57:05,123 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 04:57:05,123 INFO L85 PathProgramCache]: Analyzing trace with hash -1562772727, now seen corresponding path program 2 times [2022-04-08 04:57:05,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:57:05,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312342241] [2022-04-08 04:57:05,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:57:05,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:57:05,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:57:05,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 04:57:05,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:57:05,279 INFO L290 TraceCheckUtils]: 0: Hoare triple {2323#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2309#true} is VALID [2022-04-08 04:57:05,279 INFO L290 TraceCheckUtils]: 1: Hoare triple {2309#true} assume true; {2309#true} is VALID [2022-04-08 04:57:05,279 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2309#true} {2309#true} #102#return; {2309#true} is VALID [2022-04-08 04:57:05,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-08 04:57:05,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:57:05,283 INFO L290 TraceCheckUtils]: 0: Hoare triple {2309#true} ~cond := #in~cond; {2309#true} is VALID [2022-04-08 04:57:05,283 INFO L290 TraceCheckUtils]: 1: Hoare triple {2309#true} assume !(0 == ~cond); {2309#true} is VALID [2022-04-08 04:57:05,283 INFO L290 TraceCheckUtils]: 2: Hoare triple {2309#true} assume true; {2309#true} is VALID [2022-04-08 04:57:05,283 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2309#true} {2309#true} #82#return; {2309#true} is VALID [2022-04-08 04:57:05,284 INFO L272 TraceCheckUtils]: 0: Hoare triple {2309#true} call ULTIMATE.init(); {2323#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 04:57:05,284 INFO L290 TraceCheckUtils]: 1: Hoare triple {2323#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2309#true} is VALID [2022-04-08 04:57:05,284 INFO L290 TraceCheckUtils]: 2: Hoare triple {2309#true} assume true; {2309#true} is VALID [2022-04-08 04:57:05,285 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2309#true} {2309#true} #102#return; {2309#true} is VALID [2022-04-08 04:57:05,286 INFO L272 TraceCheckUtils]: 4: Hoare triple {2309#true} call #t~ret7 := main(); {2309#true} is VALID [2022-04-08 04:57:05,286 INFO L290 TraceCheckUtils]: 5: Hoare triple {2309#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {2309#true} is VALID [2022-04-08 04:57:05,286 INFO L272 TraceCheckUtils]: 6: Hoare triple {2309#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {2309#true} is VALID [2022-04-08 04:57:05,288 INFO L290 TraceCheckUtils]: 7: Hoare triple {2309#true} ~cond := #in~cond; {2309#true} is VALID [2022-04-08 04:57:05,288 INFO L290 TraceCheckUtils]: 8: Hoare triple {2309#true} assume !(0 == ~cond); {2309#true} is VALID [2022-04-08 04:57:05,288 INFO L290 TraceCheckUtils]: 9: Hoare triple {2309#true} assume true; {2309#true} is VALID [2022-04-08 04:57:05,289 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2309#true} {2309#true} #82#return; {2309#true} is VALID [2022-04-08 04:57:05,289 INFO L290 TraceCheckUtils]: 11: Hoare triple {2309#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {2318#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-08 04:57:05,290 INFO L290 TraceCheckUtils]: 12: Hoare triple {2318#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2318#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-08 04:57:05,290 INFO L290 TraceCheckUtils]: 13: Hoare triple {2318#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} assume !!(#t~post5 < 10);havoc #t~post5; {2318#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-08 04:57:05,291 INFO L290 TraceCheckUtils]: 14: Hoare triple {2318#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {2319#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-08 04:57:05,291 INFO L290 TraceCheckUtils]: 15: Hoare triple {2319#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2319#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-08 04:57:05,292 INFO L290 TraceCheckUtils]: 16: Hoare triple {2319#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} assume !!(#t~post5 < 10);havoc #t~post5; {2319#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-08 04:57:05,292 INFO L290 TraceCheckUtils]: 17: Hoare triple {2319#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {2320#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0))} is VALID [2022-04-08 04:57:05,293 INFO L290 TraceCheckUtils]: 18: Hoare triple {2320#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2320#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0))} is VALID [2022-04-08 04:57:05,293 INFO L290 TraceCheckUtils]: 19: Hoare triple {2320#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0))} assume !!(#t~post6 < 10);havoc #t~post6; {2320#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0))} is VALID [2022-04-08 04:57:05,294 INFO L272 TraceCheckUtils]: 20: Hoare triple {2320#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0))} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {2321#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 04:57:05,294 INFO L290 TraceCheckUtils]: 21: Hoare triple {2321#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {2322#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 04:57:05,298 INFO L290 TraceCheckUtils]: 22: Hoare triple {2322#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {2310#false} is VALID [2022-04-08 04:57:05,298 INFO L290 TraceCheckUtils]: 23: Hoare triple {2310#false} assume !false; {2310#false} is VALID [2022-04-08 04:57:05,298 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 04:57:05,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:57:05,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312342241] [2022-04-08 04:57:05,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312342241] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 04:57:05,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [341131776] [2022-04-08 04:57:05,298 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 04:57:05,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:57:05,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:57:05,299 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 04:57:05,300 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-08 04:57:05,330 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 04:57:05,331 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 04:57:05,331 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-08 04:57:05,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:57:05,340 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:57:05,981 INFO L272 TraceCheckUtils]: 0: Hoare triple {2309#true} call ULTIMATE.init(); {2309#true} is VALID [2022-04-08 04:57:05,981 INFO L290 TraceCheckUtils]: 1: Hoare triple {2309#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2309#true} is VALID [2022-04-08 04:57:05,981 INFO L290 TraceCheckUtils]: 2: Hoare triple {2309#true} assume true; {2309#true} is VALID [2022-04-08 04:57:05,981 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2309#true} {2309#true} #102#return; {2309#true} is VALID [2022-04-08 04:57:05,981 INFO L272 TraceCheckUtils]: 4: Hoare triple {2309#true} call #t~ret7 := main(); {2309#true} is VALID [2022-04-08 04:57:05,981 INFO L290 TraceCheckUtils]: 5: Hoare triple {2309#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {2309#true} is VALID [2022-04-08 04:57:05,981 INFO L272 TraceCheckUtils]: 6: Hoare triple {2309#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {2309#true} is VALID [2022-04-08 04:57:05,982 INFO L290 TraceCheckUtils]: 7: Hoare triple {2309#true} ~cond := #in~cond; {2309#true} is VALID [2022-04-08 04:57:05,982 INFO L290 TraceCheckUtils]: 8: Hoare triple {2309#true} assume !(0 == ~cond); {2309#true} is VALID [2022-04-08 04:57:05,982 INFO L290 TraceCheckUtils]: 9: Hoare triple {2309#true} assume true; {2309#true} is VALID [2022-04-08 04:57:05,982 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2309#true} {2309#true} #82#return; {2309#true} is VALID [2022-04-08 04:57:05,982 INFO L290 TraceCheckUtils]: 11: Hoare triple {2309#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {2319#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-08 04:57:05,983 INFO L290 TraceCheckUtils]: 12: Hoare triple {2319#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2319#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-08 04:57:05,983 INFO L290 TraceCheckUtils]: 13: Hoare triple {2319#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} assume !!(#t~post5 < 10);havoc #t~post5; {2319#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-08 04:57:05,983 INFO L290 TraceCheckUtils]: 14: Hoare triple {2319#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {2319#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-08 04:57:05,984 INFO L290 TraceCheckUtils]: 15: Hoare triple {2319#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2319#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-08 04:57:05,984 INFO L290 TraceCheckUtils]: 16: Hoare triple {2319#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} assume !!(#t~post5 < 10);havoc #t~post5; {2319#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-08 04:57:05,985 INFO L290 TraceCheckUtils]: 17: Hoare triple {2319#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {2320#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0))} is VALID [2022-04-08 04:57:05,985 INFO L290 TraceCheckUtils]: 18: Hoare triple {2320#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2320#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0))} is VALID [2022-04-08 04:57:05,986 INFO L290 TraceCheckUtils]: 19: Hoare triple {2320#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0))} assume !!(#t~post6 < 10);havoc #t~post6; {2320#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0))} is VALID [2022-04-08 04:57:05,987 INFO L272 TraceCheckUtils]: 20: Hoare triple {2320#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0))} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {2387#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 04:57:05,987 INFO L290 TraceCheckUtils]: 21: Hoare triple {2387#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2391#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:57:05,987 INFO L290 TraceCheckUtils]: 22: Hoare triple {2391#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2310#false} is VALID [2022-04-08 04:57:05,987 INFO L290 TraceCheckUtils]: 23: Hoare triple {2310#false} assume !false; {2310#false} is VALID [2022-04-08 04:57:05,988 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-08 04:57:05,988 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 04:57:05,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [341131776] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:57:05,988 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-08 04:57:05,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 10 [2022-04-08 04:57:05,988 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:57:05,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2061865682] [2022-04-08 04:57:05,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2061865682] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:57:05,988 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:57:05,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 04:57:05,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875406123] [2022-04-08 04:57:05,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:57:05,989 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2022-04-08 04:57:05,989 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:57:05,989 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 04:57:06,005 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:57:06,005 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 04:57:06,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:57:06,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 04:57:06,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-04-08 04:57:06,005 INFO L87 Difference]: Start difference. First operand 62 states and 82 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 04:57:17,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:57:17,542 INFO L93 Difference]: Finished difference Result 85 states and 114 transitions. [2022-04-08 04:57:17,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 04:57:17,543 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2022-04-08 04:57:17,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:57:17,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 04:57:17,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 95 transitions. [2022-04-08 04:57:17,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 04:57:17,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 95 transitions. [2022-04-08 04:57:17,546 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 95 transitions. [2022-04-08 04:57:17,842 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:57:17,843 INFO L225 Difference]: With dead ends: 85 [2022-04-08 04:57:17,843 INFO L226 Difference]: Without dead ends: 69 [2022-04-08 04:57:17,844 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-04-08 04:57:17,844 INFO L913 BasicCegarLoop]: 51 mSDtfsCounter, 16 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-04-08 04:57:17,845 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 182 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-04-08 04:57:17,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-04-08 04:57:17,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2022-04-08 04:57:17,877 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:57:17,878 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand has 69 states, 37 states have (on average 1.2162162162162162) internal successors, (45), 39 states have internal predecessors, (45), 25 states have call successors, (25), 7 states have call predecessors, (25), 6 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-08 04:57:17,878 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand has 69 states, 37 states have (on average 1.2162162162162162) internal successors, (45), 39 states have internal predecessors, (45), 25 states have call successors, (25), 7 states have call predecessors, (25), 6 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-08 04:57:17,878 INFO L87 Difference]: Start difference. First operand 69 states. Second operand has 69 states, 37 states have (on average 1.2162162162162162) internal successors, (45), 39 states have internal predecessors, (45), 25 states have call successors, (25), 7 states have call predecessors, (25), 6 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-08 04:57:17,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:57:17,880 INFO L93 Difference]: Finished difference Result 69 states and 92 transitions. [2022-04-08 04:57:17,880 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 92 transitions. [2022-04-08 04:57:17,880 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:57:17,880 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:57:17,881 INFO L74 IsIncluded]: Start isIncluded. First operand has 69 states, 37 states have (on average 1.2162162162162162) internal successors, (45), 39 states have internal predecessors, (45), 25 states have call successors, (25), 7 states have call predecessors, (25), 6 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand 69 states. [2022-04-08 04:57:17,881 INFO L87 Difference]: Start difference. First operand has 69 states, 37 states have (on average 1.2162162162162162) internal successors, (45), 39 states have internal predecessors, (45), 25 states have call successors, (25), 7 states have call predecessors, (25), 6 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand 69 states. [2022-04-08 04:57:17,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:57:17,883 INFO L93 Difference]: Finished difference Result 69 states and 92 transitions. [2022-04-08 04:57:17,883 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 92 transitions. [2022-04-08 04:57:17,883 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:57:17,883 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:57:17,883 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:57:17,883 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:57:17,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 37 states have (on average 1.2162162162162162) internal successors, (45), 39 states have internal predecessors, (45), 25 states have call successors, (25), 7 states have call predecessors, (25), 6 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-08 04:57:17,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 92 transitions. [2022-04-08 04:57:17,885 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 92 transitions. Word has length 24 [2022-04-08 04:57:17,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:57:17,885 INFO L478 AbstractCegarLoop]: Abstraction has 69 states and 92 transitions. [2022-04-08 04:57:17,886 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 04:57:17,886 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 69 states and 92 transitions. [2022-04-08 04:57:18,225 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:57:18,225 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 92 transitions. [2022-04-08 04:57:18,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-04-08 04:57:18,226 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:57:18,226 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:57:18,242 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-08 04:57:18,426 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:57:18,427 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:57:18,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:57:18,427 INFO L85 PathProgramCache]: Analyzing trace with hash 107903087, now seen corresponding path program 1 times [2022-04-08 04:57:18,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:57:18,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [240263961] [2022-04-08 04:57:18,432 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 04:57:18,432 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-08 04:57:18,432 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 04:57:18,432 INFO L85 PathProgramCache]: Analyzing trace with hash 107903087, now seen corresponding path program 2 times [2022-04-08 04:57:18,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:57:18,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179255487] [2022-04-08 04:57:18,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:57:18,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:57:18,451 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 04:57:18,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [959930761] [2022-04-08 04:57:18,452 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 04:57:18,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:57:18,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:57:18,455 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 04:57:18,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-08 04:57:18,523 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 04:57:18,524 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 04:57:18,525 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-08 04:57:18,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:57:18,538 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:57:18,798 INFO L272 TraceCheckUtils]: 0: Hoare triple {2847#true} call ULTIMATE.init(); {2847#true} is VALID [2022-04-08 04:57:18,798 INFO L290 TraceCheckUtils]: 1: Hoare triple {2847#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2855#(<= ~counter~0 0)} is VALID [2022-04-08 04:57:18,799 INFO L290 TraceCheckUtils]: 2: Hoare triple {2855#(<= ~counter~0 0)} assume true; {2855#(<= ~counter~0 0)} is VALID [2022-04-08 04:57:18,799 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2855#(<= ~counter~0 0)} {2847#true} #102#return; {2855#(<= ~counter~0 0)} is VALID [2022-04-08 04:57:18,799 INFO L272 TraceCheckUtils]: 4: Hoare triple {2855#(<= ~counter~0 0)} call #t~ret7 := main(); {2855#(<= ~counter~0 0)} is VALID [2022-04-08 04:57:18,799 INFO L290 TraceCheckUtils]: 5: Hoare triple {2855#(<= ~counter~0 0)} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {2855#(<= ~counter~0 0)} is VALID [2022-04-08 04:57:18,800 INFO L272 TraceCheckUtils]: 6: Hoare triple {2855#(<= ~counter~0 0)} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {2855#(<= ~counter~0 0)} is VALID [2022-04-08 04:57:18,800 INFO L290 TraceCheckUtils]: 7: Hoare triple {2855#(<= ~counter~0 0)} ~cond := #in~cond; {2855#(<= ~counter~0 0)} is VALID [2022-04-08 04:57:18,801 INFO L290 TraceCheckUtils]: 8: Hoare triple {2855#(<= ~counter~0 0)} assume !(0 == ~cond); {2855#(<= ~counter~0 0)} is VALID [2022-04-08 04:57:18,801 INFO L290 TraceCheckUtils]: 9: Hoare triple {2855#(<= ~counter~0 0)} assume true; {2855#(<= ~counter~0 0)} is VALID [2022-04-08 04:57:18,801 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2855#(<= ~counter~0 0)} {2855#(<= ~counter~0 0)} #82#return; {2855#(<= ~counter~0 0)} is VALID [2022-04-08 04:57:18,801 INFO L290 TraceCheckUtils]: 11: Hoare triple {2855#(<= ~counter~0 0)} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {2855#(<= ~counter~0 0)} is VALID [2022-04-08 04:57:18,802 INFO L290 TraceCheckUtils]: 12: Hoare triple {2855#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2889#(<= ~counter~0 1)} is VALID [2022-04-08 04:57:18,802 INFO L290 TraceCheckUtils]: 13: Hoare triple {2889#(<= ~counter~0 1)} assume !!(#t~post5 < 10);havoc #t~post5; {2889#(<= ~counter~0 1)} is VALID [2022-04-08 04:57:18,802 INFO L290 TraceCheckUtils]: 14: Hoare triple {2889#(<= ~counter~0 1)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {2889#(<= ~counter~0 1)} is VALID [2022-04-08 04:57:18,803 INFO L290 TraceCheckUtils]: 15: Hoare triple {2889#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2899#(<= ~counter~0 2)} is VALID [2022-04-08 04:57:18,803 INFO L290 TraceCheckUtils]: 16: Hoare triple {2899#(<= ~counter~0 2)} assume !!(#t~post5 < 10);havoc #t~post5; {2899#(<= ~counter~0 2)} is VALID [2022-04-08 04:57:18,803 INFO L290 TraceCheckUtils]: 17: Hoare triple {2899#(<= ~counter~0 2)} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {2899#(<= ~counter~0 2)} is VALID [2022-04-08 04:57:18,808 INFO L290 TraceCheckUtils]: 18: Hoare triple {2899#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2909#(<= ~counter~0 3)} is VALID [2022-04-08 04:57:18,809 INFO L290 TraceCheckUtils]: 19: Hoare triple {2909#(<= ~counter~0 3)} assume !!(#t~post6 < 10);havoc #t~post6; {2909#(<= ~counter~0 3)} is VALID [2022-04-08 04:57:18,810 INFO L272 TraceCheckUtils]: 20: Hoare triple {2909#(<= ~counter~0 3)} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {2909#(<= ~counter~0 3)} is VALID [2022-04-08 04:57:18,810 INFO L290 TraceCheckUtils]: 21: Hoare triple {2909#(<= ~counter~0 3)} ~cond := #in~cond; {2909#(<= ~counter~0 3)} is VALID [2022-04-08 04:57:18,811 INFO L290 TraceCheckUtils]: 22: Hoare triple {2909#(<= ~counter~0 3)} assume !(0 == ~cond); {2909#(<= ~counter~0 3)} is VALID [2022-04-08 04:57:18,812 INFO L290 TraceCheckUtils]: 23: Hoare triple {2909#(<= ~counter~0 3)} assume true; {2909#(<= ~counter~0 3)} is VALID [2022-04-08 04:57:18,813 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {2909#(<= ~counter~0 3)} {2909#(<= ~counter~0 3)} #84#return; {2909#(<= ~counter~0 3)} is VALID [2022-04-08 04:57:18,813 INFO L272 TraceCheckUtils]: 25: Hoare triple {2909#(<= ~counter~0 3)} call __VERIFIER_assert((if (~p~0 * ~p~0 + ~r~0 * ~q~0) % 4294967296 == ~n~0 * ~q~0 % 4294967296 then 1 else 0)); {2909#(<= ~counter~0 3)} is VALID [2022-04-08 04:57:18,813 INFO L290 TraceCheckUtils]: 26: Hoare triple {2909#(<= ~counter~0 3)} ~cond := #in~cond; {2909#(<= ~counter~0 3)} is VALID [2022-04-08 04:57:18,814 INFO L290 TraceCheckUtils]: 27: Hoare triple {2909#(<= ~counter~0 3)} assume !(0 == ~cond); {2909#(<= ~counter~0 3)} is VALID [2022-04-08 04:57:18,815 INFO L290 TraceCheckUtils]: 28: Hoare triple {2909#(<= ~counter~0 3)} assume true; {2909#(<= ~counter~0 3)} is VALID [2022-04-08 04:57:18,815 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {2909#(<= ~counter~0 3)} {2909#(<= ~counter~0 3)} #86#return; {2909#(<= ~counter~0 3)} is VALID [2022-04-08 04:57:18,818 INFO L272 TraceCheckUtils]: 30: Hoare triple {2909#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == (~h~0 * ~h~0 * ~h~0 - 12 * ~h~0 * ~n~0 * ~q~0 + 16 * ~n~0 * ~p~0 * ~q~0 - ~h~0 * ~q~0 * ~q~0 - 4 * ~p~0 * ~q~0 * ~q~0 + 12 * ~h~0 * ~q~0 * ~r~0 - 16 * ~p~0 * ~q~0 * ~r~0) % 4294967296 then 1 else 0)); {2909#(<= ~counter~0 3)} is VALID [2022-04-08 04:57:18,818 INFO L290 TraceCheckUtils]: 31: Hoare triple {2909#(<= ~counter~0 3)} ~cond := #in~cond; {2909#(<= ~counter~0 3)} is VALID [2022-04-08 04:57:18,818 INFO L290 TraceCheckUtils]: 32: Hoare triple {2909#(<= ~counter~0 3)} assume !(0 == ~cond); {2909#(<= ~counter~0 3)} is VALID [2022-04-08 04:57:18,819 INFO L290 TraceCheckUtils]: 33: Hoare triple {2909#(<= ~counter~0 3)} assume true; {2909#(<= ~counter~0 3)} is VALID [2022-04-08 04:57:18,819 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2909#(<= ~counter~0 3)} {2909#(<= ~counter~0 3)} #88#return; {2909#(<= ~counter~0 3)} is VALID [2022-04-08 04:57:18,819 INFO L272 TraceCheckUtils]: 35: Hoare triple {2909#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == (~h~0 * ~h~0 * ~n~0 - 4 * ~h~0 * ~n~0 * ~p~0 + 4 * (~n~0 * ~n~0) * ~q~0 - ~n~0 * ~q~0 * ~q~0 - ~h~0 * ~h~0 * ~r~0 + 4 * ~h~0 * ~p~0 * ~r~0 - 8 * ~n~0 * ~q~0 * ~r~0 + ~q~0 * ~q~0 * ~r~0 + 4 * ~q~0 * ~r~0 * ~r~0) % 4294967296 then 1 else 0)); {2909#(<= ~counter~0 3)} is VALID [2022-04-08 04:57:18,824 INFO L290 TraceCheckUtils]: 36: Hoare triple {2909#(<= ~counter~0 3)} ~cond := #in~cond; {2909#(<= ~counter~0 3)} is VALID [2022-04-08 04:57:18,825 INFO L290 TraceCheckUtils]: 37: Hoare triple {2909#(<= ~counter~0 3)} assume !(0 == ~cond); {2909#(<= ~counter~0 3)} is VALID [2022-04-08 04:57:18,825 INFO L290 TraceCheckUtils]: 38: Hoare triple {2909#(<= ~counter~0 3)} assume true; {2909#(<= ~counter~0 3)} is VALID [2022-04-08 04:57:18,825 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {2909#(<= ~counter~0 3)} {2909#(<= ~counter~0 3)} #90#return; {2909#(<= ~counter~0 3)} is VALID [2022-04-08 04:57:18,826 INFO L272 TraceCheckUtils]: 40: Hoare triple {2909#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == (~h~0 * ~h~0 * ~p~0 - 4 * ~h~0 * ~n~0 * ~q~0 + 4 * ~n~0 * ~p~0 * ~q~0 - ~p~0 * ~q~0 * ~q~0 + 4 * ~h~0 * ~q~0 * ~r~0 - 4 * ~p~0 * ~q~0 * ~r~0) % 4294967296 then 1 else 0)); {2909#(<= ~counter~0 3)} is VALID [2022-04-08 04:57:18,826 INFO L290 TraceCheckUtils]: 41: Hoare triple {2909#(<= ~counter~0 3)} ~cond := #in~cond; {2909#(<= ~counter~0 3)} is VALID [2022-04-08 04:57:18,826 INFO L290 TraceCheckUtils]: 42: Hoare triple {2909#(<= ~counter~0 3)} assume !(0 == ~cond); {2909#(<= ~counter~0 3)} is VALID [2022-04-08 04:57:18,827 INFO L290 TraceCheckUtils]: 43: Hoare triple {2909#(<= ~counter~0 3)} assume true; {2909#(<= ~counter~0 3)} is VALID [2022-04-08 04:57:18,827 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {2909#(<= ~counter~0 3)} {2909#(<= ~counter~0 3)} #92#return; {2909#(<= ~counter~0 3)} is VALID [2022-04-08 04:57:18,828 INFO L272 TraceCheckUtils]: 45: Hoare triple {2909#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == (~p~0 * ~p~0 - ~n~0 * ~q~0 + ~q~0 * ~r~0) % 4294967296 then 1 else 0)); {2909#(<= ~counter~0 3)} is VALID [2022-04-08 04:57:18,828 INFO L290 TraceCheckUtils]: 46: Hoare triple {2909#(<= ~counter~0 3)} ~cond := #in~cond; {2909#(<= ~counter~0 3)} is VALID [2022-04-08 04:57:18,828 INFO L290 TraceCheckUtils]: 47: Hoare triple {2909#(<= ~counter~0 3)} assume !(0 == ~cond); {2909#(<= ~counter~0 3)} is VALID [2022-04-08 04:57:18,829 INFO L290 TraceCheckUtils]: 48: Hoare triple {2909#(<= ~counter~0 3)} assume true; {2909#(<= ~counter~0 3)} is VALID [2022-04-08 04:57:18,829 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {2909#(<= ~counter~0 3)} {2909#(<= ~counter~0 3)} #94#return; {2909#(<= ~counter~0 3)} is VALID [2022-04-08 04:57:18,830 INFO L290 TraceCheckUtils]: 50: Hoare triple {2909#(<= ~counter~0 3)} assume !!(1 != ~q~0 % 4294967296);~q~0 := (if ~q~0 % 4294967296 < 0 && 0 != ~q~0 % 4294967296 % 4 then 1 + ~q~0 % 4294967296 / 4 else ~q~0 % 4294967296 / 4);~h~0 := ~p~0 + ~q~0;~p~0 := (if ~p~0 % 4294967296 < 0 && 0 != ~p~0 % 4294967296 % 2 then 1 + ~p~0 % 4294967296 / 2 else ~p~0 % 4294967296 / 2); {2909#(<= ~counter~0 3)} is VALID [2022-04-08 04:57:18,830 INFO L290 TraceCheckUtils]: 51: Hoare triple {2909#(<= ~counter~0 3)} assume ~r~0 % 4294967296 >= ~h~0 % 4294967296;~p~0 := ~p~0 + ~q~0;~r~0 := ~r~0 - ~h~0; {2909#(<= ~counter~0 3)} is VALID [2022-04-08 04:57:18,830 INFO L290 TraceCheckUtils]: 52: Hoare triple {2909#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3012#(<= |main_#t~post6| 3)} is VALID [2022-04-08 04:57:18,831 INFO L290 TraceCheckUtils]: 53: Hoare triple {3012#(<= |main_#t~post6| 3)} assume !(#t~post6 < 10);havoc #t~post6; {2848#false} is VALID [2022-04-08 04:57:18,831 INFO L272 TraceCheckUtils]: 54: Hoare triple {2848#false} call __VERIFIER_assert((if 0 == (~h~0 * ~h~0 * ~h~0 - 12 * ~h~0 * ~n~0 + 16 * ~n~0 * ~p~0 + 12 * ~h~0 * ~r~0 - 16 * ~p~0 * ~r~0 - ~h~0 - 4 * ~p~0) % 4294967296 then 1 else 0)); {2848#false} is VALID [2022-04-08 04:57:18,831 INFO L290 TraceCheckUtils]: 55: Hoare triple {2848#false} ~cond := #in~cond; {2848#false} is VALID [2022-04-08 04:57:18,831 INFO L290 TraceCheckUtils]: 56: Hoare triple {2848#false} assume 0 == ~cond; {2848#false} is VALID [2022-04-08 04:57:18,831 INFO L290 TraceCheckUtils]: 57: Hoare triple {2848#false} assume !false; {2848#false} is VALID [2022-04-08 04:57:18,831 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-08 04:57:18,831 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 04:57:19,106 INFO L290 TraceCheckUtils]: 57: Hoare triple {2848#false} assume !false; {2848#false} is VALID [2022-04-08 04:57:19,106 INFO L290 TraceCheckUtils]: 56: Hoare triple {2848#false} assume 0 == ~cond; {2848#false} is VALID [2022-04-08 04:57:19,106 INFO L290 TraceCheckUtils]: 55: Hoare triple {2848#false} ~cond := #in~cond; {2848#false} is VALID [2022-04-08 04:57:19,106 INFO L272 TraceCheckUtils]: 54: Hoare triple {2848#false} call __VERIFIER_assert((if 0 == (~h~0 * ~h~0 * ~h~0 - 12 * ~h~0 * ~n~0 + 16 * ~n~0 * ~p~0 + 12 * ~h~0 * ~r~0 - 16 * ~p~0 * ~r~0 - ~h~0 - 4 * ~p~0) % 4294967296 then 1 else 0)); {2848#false} is VALID [2022-04-08 04:57:19,107 INFO L290 TraceCheckUtils]: 53: Hoare triple {3040#(< |main_#t~post6| 10)} assume !(#t~post6 < 10);havoc #t~post6; {2848#false} is VALID [2022-04-08 04:57:19,107 INFO L290 TraceCheckUtils]: 52: Hoare triple {3044#(< ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3040#(< |main_#t~post6| 10)} is VALID [2022-04-08 04:57:19,107 INFO L290 TraceCheckUtils]: 51: Hoare triple {3044#(< ~counter~0 10)} assume ~r~0 % 4294967296 >= ~h~0 % 4294967296;~p~0 := ~p~0 + ~q~0;~r~0 := ~r~0 - ~h~0; {3044#(< ~counter~0 10)} is VALID [2022-04-08 04:57:19,108 INFO L290 TraceCheckUtils]: 50: Hoare triple {3044#(< ~counter~0 10)} assume !!(1 != ~q~0 % 4294967296);~q~0 := (if ~q~0 % 4294967296 < 0 && 0 != ~q~0 % 4294967296 % 4 then 1 + ~q~0 % 4294967296 / 4 else ~q~0 % 4294967296 / 4);~h~0 := ~p~0 + ~q~0;~p~0 := (if ~p~0 % 4294967296 < 0 && 0 != ~p~0 % 4294967296 % 2 then 1 + ~p~0 % 4294967296 / 2 else ~p~0 % 4294967296 / 2); {3044#(< ~counter~0 10)} is VALID [2022-04-08 04:57:19,108 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {2847#true} {3044#(< ~counter~0 10)} #94#return; {3044#(< ~counter~0 10)} is VALID [2022-04-08 04:57:19,108 INFO L290 TraceCheckUtils]: 48: Hoare triple {2847#true} assume true; {2847#true} is VALID [2022-04-08 04:57:19,108 INFO L290 TraceCheckUtils]: 47: Hoare triple {2847#true} assume !(0 == ~cond); {2847#true} is VALID [2022-04-08 04:57:19,108 INFO L290 TraceCheckUtils]: 46: Hoare triple {2847#true} ~cond := #in~cond; {2847#true} is VALID [2022-04-08 04:57:19,108 INFO L272 TraceCheckUtils]: 45: Hoare triple {3044#(< ~counter~0 10)} call __VERIFIER_assert((if 0 == (~p~0 * ~p~0 - ~n~0 * ~q~0 + ~q~0 * ~r~0) % 4294967296 then 1 else 0)); {2847#true} is VALID [2022-04-08 04:57:19,109 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {2847#true} {3044#(< ~counter~0 10)} #92#return; {3044#(< ~counter~0 10)} is VALID [2022-04-08 04:57:19,110 INFO L290 TraceCheckUtils]: 43: Hoare triple {2847#true} assume true; {2847#true} is VALID [2022-04-08 04:57:19,111 INFO L290 TraceCheckUtils]: 42: Hoare triple {2847#true} assume !(0 == ~cond); {2847#true} is VALID [2022-04-08 04:57:19,111 INFO L290 TraceCheckUtils]: 41: Hoare triple {2847#true} ~cond := #in~cond; {2847#true} is VALID [2022-04-08 04:57:19,111 INFO L272 TraceCheckUtils]: 40: Hoare triple {3044#(< ~counter~0 10)} call __VERIFIER_assert((if 0 == (~h~0 * ~h~0 * ~p~0 - 4 * ~h~0 * ~n~0 * ~q~0 + 4 * ~n~0 * ~p~0 * ~q~0 - ~p~0 * ~q~0 * ~q~0 + 4 * ~h~0 * ~q~0 * ~r~0 - 4 * ~p~0 * ~q~0 * ~r~0) % 4294967296 then 1 else 0)); {2847#true} is VALID [2022-04-08 04:57:19,112 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {2847#true} {3044#(< ~counter~0 10)} #90#return; {3044#(< ~counter~0 10)} is VALID [2022-04-08 04:57:19,112 INFO L290 TraceCheckUtils]: 38: Hoare triple {2847#true} assume true; {2847#true} is VALID [2022-04-08 04:57:19,112 INFO L290 TraceCheckUtils]: 37: Hoare triple {2847#true} assume !(0 == ~cond); {2847#true} is VALID [2022-04-08 04:57:19,113 INFO L290 TraceCheckUtils]: 36: Hoare triple {2847#true} ~cond := #in~cond; {2847#true} is VALID [2022-04-08 04:57:19,113 INFO L272 TraceCheckUtils]: 35: Hoare triple {3044#(< ~counter~0 10)} call __VERIFIER_assert((if 0 == (~h~0 * ~h~0 * ~n~0 - 4 * ~h~0 * ~n~0 * ~p~0 + 4 * (~n~0 * ~n~0) * ~q~0 - ~n~0 * ~q~0 * ~q~0 - ~h~0 * ~h~0 * ~r~0 + 4 * ~h~0 * ~p~0 * ~r~0 - 8 * ~n~0 * ~q~0 * ~r~0 + ~q~0 * ~q~0 * ~r~0 + 4 * ~q~0 * ~r~0 * ~r~0) % 4294967296 then 1 else 0)); {2847#true} is VALID [2022-04-08 04:57:19,113 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2847#true} {3044#(< ~counter~0 10)} #88#return; {3044#(< ~counter~0 10)} is VALID [2022-04-08 04:57:19,113 INFO L290 TraceCheckUtils]: 33: Hoare triple {2847#true} assume true; {2847#true} is VALID [2022-04-08 04:57:19,114 INFO L290 TraceCheckUtils]: 32: Hoare triple {2847#true} assume !(0 == ~cond); {2847#true} is VALID [2022-04-08 04:57:19,114 INFO L290 TraceCheckUtils]: 31: Hoare triple {2847#true} ~cond := #in~cond; {2847#true} is VALID [2022-04-08 04:57:19,114 INFO L272 TraceCheckUtils]: 30: Hoare triple {3044#(< ~counter~0 10)} call __VERIFIER_assert((if 0 == (~h~0 * ~h~0 * ~h~0 - 12 * ~h~0 * ~n~0 * ~q~0 + 16 * ~n~0 * ~p~0 * ~q~0 - ~h~0 * ~q~0 * ~q~0 - 4 * ~p~0 * ~q~0 * ~q~0 + 12 * ~h~0 * ~q~0 * ~r~0 - 16 * ~p~0 * ~q~0 * ~r~0) % 4294967296 then 1 else 0)); {2847#true} is VALID [2022-04-08 04:57:19,114 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {2847#true} {3044#(< ~counter~0 10)} #86#return; {3044#(< ~counter~0 10)} is VALID [2022-04-08 04:57:19,114 INFO L290 TraceCheckUtils]: 28: Hoare triple {2847#true} assume true; {2847#true} is VALID [2022-04-08 04:57:19,114 INFO L290 TraceCheckUtils]: 27: Hoare triple {2847#true} assume !(0 == ~cond); {2847#true} is VALID [2022-04-08 04:57:19,114 INFO L290 TraceCheckUtils]: 26: Hoare triple {2847#true} ~cond := #in~cond; {2847#true} is VALID [2022-04-08 04:57:19,115 INFO L272 TraceCheckUtils]: 25: Hoare triple {3044#(< ~counter~0 10)} call __VERIFIER_assert((if (~p~0 * ~p~0 + ~r~0 * ~q~0) % 4294967296 == ~n~0 * ~q~0 % 4294967296 then 1 else 0)); {2847#true} is VALID [2022-04-08 04:57:19,115 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {2847#true} {3044#(< ~counter~0 10)} #84#return; {3044#(< ~counter~0 10)} is VALID [2022-04-08 04:57:19,115 INFO L290 TraceCheckUtils]: 23: Hoare triple {2847#true} assume true; {2847#true} is VALID [2022-04-08 04:57:19,115 INFO L290 TraceCheckUtils]: 22: Hoare triple {2847#true} assume !(0 == ~cond); {2847#true} is VALID [2022-04-08 04:57:19,115 INFO L290 TraceCheckUtils]: 21: Hoare triple {2847#true} ~cond := #in~cond; {2847#true} is VALID [2022-04-08 04:57:19,115 INFO L272 TraceCheckUtils]: 20: Hoare triple {3044#(< ~counter~0 10)} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {2847#true} is VALID [2022-04-08 04:57:19,116 INFO L290 TraceCheckUtils]: 19: Hoare triple {3044#(< ~counter~0 10)} assume !!(#t~post6 < 10);havoc #t~post6; {3044#(< ~counter~0 10)} is VALID [2022-04-08 04:57:19,116 INFO L290 TraceCheckUtils]: 18: Hoare triple {3147#(< ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3044#(< ~counter~0 10)} is VALID [2022-04-08 04:57:19,116 INFO L290 TraceCheckUtils]: 17: Hoare triple {3147#(< ~counter~0 9)} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {3147#(< ~counter~0 9)} is VALID [2022-04-08 04:57:19,117 INFO L290 TraceCheckUtils]: 16: Hoare triple {3147#(< ~counter~0 9)} assume !!(#t~post5 < 10);havoc #t~post5; {3147#(< ~counter~0 9)} is VALID [2022-04-08 04:57:19,117 INFO L290 TraceCheckUtils]: 15: Hoare triple {3157#(< ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3147#(< ~counter~0 9)} is VALID [2022-04-08 04:57:19,117 INFO L290 TraceCheckUtils]: 14: Hoare triple {3157#(< ~counter~0 8)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {3157#(< ~counter~0 8)} is VALID [2022-04-08 04:57:19,118 INFO L290 TraceCheckUtils]: 13: Hoare triple {3157#(< ~counter~0 8)} assume !!(#t~post5 < 10);havoc #t~post5; {3157#(< ~counter~0 8)} is VALID [2022-04-08 04:57:19,118 INFO L290 TraceCheckUtils]: 12: Hoare triple {3167#(< ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3157#(< ~counter~0 8)} is VALID [2022-04-08 04:57:19,118 INFO L290 TraceCheckUtils]: 11: Hoare triple {3167#(< ~counter~0 7)} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {3167#(< ~counter~0 7)} is VALID [2022-04-08 04:57:19,119 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2847#true} {3167#(< ~counter~0 7)} #82#return; {3167#(< ~counter~0 7)} is VALID [2022-04-08 04:57:19,119 INFO L290 TraceCheckUtils]: 9: Hoare triple {2847#true} assume true; {2847#true} is VALID [2022-04-08 04:57:19,119 INFO L290 TraceCheckUtils]: 8: Hoare triple {2847#true} assume !(0 == ~cond); {2847#true} is VALID [2022-04-08 04:57:19,119 INFO L290 TraceCheckUtils]: 7: Hoare triple {2847#true} ~cond := #in~cond; {2847#true} is VALID [2022-04-08 04:57:19,119 INFO L272 TraceCheckUtils]: 6: Hoare triple {3167#(< ~counter~0 7)} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {2847#true} is VALID [2022-04-08 04:57:19,120 INFO L290 TraceCheckUtils]: 5: Hoare triple {3167#(< ~counter~0 7)} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {3167#(< ~counter~0 7)} is VALID [2022-04-08 04:57:19,120 INFO L272 TraceCheckUtils]: 4: Hoare triple {3167#(< ~counter~0 7)} call #t~ret7 := main(); {3167#(< ~counter~0 7)} is VALID [2022-04-08 04:57:19,120 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3167#(< ~counter~0 7)} {2847#true} #102#return; {3167#(< ~counter~0 7)} is VALID [2022-04-08 04:57:19,120 INFO L290 TraceCheckUtils]: 2: Hoare triple {3167#(< ~counter~0 7)} assume true; {3167#(< ~counter~0 7)} is VALID [2022-04-08 04:57:19,121 INFO L290 TraceCheckUtils]: 1: Hoare triple {2847#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3167#(< ~counter~0 7)} is VALID [2022-04-08 04:57:19,121 INFO L272 TraceCheckUtils]: 0: Hoare triple {2847#true} call ULTIMATE.init(); {2847#true} is VALID [2022-04-08 04:57:19,121 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-08 04:57:19,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:57:19,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179255487] [2022-04-08 04:57:19,122 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 04:57:19,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [959930761] [2022-04-08 04:57:19,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [959930761] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 04:57:19,122 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 04:57:19,122 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-04-08 04:57:19,122 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:57:19,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [240263961] [2022-04-08 04:57:19,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [240263961] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:57:19,122 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:57:19,122 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 04:57:19,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801474193] [2022-04-08 04:57:19,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:57:19,123 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 4 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) Word has length 58 [2022-04-08 04:57:19,123 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:57:19,123 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 4 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-08 04:57:19,155 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:57:19,155 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 04:57:19,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:57:19,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 04:57:19,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2022-04-08 04:57:19,156 INFO L87 Difference]: Start difference. First operand 69 states and 92 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 4 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-08 04:57:29,982 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 04:57:32,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:57:32,706 INFO L93 Difference]: Finished difference Result 114 states and 146 transitions. [2022-04-08 04:57:32,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 04:57:32,706 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 4 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) Word has length 58 [2022-04-08 04:57:32,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:57:32,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 4 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-08 04:57:32,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 90 transitions. [2022-04-08 04:57:32,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 4 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-08 04:57:32,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 90 transitions. [2022-04-08 04:57:32,709 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 90 transitions. [2022-04-08 04:57:32,774 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:57:32,775 INFO L225 Difference]: With dead ends: 114 [2022-04-08 04:57:32,775 INFO L226 Difference]: Without dead ends: 104 [2022-04-08 04:57:32,776 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2022-04-08 04:57:32,776 INFO L913 BasicCegarLoop]: 48 mSDtfsCounter, 21 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 13 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-04-08 04:57:32,776 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 157 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 26 Invalid, 1 Unknown, 0 Unchecked, 3.1s Time] [2022-04-08 04:57:32,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-04-08 04:57:32,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 98. [2022-04-08 04:57:32,840 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:57:32,840 INFO L82 GeneralOperation]: Start isEquivalent. First operand 104 states. Second operand has 98 states, 57 states have (on average 1.1754385964912282) internal successors, (67), 59 states have internal predecessors, (67), 31 states have call successors, (31), 10 states have call predecessors, (31), 9 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-08 04:57:32,840 INFO L74 IsIncluded]: Start isIncluded. First operand 104 states. Second operand has 98 states, 57 states have (on average 1.1754385964912282) internal successors, (67), 59 states have internal predecessors, (67), 31 states have call successors, (31), 10 states have call predecessors, (31), 9 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-08 04:57:32,841 INFO L87 Difference]: Start difference. First operand 104 states. Second operand has 98 states, 57 states have (on average 1.1754385964912282) internal successors, (67), 59 states have internal predecessors, (67), 31 states have call successors, (31), 10 states have call predecessors, (31), 9 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-08 04:57:32,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:57:32,843 INFO L93 Difference]: Finished difference Result 104 states and 133 transitions. [2022-04-08 04:57:32,843 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 133 transitions. [2022-04-08 04:57:32,844 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:57:32,844 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:57:32,844 INFO L74 IsIncluded]: Start isIncluded. First operand has 98 states, 57 states have (on average 1.1754385964912282) internal successors, (67), 59 states have internal predecessors, (67), 31 states have call successors, (31), 10 states have call predecessors, (31), 9 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand 104 states. [2022-04-08 04:57:32,844 INFO L87 Difference]: Start difference. First operand has 98 states, 57 states have (on average 1.1754385964912282) internal successors, (67), 59 states have internal predecessors, (67), 31 states have call successors, (31), 10 states have call predecessors, (31), 9 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand 104 states. [2022-04-08 04:57:32,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:57:32,847 INFO L93 Difference]: Finished difference Result 104 states and 133 transitions. [2022-04-08 04:57:32,847 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 133 transitions. [2022-04-08 04:57:32,847 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:57:32,847 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:57:32,847 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:57:32,847 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:57:32,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 57 states have (on average 1.1754385964912282) internal successors, (67), 59 states have internal predecessors, (67), 31 states have call successors, (31), 10 states have call predecessors, (31), 9 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-08 04:57:32,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 126 transitions. [2022-04-08 04:57:32,850 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 126 transitions. Word has length 58 [2022-04-08 04:57:32,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:57:32,850 INFO L478 AbstractCegarLoop]: Abstraction has 98 states and 126 transitions. [2022-04-08 04:57:32,851 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 4 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-08 04:57:32,851 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 98 states and 126 transitions. [2022-04-08 04:57:33,308 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 126 edges. 126 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:57:33,308 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 126 transitions. [2022-04-08 04:57:33,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-04-08 04:57:33,309 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:57:33,309 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:57:33,313 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-08 04:57:33,511 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:57:33,514 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:57:33,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:57:33,514 INFO L85 PathProgramCache]: Analyzing trace with hash 109392637, now seen corresponding path program 1 times [2022-04-08 04:57:33,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:57:33,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [268656050] [2022-04-08 04:57:33,519 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 04:57:33,519 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-08 04:57:33,519 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 04:57:33,519 INFO L85 PathProgramCache]: Analyzing trace with hash 109392637, now seen corresponding path program 2 times [2022-04-08 04:57:33,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:57:33,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080763818] [2022-04-08 04:57:33,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:57:33,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:57:33,544 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 04:57:33,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1044657496] [2022-04-08 04:57:33,544 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 04:57:33,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:57:33,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:57:33,559 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 04:57:33,560 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process