/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/dijkstra-u.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 04:21:44,256 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 04:21:44,258 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 04:21:44,293 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 04:21:44,293 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 04:21:44,295 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 04:21:44,297 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 04:21:44,299 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 04:21:44,300 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 04:21:44,303 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 04:21:44,304 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 04:21:44,305 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 04:21:44,305 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 04:21:44,307 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 04:21:44,307 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 04:21:44,310 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 04:21:44,310 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 04:21:44,311 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 04:21:44,313 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 04:21:44,317 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 04:21:44,318 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 04:21:44,319 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 04:21:44,319 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 04:21:44,320 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 04:21:44,321 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 04:21:44,325 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 04:21:44,326 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 04:21:44,326 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 04:21:44,326 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 04:21:44,327 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 04:21:44,328 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 04:21:44,328 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 04:21:44,329 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 04:21:44,330 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 04:21:44,330 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 04:21:44,331 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 04:21:44,331 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 04:21:44,331 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 04:21:44,331 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 04:21:44,331 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 04:21:44,332 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 04:21:44,333 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 04:21:44,334 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:21:44,340 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 04:21:44,341 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 04:21:44,342 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 04:21:44,342 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-08 04:21:44,342 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 04:21:44,342 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-08 04:21:44,342 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 04:21:44,342 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 04:21:44,343 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 04:21:44,343 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 04:21:44,343 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-08 04:21:44,343 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 04:21:44,344 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 04:21:44,344 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 04:21:44,344 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 04:21:44,344 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 04:21:44,344 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 04:21:44,344 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 04:21:44,344 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 04:21:44,344 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 04:21:44,344 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 04:21:44,344 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 04:21:44,345 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 04:21:44,345 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 04:21:44,345 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-08 04:21:44,345 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:21:44,548 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 04:21:44,568 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 04:21:44,570 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 04:21:44,571 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 04:21:44,571 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 04:21:44,572 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench/dijkstra-u.c [2022-04-08 04:21:44,620 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/231aa50c7/c809051cfb1342c583b48d0f9259c1b1/FLAG8dace2667 [2022-04-08 04:21:44,982 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 04:21:44,982 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/dijkstra-u.c [2022-04-08 04:21:44,989 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/231aa50c7/c809051cfb1342c583b48d0f9259c1b1/FLAG8dace2667 [2022-04-08 04:21:45,002 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/231aa50c7/c809051cfb1342c583b48d0f9259c1b1 [2022-04-08 04:21:45,004 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 04:21:45,005 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 04:21:45,008 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 04:21:45,008 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 04:21:45,011 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 04:21:45,012 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 04:21:45" (1/1) ... [2022-04-08 04:21:45,012 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a95ebfb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:21:45, skipping insertion in model container [2022-04-08 04:21:45,013 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 04:21:45" (1/1) ... [2022-04-08 04:21:45,018 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 04:21:45,031 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 04:21:45,198 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/dijkstra-u.c[525,538] [2022-04-08 04:21:45,237 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 04:21:45,245 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 04:21:45,255 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/dijkstra-u.c[525,538] [2022-04-08 04:21:45,279 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 04:21:45,295 INFO L208 MainTranslator]: Completed translation [2022-04-08 04:21:45,296 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:21:45 WrapperNode [2022-04-08 04:21:45,297 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 04:21:45,297 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 04:21:45,297 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 04:21:45,297 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 04:21:45,305 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:21:45" (1/1) ... [2022-04-08 04:21:45,305 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:21:45" (1/1) ... [2022-04-08 04:21:45,319 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:21:45" (1/1) ... [2022-04-08 04:21:45,320 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:21:45" (1/1) ... [2022-04-08 04:21:45,324 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:21:45" (1/1) ... [2022-04-08 04:21:45,327 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:21:45" (1/1) ... [2022-04-08 04:21:45,328 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:21:45" (1/1) ... [2022-04-08 04:21:45,329 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 04:21:45,330 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 04:21:45,330 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 04:21:45,330 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 04:21:45,334 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:21:45" (1/1) ... [2022-04-08 04:21:45,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 04:21:45,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:21:45,360 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:21:45,362 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:21:45,383 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 04:21:45,383 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 04:21:45,383 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 04:21:45,383 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 04:21:45,383 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 04:21:45,383 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 04:21:45,384 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 04:21:45,384 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 04:21:45,384 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 04:21:45,384 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 04:21:45,384 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-08 04:21:45,384 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 04:21:45,384 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 04:21:45,384 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 04:21:45,384 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 04:21:45,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 04:21:45,384 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 04:21:45,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 04:21:45,384 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 04:21:45,384 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 04:21:45,426 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 04:21:45,427 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 04:21:45,632 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 04:21:45,641 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 04:21:45,641 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-08 04:21:45,643 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 04:21:45 BoogieIcfgContainer [2022-04-08 04:21:45,643 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 04:21:45,644 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 04:21:45,644 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 04:21:45,658 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 04:21:45,658 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 04:21:45" (1/3) ... [2022-04-08 04:21:45,658 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d21fbfe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 04:21:45, skipping insertion in model container [2022-04-08 04:21:45,658 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:21:45" (2/3) ... [2022-04-08 04:21:45,659 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d21fbfe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 04:21:45, skipping insertion in model container [2022-04-08 04:21:45,659 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 04:21:45" (3/3) ... [2022-04-08 04:21:45,660 INFO L111 eAbstractionObserver]: Analyzing ICFG dijkstra-u.c [2022-04-08 04:21:45,663 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 04:21:45,663 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 04:21:45,706 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 04:21:45,710 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:21:45,710 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 04:21:45,727 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 states have internal predecessors, (29), 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:21:45,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-08 04:21:45,733 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:21:45,733 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:21:45,734 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:21:45,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:21:45,741 INFO L85 PathProgramCache]: Analyzing trace with hash 818818098, now seen corresponding path program 1 times [2022-04-08 04:21:45,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:21:45,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1486604611] [2022-04-08 04:21:45,756 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 04:21:45,756 INFO L85 PathProgramCache]: Analyzing trace with hash 818818098, now seen corresponding path program 2 times [2022-04-08 04:21:45,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:21:45,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987295990] [2022-04-08 04:21:45,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:21:45,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:21:45,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:21:45,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 04:21:45,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:21:45,954 INFO L290 TraceCheckUtils]: 0: Hoare triple {49#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {40#true} is VALID [2022-04-08 04:21:45,955 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#true} assume true; {40#true} is VALID [2022-04-08 04:21:45,955 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {40#true} {40#true} #100#return; {40#true} is VALID [2022-04-08 04:21:45,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-08 04:21:45,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:21:45,967 INFO L290 TraceCheckUtils]: 0: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-08 04:21:45,968 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-08 04:21:45,968 INFO L290 TraceCheckUtils]: 2: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-08 04:21:45,968 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41#false} {40#true} #80#return; {41#false} is VALID [2022-04-08 04:21:45,969 INFO L272 TraceCheckUtils]: 0: Hoare triple {40#true} call ULTIMATE.init(); {49#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 04:21:45,969 INFO L290 TraceCheckUtils]: 1: Hoare triple {49#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {40#true} is VALID [2022-04-08 04:21:45,969 INFO L290 TraceCheckUtils]: 2: Hoare triple {40#true} assume true; {40#true} is VALID [2022-04-08 04:21:45,969 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40#true} {40#true} #100#return; {40#true} is VALID [2022-04-08 04:21:45,970 INFO L272 TraceCheckUtils]: 4: Hoare triple {40#true} call #t~ret5 := main(); {40#true} is VALID [2022-04-08 04:21:45,970 INFO L290 TraceCheckUtils]: 5: Hoare triple {40#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {40#true} is VALID [2022-04-08 04:21:45,970 INFO L272 TraceCheckUtils]: 6: Hoare triple {40#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {40#true} is VALID [2022-04-08 04:21:45,970 INFO L290 TraceCheckUtils]: 7: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-08 04:21:45,972 INFO L290 TraceCheckUtils]: 8: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-08 04:21:45,972 INFO L290 TraceCheckUtils]: 9: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-08 04:21:45,972 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {41#false} {40#true} #80#return; {41#false} is VALID [2022-04-08 04:21:45,972 INFO L290 TraceCheckUtils]: 11: Hoare triple {41#false} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {41#false} is VALID [2022-04-08 04:21:45,973 INFO L290 TraceCheckUtils]: 12: Hoare triple {41#false} assume false; {41#false} is VALID [2022-04-08 04:21:45,973 INFO L290 TraceCheckUtils]: 13: Hoare triple {41#false} assume false; {41#false} is VALID [2022-04-08 04:21:45,973 INFO L272 TraceCheckUtils]: 14: Hoare triple {41#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)); {41#false} is VALID [2022-04-08 04:21:45,973 INFO L290 TraceCheckUtils]: 15: Hoare triple {41#false} ~cond := #in~cond; {41#false} is VALID [2022-04-08 04:21:45,973 INFO L290 TraceCheckUtils]: 16: Hoare triple {41#false} assume 0 == ~cond; {41#false} is VALID [2022-04-08 04:21:45,974 INFO L290 TraceCheckUtils]: 17: Hoare triple {41#false} assume !false; {41#false} is VALID [2022-04-08 04:21:45,974 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:21:45,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:21:45,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987295990] [2022-04-08 04:21:45,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987295990] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:21:45,975 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:21:45,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 04:21:45,977 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:21:45,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1486604611] [2022-04-08 04:21:45,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1486604611] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:21:45,978 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:21:45,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 04:21:45,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444437678] [2022-04-08 04:21:45,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:21:45,986 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:21:45,987 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:21:45,990 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:21:46,019 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:21:46,019 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 04:21:46,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:21:46,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 04:21:46,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 04:21:46,043 INFO L87 Difference]: Start difference. First operand has 37 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 states have internal predecessors, (29), 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:21:46,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:21:46,452 INFO L93 Difference]: Finished difference Result 65 states and 105 transitions. [2022-04-08 04:21:46,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 04:21:46,453 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:21:46,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:21:46,454 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:21:46,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 105 transitions. [2022-04-08 04:21:46,463 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:21:46,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 105 transitions. [2022-04-08 04:21:46,468 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 105 transitions. [2022-04-08 04:21:46,604 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:21:46,614 INFO L225 Difference]: With dead ends: 65 [2022-04-08 04:21:46,615 INFO L226 Difference]: Without dead ends: 32 [2022-04-08 04:21:46,618 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:21:46,621 INFO L913 BasicCegarLoop]: 37 mSDtfsCounter, 20 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 04:21:46,623 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 40 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 04:21:46,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-08 04:21:46,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-08 04:21:46,652 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:21:46,653 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 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:21:46,654 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 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:21:46,654 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 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:21:46,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:21:46,658 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2022-04-08 04:21:46,658 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-08 04:21:46,658 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:21:46,659 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:21:46,659 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 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 32 states. [2022-04-08 04:21:46,659 INFO L87 Difference]: Start difference. First operand has 32 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 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 32 states. [2022-04-08 04:21:46,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:21:46,662 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2022-04-08 04:21:46,663 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-08 04:21:46,663 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:21:46,663 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:21:46,663 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:21:46,664 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:21:46,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 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:21:46,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2022-04-08 04:21:46,670 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 18 [2022-04-08 04:21:46,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:21:46,670 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2022-04-08 04:21:46,671 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:21:46,671 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 42 transitions. [2022-04-08 04:21:46,724 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:21:46,725 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-08 04:21:46,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-08 04:21:46,725 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:21:46,725 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:21:46,726 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 04:21:46,726 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:21:46,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:21:46,726 INFO L85 PathProgramCache]: Analyzing trace with hash 1723375776, now seen corresponding path program 1 times [2022-04-08 04:21:46,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:21:46,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [745654040] [2022-04-08 04:21:46,727 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 04:21:46,727 INFO L85 PathProgramCache]: Analyzing trace with hash 1723375776, now seen corresponding path program 2 times [2022-04-08 04:21:46,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:21:46,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557670058] [2022-04-08 04:21:46,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:21:46,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:21:46,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:21:46,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 04:21:46,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:21:46,961 INFO L290 TraceCheckUtils]: 0: Hoare triple {323#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {310#true} is VALID [2022-04-08 04:21:46,961 INFO L290 TraceCheckUtils]: 1: Hoare triple {310#true} assume true; {310#true} is VALID [2022-04-08 04:21:46,962 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {310#true} {310#true} #100#return; {310#true} is VALID [2022-04-08 04:21:46,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-08 04:21:46,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:21:46,976 INFO L290 TraceCheckUtils]: 0: Hoare triple {310#true} ~cond := #in~cond; {310#true} is VALID [2022-04-08 04:21:46,977 INFO L290 TraceCheckUtils]: 1: Hoare triple {310#true} assume !(0 == ~cond); {310#true} is VALID [2022-04-08 04:21:46,977 INFO L290 TraceCheckUtils]: 2: Hoare triple {310#true} assume true; {310#true} is VALID [2022-04-08 04:21:46,977 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {310#true} {310#true} #80#return; {310#true} is VALID [2022-04-08 04:21:46,978 INFO L272 TraceCheckUtils]: 0: Hoare triple {310#true} call ULTIMATE.init(); {323#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 04:21:46,978 INFO L290 TraceCheckUtils]: 1: Hoare triple {323#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {310#true} is VALID [2022-04-08 04:21:46,978 INFO L290 TraceCheckUtils]: 2: Hoare triple {310#true} assume true; {310#true} is VALID [2022-04-08 04:21:46,978 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {310#true} {310#true} #100#return; {310#true} is VALID [2022-04-08 04:21:46,978 INFO L272 TraceCheckUtils]: 4: Hoare triple {310#true} call #t~ret5 := main(); {310#true} is VALID [2022-04-08 04:21:46,978 INFO L290 TraceCheckUtils]: 5: Hoare triple {310#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {310#true} is VALID [2022-04-08 04:21:46,978 INFO L272 TraceCheckUtils]: 6: Hoare triple {310#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {310#true} is VALID [2022-04-08 04:21:46,979 INFO L290 TraceCheckUtils]: 7: Hoare triple {310#true} ~cond := #in~cond; {310#true} is VALID [2022-04-08 04:21:46,979 INFO L290 TraceCheckUtils]: 8: Hoare triple {310#true} assume !(0 == ~cond); {310#true} is VALID [2022-04-08 04:21:46,979 INFO L290 TraceCheckUtils]: 9: Hoare triple {310#true} assume true; {310#true} is VALID [2022-04-08 04:21:46,979 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {310#true} {310#true} #80#return; {310#true} is VALID [2022-04-08 04:21:46,980 INFO L290 TraceCheckUtils]: 11: Hoare triple {310#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {319#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} is VALID [2022-04-08 04:21:46,981 INFO L290 TraceCheckUtils]: 12: Hoare triple {319#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} assume !false; {319#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} is VALID [2022-04-08 04:21:46,982 INFO L290 TraceCheckUtils]: 13: Hoare triple {319#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {320#(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:21:46,983 INFO L290 TraceCheckUtils]: 14: Hoare triple {320#(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 !false; {320#(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:21:46,984 INFO L272 TraceCheckUtils]: 15: Hoare triple {320#(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)); {321#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 04:21:46,987 INFO L290 TraceCheckUtils]: 16: Hoare triple {321#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {322#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 04:21:46,987 INFO L290 TraceCheckUtils]: 17: Hoare triple {322#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {311#false} is VALID [2022-04-08 04:21:46,988 INFO L290 TraceCheckUtils]: 18: Hoare triple {311#false} assume !false; {311#false} is VALID [2022-04-08 04:21:46,988 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:21:46,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:21:46,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557670058] [2022-04-08 04:21:46,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557670058] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:21:46,988 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:21:46,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 04:21:46,989 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:21:46,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [745654040] [2022-04-08 04:21:46,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [745654040] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:21:46,989 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:21:46,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 04:21:46,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819149444] [2022-04-08 04:21:46,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:21:46,990 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 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 19 [2022-04-08 04:21:46,990 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:21:46,990 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 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:21:47,007 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:21:47,008 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 04:21:47,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:21:47,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 04:21:47,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-08 04:21:47,009 INFO L87 Difference]: Start difference. First operand 32 states and 42 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 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:21:51,169 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:21:56,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:21:56,435 INFO L93 Difference]: Finished difference Result 67 states and 96 transitions. [2022-04-08 04:21:56,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 04:21:56,435 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 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 19 [2022-04-08 04:21:56,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:21:56,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 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:21:56,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 96 transitions. [2022-04-08 04:21:56,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 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:21:56,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 96 transitions. [2022-04-08 04:21:56,442 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 96 transitions. [2022-04-08 04:21:56,621 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:21:56,623 INFO L225 Difference]: With dead ends: 67 [2022-04-08 04:21:56,623 INFO L226 Difference]: Without dead ends: 47 [2022-04-08 04:21:56,624 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-04-08 04:21:56,624 INFO L913 BasicCegarLoop]: 29 mSDtfsCounter, 35 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 54 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.4s IncrementalHoareTripleChecker+Time [2022-04-08 04:21:56,625 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 51 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 178 Invalid, 1 Unknown, 0 Unchecked, 7.4s Time] [2022-04-08 04:21:56,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-08 04:21:56,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-04-08 04:21:56,640 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:21:56,641 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 47 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 25 states have internal predecessors, (28), 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:21:56,641 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 47 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 25 states have internal predecessors, (28), 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:21:56,642 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 47 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 25 states have internal predecessors, (28), 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:21:56,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:21:56,644 INFO L93 Difference]: Finished difference Result 47 states and 63 transitions. [2022-04-08 04:21:56,645 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 63 transitions. [2022-04-08 04:21:56,645 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:21:56,645 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:21:56,646 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 25 states have internal predecessors, (28), 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 47 states. [2022-04-08 04:21:56,646 INFO L87 Difference]: Start difference. First operand has 47 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 25 states have internal predecessors, (28), 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 47 states. [2022-04-08 04:21:56,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:21:56,649 INFO L93 Difference]: Finished difference Result 47 states and 63 transitions. [2022-04-08 04:21:56,649 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 63 transitions. [2022-04-08 04:21:56,651 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:21:56,651 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:21:56,651 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:21:56,651 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:21:56,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 25 states have internal predecessors, (28), 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:21:56,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 63 transitions. [2022-04-08 04:21:56,655 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 63 transitions. Word has length 19 [2022-04-08 04:21:56,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:21:56,655 INFO L478 AbstractCegarLoop]: Abstraction has 47 states and 63 transitions. [2022-04-08 04:21:56,655 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 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:21:56,656 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 63 transitions. [2022-04-08 04:21:56,805 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:21:56,806 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 63 transitions. [2022-04-08 04:21:56,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-08 04:21:56,806 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:21:56,806 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] [2022-04-08 04:21:56,806 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 04:21:56,807 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:21:56,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:21:56,807 INFO L85 PathProgramCache]: Analyzing trace with hash -1182987237, now seen corresponding path program 1 times [2022-04-08 04:21:56,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:21:56,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [620128758] [2022-04-08 04:21:56,825 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 04:21:56,825 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-08 04:21:56,826 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 04:21:56,826 INFO L85 PathProgramCache]: Analyzing trace with hash -1182987237, now seen corresponding path program 2 times [2022-04-08 04:21:56,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:21:56,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164696621] [2022-04-08 04:21:56,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:21:56,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:21:56,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:21:57,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 04:21:57,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:21:57,058 INFO L290 TraceCheckUtils]: 0: Hoare triple {672#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {658#true} is VALID [2022-04-08 04:21:57,058 INFO L290 TraceCheckUtils]: 1: Hoare triple {658#true} assume true; {658#true} is VALID [2022-04-08 04:21:57,059 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {658#true} {658#true} #100#return; {658#true} is VALID [2022-04-08 04:21:57,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-08 04:21:57,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:21:57,066 INFO L290 TraceCheckUtils]: 0: Hoare triple {658#true} ~cond := #in~cond; {658#true} is VALID [2022-04-08 04:21:57,068 INFO L290 TraceCheckUtils]: 1: Hoare triple {658#true} assume !(0 == ~cond); {658#true} is VALID [2022-04-08 04:21:57,068 INFO L290 TraceCheckUtils]: 2: Hoare triple {658#true} assume true; {658#true} is VALID [2022-04-08 04:21:57,068 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {658#true} {658#true} #80#return; {658#true} is VALID [2022-04-08 04:21:57,069 INFO L272 TraceCheckUtils]: 0: Hoare triple {658#true} call ULTIMATE.init(); {672#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 04:21:57,069 INFO L290 TraceCheckUtils]: 1: Hoare triple {672#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {658#true} is VALID [2022-04-08 04:21:57,069 INFO L290 TraceCheckUtils]: 2: Hoare triple {658#true} assume true; {658#true} is VALID [2022-04-08 04:21:57,069 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {658#true} {658#true} #100#return; {658#true} is VALID [2022-04-08 04:21:57,069 INFO L272 TraceCheckUtils]: 4: Hoare triple {658#true} call #t~ret5 := main(); {658#true} is VALID [2022-04-08 04:21:57,070 INFO L290 TraceCheckUtils]: 5: Hoare triple {658#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {658#true} is VALID [2022-04-08 04:21:57,070 INFO L272 TraceCheckUtils]: 6: Hoare triple {658#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {658#true} is VALID [2022-04-08 04:21:57,070 INFO L290 TraceCheckUtils]: 7: Hoare triple {658#true} ~cond := #in~cond; {658#true} is VALID [2022-04-08 04:21:57,070 INFO L290 TraceCheckUtils]: 8: Hoare triple {658#true} assume !(0 == ~cond); {658#true} is VALID [2022-04-08 04:21:57,070 INFO L290 TraceCheckUtils]: 9: Hoare triple {658#true} assume true; {658#true} is VALID [2022-04-08 04:21:57,071 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {658#true} {658#true} #80#return; {658#true} is VALID [2022-04-08 04:21:57,071 INFO L290 TraceCheckUtils]: 11: Hoare triple {658#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {667#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-08 04:21:57,071 INFO L290 TraceCheckUtils]: 12: Hoare triple {667#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} assume !false; {667#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-08 04:21:57,072 INFO L290 TraceCheckUtils]: 13: Hoare triple {667#(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; {668#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-08 04:21:57,073 INFO L290 TraceCheckUtils]: 14: Hoare triple {668#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} assume !false; {668#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-08 04:21:57,073 INFO L290 TraceCheckUtils]: 15: Hoare triple {668#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {669#(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:21:57,074 INFO L290 TraceCheckUtils]: 16: Hoare triple {669#(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 !false; {669#(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:21:57,075 INFO L272 TraceCheckUtils]: 17: Hoare triple {669#(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)); {670#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 04:21:57,075 INFO L290 TraceCheckUtils]: 18: Hoare triple {670#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {671#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 04:21:57,075 INFO L290 TraceCheckUtils]: 19: Hoare triple {671#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {659#false} is VALID [2022-04-08 04:21:57,076 INFO L290 TraceCheckUtils]: 20: Hoare triple {659#false} assume !false; {659#false} is VALID [2022-04-08 04:21:57,076 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:21:57,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:21:57,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164696621] [2022-04-08 04:21:57,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164696621] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 04:21:57,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1603950786] [2022-04-08 04:21:57,076 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 04:21:57,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:21:57,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:21:57,078 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:21:57,079 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:21:57,110 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 04:21:57,111 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 04:21:57,112 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-08 04:21:57,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:21:57,124 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:21:57,856 INFO L272 TraceCheckUtils]: 0: Hoare triple {658#true} call ULTIMATE.init(); {658#true} is VALID [2022-04-08 04:21:57,856 INFO L290 TraceCheckUtils]: 1: Hoare triple {658#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); {658#true} is VALID [2022-04-08 04:21:57,856 INFO L290 TraceCheckUtils]: 2: Hoare triple {658#true} assume true; {658#true} is VALID [2022-04-08 04:21:57,856 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {658#true} {658#true} #100#return; {658#true} is VALID [2022-04-08 04:21:57,856 INFO L272 TraceCheckUtils]: 4: Hoare triple {658#true} call #t~ret5 := main(); {658#true} is VALID [2022-04-08 04:21:57,857 INFO L290 TraceCheckUtils]: 5: Hoare triple {658#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {658#true} is VALID [2022-04-08 04:21:57,857 INFO L272 TraceCheckUtils]: 6: Hoare triple {658#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {658#true} is VALID [2022-04-08 04:21:57,857 INFO L290 TraceCheckUtils]: 7: Hoare triple {658#true} ~cond := #in~cond; {658#true} is VALID [2022-04-08 04:21:57,857 INFO L290 TraceCheckUtils]: 8: Hoare triple {658#true} assume !(0 == ~cond); {658#true} is VALID [2022-04-08 04:21:57,857 INFO L290 TraceCheckUtils]: 9: Hoare triple {658#true} assume true; {658#true} is VALID [2022-04-08 04:21:57,857 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {658#true} {658#true} #80#return; {658#true} is VALID [2022-04-08 04:21:57,858 INFO L290 TraceCheckUtils]: 11: Hoare triple {658#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {668#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-08 04:21:57,859 INFO L290 TraceCheckUtils]: 12: Hoare triple {668#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} assume !false; {668#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-08 04:21:57,859 INFO L290 TraceCheckUtils]: 13: Hoare triple {668#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {668#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-08 04:21:57,860 INFO L290 TraceCheckUtils]: 14: Hoare triple {668#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} assume !false; {668#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-08 04:21:57,861 INFO L290 TraceCheckUtils]: 15: Hoare triple {668#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {669#(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:21:57,862 INFO L290 TraceCheckUtils]: 16: Hoare triple {669#(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 !false; {669#(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:21:57,864 INFO L272 TraceCheckUtils]: 17: Hoare triple {669#(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)); {727#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 04:21:57,864 INFO L290 TraceCheckUtils]: 18: Hoare triple {727#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {731#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:21:57,866 INFO L290 TraceCheckUtils]: 19: Hoare triple {731#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {659#false} is VALID [2022-04-08 04:21:57,866 INFO L290 TraceCheckUtils]: 20: Hoare triple {659#false} assume !false; {659#false} is VALID [2022-04-08 04:21:57,866 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:21:57,867 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 04:21:57,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1603950786] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:21:57,867 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-08 04:21:57,867 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 10 [2022-04-08 04:21:57,867 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:21:57,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [620128758] [2022-04-08 04:21:57,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [620128758] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:21:57,868 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:21:57,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 04:21:57,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868054925] [2022-04-08 04:21:57,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:21:57,868 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 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 21 [2022-04-08 04:21:57,869 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:21:57,869 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 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:21:57,890 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:21:57,891 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 04:21:57,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:21:57,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 04:21:57,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-04-08 04:21:57,892 INFO L87 Difference]: Start difference. First operand 47 states and 63 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 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:22:02,571 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:22:08,859 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:22:10,861 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:22:12,865 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:22:21,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:22:21,497 INFO L93 Difference]: Finished difference Result 76 states and 110 transitions. [2022-04-08 04:22:21,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 04:22:21,497 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 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 21 [2022-04-08 04:22:21,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:22:21,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 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:22:21,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 89 transitions. [2022-04-08 04:22:21,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 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:22:21,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 89 transitions. [2022-04-08 04:22:21,503 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 89 transitions. [2022-04-08 04:22:21,641 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:22:21,644 INFO L225 Difference]: With dead ends: 76 [2022-04-08 04:22:21,644 INFO L226 Difference]: Without dead ends: 70 [2022-04-08 04:22:21,644 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 22 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:22:21,645 INFO L913 BasicCegarLoop]: 39 mSDtfsCounter, 12 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 30 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.1s IncrementalHoareTripleChecker+Time [2022-04-08 04:22:21,645 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 145 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 114 Invalid, 4 Unknown, 0 Unchecked, 9.1s Time] [2022-04-08 04:22:21,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-04-08 04:22:21,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 62. [2022-04-08 04:22:21,676 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:22:21,678 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand has 62 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 26 states have call successors, (26), 6 states have call predecessors, (26), 5 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-08 04:22:21,680 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand has 62 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 26 states have call successors, (26), 6 states have call predecessors, (26), 5 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-08 04:22:21,681 INFO L87 Difference]: Start difference. First operand 70 states. Second operand has 62 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 26 states have call successors, (26), 6 states have call predecessors, (26), 5 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-08 04:22:21,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:22:21,685 INFO L93 Difference]: Finished difference Result 70 states and 100 transitions. [2022-04-08 04:22:21,685 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 100 transitions. [2022-04-08 04:22:21,686 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:22:21,686 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:22:21,687 INFO L74 IsIncluded]: Start isIncluded. First operand has 62 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 26 states have call successors, (26), 6 states have call predecessors, (26), 5 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) Second operand 70 states. [2022-04-08 04:22:21,687 INFO L87 Difference]: Start difference. First operand has 62 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 26 states have call successors, (26), 6 states have call predecessors, (26), 5 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) Second operand 70 states. [2022-04-08 04:22:21,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:22:21,690 INFO L93 Difference]: Finished difference Result 70 states and 100 transitions. [2022-04-08 04:22:21,690 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 100 transitions. [2022-04-08 04:22:21,691 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:22:21,691 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:22:21,691 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:22:21,695 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:22:21,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 26 states have call successors, (26), 6 states have call predecessors, (26), 5 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-08 04:22:21,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 86 transitions. [2022-04-08 04:22:21,698 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 86 transitions. Word has length 21 [2022-04-08 04:22:21,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:22:21,698 INFO L478 AbstractCegarLoop]: Abstraction has 62 states and 86 transitions. [2022-04-08 04:22:21,698 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 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:22:21,698 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 62 states and 86 transitions. [2022-04-08 04:22:22,009 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:22:22,010 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 86 transitions. [2022-04-08 04:22:22,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-08 04:22:22,011 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:22:22,011 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:22:22,027 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-08 04:22:22,216 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:22:22,228 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:22:22,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:22:22,229 INFO L85 PathProgramCache]: Analyzing trace with hash -1777258624, now seen corresponding path program 1 times [2022-04-08 04:22:22,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:22:22,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2044261769] [2022-04-08 04:22:22,230 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 04:22:22,230 INFO L85 PathProgramCache]: Analyzing trace with hash -1777258624, now seen corresponding path program 2 times [2022-04-08 04:22:22,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:22:22,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133465079] [2022-04-08 04:22:22,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:22:22,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:22:22,243 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 04:22:22,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [788279438] [2022-04-08 04:22:22,243 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 04:22:22,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:22:22,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:22:22,244 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:22:22,245 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:22:22,301 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 04:22:22,301 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 04:22:22,302 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-08 04:22:22,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:22:22,313 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:22:22,437 INFO L272 TraceCheckUtils]: 0: Hoare triple {1157#true} call ULTIMATE.init(); {1157#true} is VALID [2022-04-08 04:22:22,437 INFO L290 TraceCheckUtils]: 1: Hoare triple {1157#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); {1157#true} is VALID [2022-04-08 04:22:22,437 INFO L290 TraceCheckUtils]: 2: Hoare triple {1157#true} assume true; {1157#true} is VALID [2022-04-08 04:22:22,438 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1157#true} {1157#true} #100#return; {1157#true} is VALID [2022-04-08 04:22:22,438 INFO L272 TraceCheckUtils]: 4: Hoare triple {1157#true} call #t~ret5 := main(); {1157#true} is VALID [2022-04-08 04:22:22,438 INFO L290 TraceCheckUtils]: 5: Hoare triple {1157#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {1157#true} is VALID [2022-04-08 04:22:22,438 INFO L272 TraceCheckUtils]: 6: Hoare triple {1157#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {1157#true} is VALID [2022-04-08 04:22:22,438 INFO L290 TraceCheckUtils]: 7: Hoare triple {1157#true} ~cond := #in~cond; {1157#true} is VALID [2022-04-08 04:22:22,438 INFO L290 TraceCheckUtils]: 8: Hoare triple {1157#true} assume !(0 == ~cond); {1157#true} is VALID [2022-04-08 04:22:22,438 INFO L290 TraceCheckUtils]: 9: Hoare triple {1157#true} assume true; {1157#true} is VALID [2022-04-08 04:22:22,438 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1157#true} {1157#true} #80#return; {1157#true} is VALID [2022-04-08 04:22:22,439 INFO L290 TraceCheckUtils]: 11: Hoare triple {1157#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {1195#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-08 04:22:22,439 INFO L290 TraceCheckUtils]: 12: Hoare triple {1195#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} assume !false; {1195#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-08 04:22:22,440 INFO L290 TraceCheckUtils]: 13: Hoare triple {1195#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {1195#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-08 04:22:22,440 INFO L290 TraceCheckUtils]: 14: Hoare triple {1195#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} assume !false; {1195#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-08 04:22:22,440 INFO L272 TraceCheckUtils]: 15: Hoare triple {1195#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {1157#true} is VALID [2022-04-08 04:22:22,441 INFO L290 TraceCheckUtils]: 16: Hoare triple {1157#true} ~cond := #in~cond; {1157#true} is VALID [2022-04-08 04:22:22,441 INFO L290 TraceCheckUtils]: 17: Hoare triple {1157#true} assume !(0 == ~cond); {1157#true} is VALID [2022-04-08 04:22:22,441 INFO L290 TraceCheckUtils]: 18: Hoare triple {1157#true} assume true; {1157#true} is VALID [2022-04-08 04:22:22,442 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {1157#true} {1195#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} #82#return; {1195#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-08 04:22:22,442 INFO L272 TraceCheckUtils]: 20: Hoare triple {1195#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} call __VERIFIER_assert((if (~p~0 * ~p~0 + ~r~0 * ~q~0) % 4294967296 == ~n~0 * ~q~0 % 4294967296 then 1 else 0)); {1157#true} is VALID [2022-04-08 04:22:22,442 INFO L290 TraceCheckUtils]: 21: Hoare triple {1157#true} ~cond := #in~cond; {1157#true} is VALID [2022-04-08 04:22:22,442 INFO L290 TraceCheckUtils]: 22: Hoare triple {1157#true} assume !(0 == ~cond); {1157#true} is VALID [2022-04-08 04:22:22,442 INFO L290 TraceCheckUtils]: 23: Hoare triple {1157#true} assume true; {1157#true} is VALID [2022-04-08 04:22:22,443 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {1157#true} {1195#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} #84#return; {1195#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-08 04:22:22,444 INFO L272 TraceCheckUtils]: 25: Hoare triple {1195#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} call __VERIFIER_assert((if 0 == (~h~0 * ~h~0 * ~h~0 - 12 * ~h~0 * ~n~0 * ~q~0 + 16 * ~n~0 * ~p~0 * ~q~0 - ~h~0 * ~q~0 * ~q~0 - 4 * ~p~0 * ~q~0 * ~q~0 + 12 * ~h~0 * ~q~0 * ~r~0 - 16 * ~p~0 * ~q~0 * ~r~0) % 4294967296 then 1 else 0)); {1238#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 04:22:22,444 INFO L290 TraceCheckUtils]: 26: Hoare triple {1238#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1242#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:22:22,445 INFO L290 TraceCheckUtils]: 27: Hoare triple {1242#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1158#false} is VALID [2022-04-08 04:22:22,445 INFO L290 TraceCheckUtils]: 28: Hoare triple {1158#false} assume !false; {1158#false} is VALID [2022-04-08 04:22:22,445 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 04:22:22,445 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 04:22:22,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:22:22,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133465079] [2022-04-08 04:22:22,445 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 04:22:22,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [788279438] [2022-04-08 04:22:22,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [788279438] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:22:22,446 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:22:22,446 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 04:22:22,446 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:22:22,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2044261769] [2022-04-08 04:22:22,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2044261769] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:22:22,446 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:22:22,446 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 04:22:22,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975361664] [2022-04-08 04:22:22,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:22:22,447 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2022-04-08 04:22:22,447 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:22:22,447 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 04:22:22,468 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:22:22,468 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 04:22:22,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:22:22,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 04:22:22,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 04:22:22,469 INFO L87 Difference]: Start difference. First operand 62 states and 86 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 04:22:26,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:22:26,141 INFO L93 Difference]: Finished difference Result 73 states and 95 transitions. [2022-04-08 04:22:26,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 04:22:26,141 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2022-04-08 04:22:26,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:22:26,141 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 04:22:26,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-08 04:22:26,143 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 04:22:26,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-08 04:22:26,144 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 65 transitions. [2022-04-08 04:22:26,200 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:22:26,201 INFO L225 Difference]: With dead ends: 73 [2022-04-08 04:22:26,202 INFO L226 Difference]: Without dead ends: 50 [2022-04-08 04:22:26,202 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 25 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:22:26,203 INFO L913 BasicCegarLoop]: 44 mSDtfsCounter, 6 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-08 04:22:26,203 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 136 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-08 04:22:26,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-08 04:22:26,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-04-08 04:22:26,217 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:22:26,217 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 50 states, 25 states have (on average 1.24) internal successors, (31), 28 states have internal predecessors, (31), 20 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-08 04:22:26,218 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 50 states, 25 states have (on average 1.24) internal successors, (31), 28 states have internal predecessors, (31), 20 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-08 04:22:26,218 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 50 states, 25 states have (on average 1.24) internal successors, (31), 28 states have internal predecessors, (31), 20 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-08 04:22:26,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:22:26,220 INFO L93 Difference]: Finished difference Result 50 states and 68 transitions. [2022-04-08 04:22:26,220 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 68 transitions. [2022-04-08 04:22:26,220 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:22:26,220 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:22:26,221 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 25 states have (on average 1.24) internal successors, (31), 28 states have internal predecessors, (31), 20 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) Second operand 50 states. [2022-04-08 04:22:26,221 INFO L87 Difference]: Start difference. First operand has 50 states, 25 states have (on average 1.24) internal successors, (31), 28 states have internal predecessors, (31), 20 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) Second operand 50 states. [2022-04-08 04:22:26,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:22:26,223 INFO L93 Difference]: Finished difference Result 50 states and 68 transitions. [2022-04-08 04:22:26,223 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 68 transitions. [2022-04-08 04:22:26,223 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:22:26,223 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:22:26,223 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:22:26,223 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:22:26,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 25 states have (on average 1.24) internal successors, (31), 28 states have internal predecessors, (31), 20 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-08 04:22:26,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 68 transitions. [2022-04-08 04:22:26,225 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 68 transitions. Word has length 29 [2022-04-08 04:22:26,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:22:26,225 INFO L478 AbstractCegarLoop]: Abstraction has 50 states and 68 transitions. [2022-04-08 04:22:26,226 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 04:22:26,226 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 68 transitions. [2022-04-08 04:22:26,413 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:22:26,413 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 68 transitions. [2022-04-08 04:22:26,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-08 04:22:26,413 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:22:26,414 INFO L499 BasicCegarLoop]: trace histogram [3, 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] [2022-04-08 04:22:26,419 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-08 04:22:26,614 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,SelfDestructingSolverStorable3 [2022-04-08 04:22:26,614 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:22:26,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:22:26,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1684913467, now seen corresponding path program 1 times [2022-04-08 04:22:26,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:22:26,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [29029842] [2022-04-08 04:22:26,617 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 04:22:26,617 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-08 04:22:26,617 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 04:22:26,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1684913467, now seen corresponding path program 2 times [2022-04-08 04:22:26,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:22:26,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848701759] [2022-04-08 04:22:26,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:22:26,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:22:26,629 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 04:22:26,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1851816667] [2022-04-08 04:22:26,630 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 04:22:26,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:22:26,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:22:26,638 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:22:26,639 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:22:26,695 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 04:22:26,695 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 04:22:26,696 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 04:22:26,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:22:26,707 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:22:26,810 INFO L272 TraceCheckUtils]: 0: Hoare triple {1596#true} call ULTIMATE.init(); {1596#true} is VALID [2022-04-08 04:22:26,810 INFO L290 TraceCheckUtils]: 1: Hoare triple {1596#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); {1596#true} is VALID [2022-04-08 04:22:26,811 INFO L290 TraceCheckUtils]: 2: Hoare triple {1596#true} assume true; {1596#true} is VALID [2022-04-08 04:22:26,811 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1596#true} {1596#true} #100#return; {1596#true} is VALID [2022-04-08 04:22:26,811 INFO L272 TraceCheckUtils]: 4: Hoare triple {1596#true} call #t~ret5 := main(); {1596#true} is VALID [2022-04-08 04:22:26,812 INFO L290 TraceCheckUtils]: 5: Hoare triple {1596#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {1596#true} is VALID [2022-04-08 04:22:26,812 INFO L272 TraceCheckUtils]: 6: Hoare triple {1596#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {1596#true} is VALID [2022-04-08 04:22:26,812 INFO L290 TraceCheckUtils]: 7: Hoare triple {1596#true} ~cond := #in~cond; {1596#true} is VALID [2022-04-08 04:22:26,812 INFO L290 TraceCheckUtils]: 8: Hoare triple {1596#true} assume !(0 == ~cond); {1596#true} is VALID [2022-04-08 04:22:26,812 INFO L290 TraceCheckUtils]: 9: Hoare triple {1596#true} assume true; {1596#true} is VALID [2022-04-08 04:22:26,812 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1596#true} {1596#true} #80#return; {1596#true} is VALID [2022-04-08 04:22:26,813 INFO L290 TraceCheckUtils]: 11: Hoare triple {1596#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {1634#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-08 04:22:26,813 INFO L290 TraceCheckUtils]: 12: Hoare triple {1634#(and (= main_~p~0 0) (= main_~h~0 0))} assume !false; {1634#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-08 04:22:26,813 INFO L290 TraceCheckUtils]: 13: Hoare triple {1634#(and (= main_~p~0 0) (= main_~h~0 0))} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {1634#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-08 04:22:26,814 INFO L290 TraceCheckUtils]: 14: Hoare triple {1634#(and (= main_~p~0 0) (= main_~h~0 0))} assume !false; {1634#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-08 04:22:26,814 INFO L290 TraceCheckUtils]: 15: Hoare triple {1634#(and (= main_~p~0 0) (= main_~h~0 0))} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {1634#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-08 04:22:26,814 INFO L290 TraceCheckUtils]: 16: Hoare triple {1634#(and (= main_~p~0 0) (= main_~h~0 0))} assume !false; {1634#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-08 04:22:26,814 INFO L272 TraceCheckUtils]: 17: Hoare triple {1634#(and (= main_~p~0 0) (= main_~h~0 0))} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {1596#true} is VALID [2022-04-08 04:22:26,815 INFO L290 TraceCheckUtils]: 18: Hoare triple {1596#true} ~cond := #in~cond; {1596#true} is VALID [2022-04-08 04:22:26,815 INFO L290 TraceCheckUtils]: 19: Hoare triple {1596#true} assume !(0 == ~cond); {1596#true} is VALID [2022-04-08 04:22:26,815 INFO L290 TraceCheckUtils]: 20: Hoare triple {1596#true} assume true; {1596#true} is VALID [2022-04-08 04:22:26,815 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1596#true} {1634#(and (= main_~p~0 0) (= main_~h~0 0))} #82#return; {1634#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-08 04:22:26,816 INFO L272 TraceCheckUtils]: 22: Hoare triple {1634#(and (= main_~p~0 0) (= main_~h~0 0))} call __VERIFIER_assert((if (~p~0 * ~p~0 + ~r~0 * ~q~0) % 4294967296 == ~n~0 * ~q~0 % 4294967296 then 1 else 0)); {1596#true} is VALID [2022-04-08 04:22:26,816 INFO L290 TraceCheckUtils]: 23: Hoare triple {1596#true} ~cond := #in~cond; {1596#true} is VALID [2022-04-08 04:22:26,816 INFO L290 TraceCheckUtils]: 24: Hoare triple {1596#true} assume !(0 == ~cond); {1596#true} is VALID [2022-04-08 04:22:26,816 INFO L290 TraceCheckUtils]: 25: Hoare triple {1596#true} assume true; {1596#true} is VALID [2022-04-08 04:22:26,817 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1596#true} {1634#(and (= main_~p~0 0) (= main_~h~0 0))} #84#return; {1634#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-08 04:22:26,818 INFO L272 TraceCheckUtils]: 27: Hoare triple {1634#(and (= main_~p~0 0) (= main_~h~0 0))} call __VERIFIER_assert((if 0 == (~h~0 * ~h~0 * ~h~0 - 12 * ~h~0 * ~n~0 * ~q~0 + 16 * ~n~0 * ~p~0 * ~q~0 - ~h~0 * ~q~0 * ~q~0 - 4 * ~p~0 * ~q~0 * ~q~0 + 12 * ~h~0 * ~q~0 * ~r~0 - 16 * ~p~0 * ~q~0 * ~r~0) % 4294967296 then 1 else 0)); {1683#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 04:22:26,819 INFO L290 TraceCheckUtils]: 28: Hoare triple {1683#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1687#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:22:26,819 INFO L290 TraceCheckUtils]: 29: Hoare triple {1687#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1597#false} is VALID [2022-04-08 04:22:26,819 INFO L290 TraceCheckUtils]: 30: Hoare triple {1597#false} assume !false; {1597#false} is VALID [2022-04-08 04:22:26,819 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-08 04:22:26,819 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 04:22:26,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:22:26,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848701759] [2022-04-08 04:22:26,820 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 04:22:26,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1851816667] [2022-04-08 04:22:26,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1851816667] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:22:26,820 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:22:26,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 04:22:26,820 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:22:26,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [29029842] [2022-04-08 04:22:26,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [29029842] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:22:26,820 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:22:26,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 04:22:26,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473264759] [2022-04-08 04:22:26,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:22:26,821 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 31 [2022-04-08 04:22:26,821 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:22:26,821 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), 4 states have internal predecessors, (17), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 04:22:26,839 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:22:26,839 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 04:22:26,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:22:26,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 04:22:26,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 04:22:26,840 INFO L87 Difference]: Start difference. First operand 50 states and 68 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 04:22:37,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:22:37,691 INFO L93 Difference]: Finished difference Result 67 states and 89 transitions. [2022-04-08 04:22:37,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 04:22:37,691 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 31 [2022-04-08 04:22:37,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:22:37,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 04:22:37,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 63 transitions. [2022-04-08 04:22:37,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 04:22:37,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 63 transitions. [2022-04-08 04:22:37,693 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 63 transitions. [2022-04-08 04:22:37,798 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:22:37,800 INFO L225 Difference]: With dead ends: 67 [2022-04-08 04:22:37,800 INFO L226 Difference]: Without dead ends: 64 [2022-04-08 04:22:37,800 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 04:22:37,801 INFO L913 BasicCegarLoop]: 46 mSDtfsCounter, 6 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-04-08 04:22:37,801 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 142 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-04-08 04:22:37,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-04-08 04:22:37,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2022-04-08 04:22:37,838 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:22:37,838 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand has 64 states, 32 states have (on average 1.1875) internal successors, (38), 34 states have internal predecessors, (38), 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:22:37,838 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand has 64 states, 32 states have (on average 1.1875) internal successors, (38), 34 states have internal predecessors, (38), 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:22:37,838 INFO L87 Difference]: Start difference. First operand 64 states. Second operand has 64 states, 32 states have (on average 1.1875) internal successors, (38), 34 states have internal predecessors, (38), 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:22:37,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:22:37,840 INFO L93 Difference]: Finished difference Result 64 states and 85 transitions. [2022-04-08 04:22:37,841 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 85 transitions. [2022-04-08 04:22:37,841 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:22:37,841 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:22:37,841 INFO L74 IsIncluded]: Start isIncluded. First operand has 64 states, 32 states have (on average 1.1875) internal successors, (38), 34 states have internal predecessors, (38), 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 64 states. [2022-04-08 04:22:37,841 INFO L87 Difference]: Start difference. First operand has 64 states, 32 states have (on average 1.1875) internal successors, (38), 34 states have internal predecessors, (38), 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 64 states. [2022-04-08 04:22:37,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:22:37,844 INFO L93 Difference]: Finished difference Result 64 states and 85 transitions. [2022-04-08 04:22:37,844 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 85 transitions. [2022-04-08 04:22:37,844 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:22:37,844 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:22:37,844 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:22:37,844 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:22:37,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 32 states have (on average 1.1875) internal successors, (38), 34 states have internal predecessors, (38), 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:22:37,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 85 transitions. [2022-04-08 04:22:37,846 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 85 transitions. Word has length 31 [2022-04-08 04:22:37,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:22:37,847 INFO L478 AbstractCegarLoop]: Abstraction has 64 states and 85 transitions. [2022-04-08 04:22:37,847 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 04:22:37,847 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 64 states and 85 transitions. [2022-04-08 04:22:38,127 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:22:38,127 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 85 transitions. [2022-04-08 04:22:38,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-04-08 04:22:38,128 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:22:38,128 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] [2022-04-08 04:22:38,132 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:22:38,328 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:22:38,329 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:22:38,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:22:38,329 INFO L85 PathProgramCache]: Analyzing trace with hash -1928736347, now seen corresponding path program 1 times [2022-04-08 04:22:38,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:22:38,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [243850825] [2022-04-08 04:22:38,331 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 04:22:38,331 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-08 04:22:38,331 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 04:22:38,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1928736347, now seen corresponding path program 2 times [2022-04-08 04:22:38,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:22:38,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339294075] [2022-04-08 04:22:38,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:22:38,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:22:38,342 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 04:22:38,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1309295499] [2022-04-08 04:22:38,342 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 04:22:38,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:22:38,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:22:38,348 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:22:38,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process