/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_unwindbound2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-5d317bd [2022-03-19 03:45:23,232 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-19 03:45:23,233 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-19 03:45:23,258 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-19 03:45:23,258 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-19 03:45:23,259 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-19 03:45:23,265 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-19 03:45:23,270 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-19 03:45:23,271 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-19 03:45:23,274 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-19 03:45:23,274 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-19 03:45:23,275 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-19 03:45:23,275 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-19 03:45:23,276 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-19 03:45:23,276 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-19 03:45:23,277 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-19 03:45:23,277 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-19 03:45:23,278 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-19 03:45:23,278 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-19 03:45:23,279 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-19 03:45:23,280 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-03-19 03:45:23,282 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-19 03:45:23,284 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-19 03:45:23,285 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-19 03:45:23,286 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-19 03:45:23,292 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-19 03:45:23,292 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-19 03:45:23,292 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-19 03:45:23,293 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-19 03:45:23,293 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-19 03:45:23,294 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-19 03:45:23,294 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-19 03:45:23,295 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-19 03:45:23,296 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-19 03:45:23,296 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-19 03:45:23,297 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-19 03:45:23,297 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-19 03:45:23,297 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-19 03:45:23,297 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-19 03:45:23,297 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-19 03:45:23,298 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-19 03:45:23,300 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-19 03:45:23,300 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-03-19 03:45:23,309 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-19 03:45:23,309 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-19 03:45:23,311 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-19 03:45:23,311 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-19 03:45:23,311 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-19 03:45:23,311 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-19 03:45:23,311 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-19 03:45:23,311 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-19 03:45:23,311 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-19 03:45:23,312 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-19 03:45:23,312 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-19 03:45:23,312 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-19 03:45:23,312 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-19 03:45:23,312 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-19 03:45:23,312 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-19 03:45:23,312 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-19 03:45:23,312 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-19 03:45:23,312 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-19 03:45:23,313 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-19 03:45:23,313 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-19 03:45:23,313 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-03-19 03:45:23,313 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-03-19 03:45:23,313 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-03-19 03:45:23,313 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-19 03:45:23,313 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-03-19 03:45:23,313 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-03-19 03:45:23,529 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-19 03:45:23,551 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-19 03:45:23,553 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-19 03:45:23,555 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-19 03:45:23,557 INFO L275 PluginConnector]: CDTParser initialized [2022-03-19 03:45:23,558 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_unwindbound2.c [2022-03-19 03:45:23,644 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6177e8770/5ac6994c67bc4675b5ddc4addd75e898/FLAG67e024f9c [2022-03-19 03:45:24,235 INFO L306 CDTParser]: Found 1 translation units. [2022-03-19 03:45:24,236 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_unwindbound2.c [2022-03-19 03:45:24,243 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6177e8770/5ac6994c67bc4675b5ddc4addd75e898/FLAG67e024f9c [2022-03-19 03:45:24,593 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6177e8770/5ac6994c67bc4675b5ddc4addd75e898 [2022-03-19 03:45:24,595 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-19 03:45:24,596 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-03-19 03:45:24,598 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-19 03:45:24,598 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-19 03:45:24,601 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-19 03:45:24,602 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.03 03:45:24" (1/1) ... [2022-03-19 03:45:24,603 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@636f911 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 03:45:24, skipping insertion in model container [2022-03-19 03:45:24,603 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.03 03:45:24" (1/1) ... [2022-03-19 03:45:24,608 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-19 03:45:24,625 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-19 03:45:24,776 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_unwindbound2.c[525,538] [2022-03-19 03:45:24,796 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-19 03:45:24,802 INFO L203 MainTranslator]: Completed pre-run [2022-03-19 03:45:24,812 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_unwindbound2.c[525,538] [2022-03-19 03:45:24,823 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-19 03:45:24,834 INFO L208 MainTranslator]: Completed translation [2022-03-19 03:45:24,835 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 03:45:24 WrapperNode [2022-03-19 03:45:24,835 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-19 03:45:24,836 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-19 03:45:24,836 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-19 03:45:24,836 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-19 03:45:24,848 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 03:45:24" (1/1) ... [2022-03-19 03:45:24,848 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 03:45:24" (1/1) ... [2022-03-19 03:45:24,853 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 03:45:24" (1/1) ... [2022-03-19 03:45:24,853 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 03:45:24" (1/1) ... [2022-03-19 03:45:24,857 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 03:45:24" (1/1) ... [2022-03-19 03:45:24,866 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 03:45:24" (1/1) ... [2022-03-19 03:45:24,867 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 03:45:24" (1/1) ... [2022-03-19 03:45:24,869 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-19 03:45:24,869 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-19 03:45:24,869 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-19 03:45:24,870 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-19 03:45:24,884 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 03:45:24" (1/1) ... [2022-03-19 03:45:24,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-19 03:45:24,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-19 03:45:24,934 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-03-19 03:45:24,955 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-03-19 03:45:24,986 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-03-19 03:45:24,987 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-19 03:45:24,987 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-03-19 03:45:24,987 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-03-19 03:45:24,987 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-03-19 03:45:24,987 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-03-19 03:45:24,988 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-03-19 03:45:24,988 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-03-19 03:45:24,988 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-03-19 03:45:24,989 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-19 03:45:24,989 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-03-19 03:45:24,990 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-03-19 03:45:24,990 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-03-19 03:45:24,990 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-03-19 03:45:24,990 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-03-19 03:45:24,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-19 03:45:24,990 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-19 03:45:24,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-19 03:45:24,990 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-19 03:45:24,991 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-19 03:45:25,051 INFO L234 CfgBuilder]: Building ICFG [2022-03-19 03:45:25,053 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-19 03:45:25,275 INFO L275 CfgBuilder]: Performing block encoding [2022-03-19 03:45:25,280 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-19 03:45:25,280 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-03-19 03:45:25,282 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.03 03:45:25 BoogieIcfgContainer [2022-03-19 03:45:25,282 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-19 03:45:25,283 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-19 03:45:25,283 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-19 03:45:25,301 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-19 03:45:25,301 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.03 03:45:24" (1/3) ... [2022-03-19 03:45:25,302 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c7fb7dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.03 03:45:25, skipping insertion in model container [2022-03-19 03:45:25,302 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 03:45:24" (2/3) ... [2022-03-19 03:45:25,302 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c7fb7dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.03 03:45:25, skipping insertion in model container [2022-03-19 03:45:25,302 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.03 03:45:25" (3/3) ... [2022-03-19 03:45:25,303 INFO L111 eAbstractionObserver]: Analyzing ICFG dijkstra-u_unwindbound2.c [2022-03-19 03:45:25,307 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-03-19 03:45:25,307 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-19 03:45:25,365 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-19 03:45:25,370 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-03-19 03:45:25,370 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-03-19 03:45:25,391 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 22 states have internal predecessors, (31), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-03-19 03:45:25,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-19 03:45:25,397 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 03:45:25,398 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 03:45:25,398 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 03:45:25,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 03:45:25,406 INFO L85 PathProgramCache]: Analyzing trace with hash -2024343623, now seen corresponding path program 1 times [2022-03-19 03:45:25,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 03:45:25,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [540319116] [2022-03-19 03:45:25,424 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 03:45:25,424 INFO L85 PathProgramCache]: Analyzing trace with hash -2024343623, now seen corresponding path program 2 times [2022-03-19 03:45:25,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 03:45:25,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844500470] [2022-03-19 03:45:25,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 03:45:25,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 03:45:25,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 03:45:25,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 03:45:25,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 03:45:25,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-19 03:45:25,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 03:45:25,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 03:45:25,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 03:45:25,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844500470] [2022-03-19 03:45:25,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844500470] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 03:45:25,617 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 03:45:25,617 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-19 03:45:25,619 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 03:45:25,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [540319116] [2022-03-19 03:45:25,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [540319116] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 03:45:25,621 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 03:45:25,621 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-19 03:45:25,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732848539] [2022-03-19 03:45:25,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 03:45:25,626 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-19 03:45:25,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 03:45:25,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-19 03:45:25,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-19 03:45:25,653 INFO L87 Difference]: Start difference. First operand has 39 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 22 states have internal predecessors, (31), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-03-19 03:45:26,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 03:45:26,305 INFO L93 Difference]: Finished difference Result 70 states and 111 transitions. [2022-03-19 03:45:26,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-19 03:45:26,308 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-03-19 03:45:26,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 03:45:26,313 INFO L225 Difference]: With dead ends: 70 [2022-03-19 03:45:26,314 INFO L226 Difference]: Without dead ends: 35 [2022-03-19 03:45:26,316 INFO L911 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-03-19 03:45:26,318 INFO L912 BasicCegarLoop]: 49 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-19 03:45:26,318 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 53 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-19 03:45:26,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-03-19 03:45:26,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2022-03-19 03:45:26,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-03-19 03:45:26,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 46 transitions. [2022-03-19 03:45:26,370 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 46 transitions. Word has length 18 [2022-03-19 03:45:26,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 03:45:26,370 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 46 transitions. [2022-03-19 03:45:26,371 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-03-19 03:45:26,371 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 46 transitions. [2022-03-19 03:45:26,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-19 03:45:26,371 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 03:45:26,371 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 03:45:26,372 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-19 03:45:26,372 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 03:45:26,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 03:45:26,372 INFO L85 PathProgramCache]: Analyzing trace with hash -96361696, now seen corresponding path program 1 times [2022-03-19 03:45:26,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 03:45:26,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1483801214] [2022-03-19 03:45:26,373 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 03:45:26,373 INFO L85 PathProgramCache]: Analyzing trace with hash -96361696, now seen corresponding path program 2 times [2022-03-19 03:45:26,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 03:45:26,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922925711] [2022-03-19 03:45:26,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 03:45:26,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 03:45:26,385 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-19 03:45:26,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [41403038] [2022-03-19 03:45:26,386 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-19 03:45:26,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-19 03:45:26,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-19 03:45:26,423 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-03-19 03:45:26,452 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-03-19 03:45:26,488 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-19 03:45:26,488 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-19 03:45:26,490 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 5 conjunts are in the unsatisfiable core [2022-03-19 03:45:26,493 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-19 03:45:26,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 03:45:26,558 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-19 03:45:26,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 03:45:26,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922925711] [2022-03-19 03:45:26,559 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-19 03:45:26,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [41403038] [2022-03-19 03:45:26,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [41403038] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 03:45:26,559 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 03:45:26,559 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-19 03:45:26,560 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 03:45:26,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1483801214] [2022-03-19 03:45:26,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1483801214] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 03:45:26,600 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 03:45:26,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-19 03:45:26,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387758825] [2022-03-19 03:45:26,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 03:45:26,602 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-19 03:45:26,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 03:45:26,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-19 03:45:26,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-19 03:45:26,603 INFO L87 Difference]: Start difference. First operand 34 states and 46 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-03-19 03:45:26,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 03:45:26,639 INFO L93 Difference]: Finished difference Result 55 states and 78 transitions. [2022-03-19 03:45:26,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-19 03:45:26,643 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-03-19 03:45:26,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 03:45:26,644 INFO L225 Difference]: With dead ends: 55 [2022-03-19 03:45:26,644 INFO L226 Difference]: Without dead ends: 36 [2022-03-19 03:45:26,647 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-19 03:45:26,648 INFO L912 BasicCegarLoop]: 44 mSDtfsCounter, 0 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-19 03:45:26,648 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 119 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-19 03:45:26,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-03-19 03:45:26,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-03-19 03:45:26,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-03-19 03:45:26,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 48 transitions. [2022-03-19 03:45:26,659 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 48 transitions. Word has length 20 [2022-03-19 03:45:26,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 03:45:26,660 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 48 transitions. [2022-03-19 03:45:26,660 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-03-19 03:45:26,660 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 48 transitions. [2022-03-19 03:45:26,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-19 03:45:26,661 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 03:45:26,661 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 03:45:26,691 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-03-19 03:45:26,892 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-19 03:45:26,893 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 03:45:26,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 03:45:26,893 INFO L85 PathProgramCache]: Analyzing trace with hash 962099791, now seen corresponding path program 1 times [2022-03-19 03:45:26,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 03:45:26,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1854681298] [2022-03-19 03:45:26,896 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 03:45:26,897 INFO L85 PathProgramCache]: Analyzing trace with hash 962099791, now seen corresponding path program 2 times [2022-03-19 03:45:26,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 03:45:26,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270596491] [2022-03-19 03:45:26,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 03:45:26,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 03:45:26,913 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-19 03:45:26,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1103764868] [2022-03-19 03:45:26,913 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-19 03:45:26,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-19 03:45:26,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-19 03:45:26,915 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-03-19 03:45:26,916 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-03-19 03:45:26,947 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-19 03:45:26,947 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-19 03:45:26,948 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-19 03:45:26,949 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-19 03:45:27,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 03:45:27,046 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-19 03:45:27,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 03:45:27,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270596491] [2022-03-19 03:45:27,047 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-19 03:45:27,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1103764868] [2022-03-19 03:45:27,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1103764868] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 03:45:27,047 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 03:45:27,047 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-19 03:45:27,048 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 03:45:27,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1854681298] [2022-03-19 03:45:27,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1854681298] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 03:45:27,048 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 03:45:27,048 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-19 03:45:27,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504215650] [2022-03-19 03:45:27,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 03:45:27,049 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-19 03:45:27,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 03:45:27,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-19 03:45:27,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-03-19 03:45:27,050 INFO L87 Difference]: Start difference. First operand 36 states and 48 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-03-19 03:45:27,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 03:45:27,090 INFO L93 Difference]: Finished difference Result 49 states and 64 transitions. [2022-03-19 03:45:27,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-19 03:45:27,093 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2022-03-19 03:45:27,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 03:45:27,095 INFO L225 Difference]: With dead ends: 49 [2022-03-19 03:45:27,095 INFO L226 Difference]: Without dead ends: 40 [2022-03-19 03:45:27,095 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-03-19 03:45:27,096 INFO L912 BasicCegarLoop]: 43 mSDtfsCounter, 7 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-19 03:45:27,096 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 149 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-19 03:45:27,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-03-19 03:45:27,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2022-03-19 03:45:27,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-03-19 03:45:27,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 52 transitions. [2022-03-19 03:45:27,103 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 52 transitions. Word has length 21 [2022-03-19 03:45:27,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 03:45:27,104 INFO L478 AbstractCegarLoop]: Abstraction has 39 states and 52 transitions. [2022-03-19 03:45:27,104 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-03-19 03:45:27,105 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 52 transitions. [2022-03-19 03:45:27,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-19 03:45:27,105 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 03:45:27,105 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 03:45:27,129 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-03-19 03:45:27,319 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-03-19 03:45:27,320 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 03:45:27,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 03:45:27,320 INFO L85 PathProgramCache]: Analyzing trace with hash 963589341, now seen corresponding path program 1 times [2022-03-19 03:45:27,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 03:45:27,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1836634089] [2022-03-19 03:45:27,321 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 03:45:27,321 INFO L85 PathProgramCache]: Analyzing trace with hash 963589341, now seen corresponding path program 2 times [2022-03-19 03:45:27,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 03:45:27,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85933244] [2022-03-19 03:45:27,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 03:45:27,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 03:45:27,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 03:45:27,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 03:45:27,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 03:45:27,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-19 03:45:27,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 03:45:27,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 03:45:27,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 03:45:27,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85933244] [2022-03-19 03:45:27,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85933244] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 03:45:27,544 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 03:45:27,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-03-19 03:45:27,545 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 03:45:27,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1836634089] [2022-03-19 03:45:27,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1836634089] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 03:45:27,545 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 03:45:27,545 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-03-19 03:45:27,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693704468] [2022-03-19 03:45:27,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 03:45:27,546 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-19 03:45:27,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 03:45:27,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-19 03:45:27,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-03-19 03:45:27,546 INFO L87 Difference]: Start difference. First operand 39 states and 52 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-03-19 03:45:31,272 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-03-19 03:45:33,764 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-03-19 03:45:35,869 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-03-19 03:45:37,905 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-03-19 03:45:37,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 03:45:37,918 INFO L93 Difference]: Finished difference Result 72 states and 104 transitions. [2022-03-19 03:45:37,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-19 03:45:37,919 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2022-03-19 03:45:37,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 03:45:37,921 INFO L225 Difference]: With dead ends: 72 [2022-03-19 03:45:37,921 INFO L226 Difference]: Without dead ends: 51 [2022-03-19 03:45:37,921 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-03-19 03:45:37,922 INFO L912 BasicCegarLoop]: 45 mSDtfsCounter, 24 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 40 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.3s IncrementalHoareTripleChecker+Time [2022-03-19 03:45:37,923 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 133 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 163 Invalid, 4 Unknown, 0 Unchecked, 10.3s Time] [2022-03-19 03:45:37,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-03-19 03:45:37,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-03-19 03:45:37,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 29 states have internal predecessors, (34), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-03-19 03:45:37,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 69 transitions. [2022-03-19 03:45:37,935 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 69 transitions. Word has length 21 [2022-03-19 03:45:37,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 03:45:37,935 INFO L478 AbstractCegarLoop]: Abstraction has 51 states and 69 transitions. [2022-03-19 03:45:37,935 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-03-19 03:45:37,935 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 69 transitions. [2022-03-19 03:45:37,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-19 03:45:37,936 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 03:45:37,936 INFO L500 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 03:45:37,936 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-03-19 03:45:37,936 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 03:45:37,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 03:45:37,937 INFO L85 PathProgramCache]: Analyzing trace with hash -1701877900, now seen corresponding path program 1 times [2022-03-19 03:45:37,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 03:45:37,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1474272315] [2022-03-19 03:45:37,962 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-03-19 03:45:37,962 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-03-19 03:45:37,962 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-03-19 03:45:37,962 INFO L85 PathProgramCache]: Analyzing trace with hash -1701877900, now seen corresponding path program 2 times [2022-03-19 03:45:37,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 03:45:37,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699081004] [2022-03-19 03:45:37,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 03:45:37,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 03:45:37,975 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-19 03:45:37,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [267101094] [2022-03-19 03:45:37,975 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-19 03:45:37,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-19 03:45:37,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-19 03:45:37,977 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-03-19 03:45:37,994 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-03-19 03:45:38,027 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-19 03:45:38,027 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-19 03:45:38,029 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-19 03:45:38,030 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-19 03:45:38,122 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-19 03:45:38,123 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-19 03:45:38,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 03:45:38,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699081004] [2022-03-19 03:45:38,123 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-19 03:45:38,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [267101094] [2022-03-19 03:45:38,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [267101094] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 03:45:38,123 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 03:45:38,123 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-19 03:45:38,124 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 03:45:38,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1474272315] [2022-03-19 03:45:38,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1474272315] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 03:45:38,124 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 03:45:38,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-19 03:45:38,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174746468] [2022-03-19 03:45:38,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 03:45:38,124 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-19 03:45:38,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 03:45:38,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-19 03:45:38,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-03-19 03:45:38,125 INFO L87 Difference]: Start difference. First operand 51 states and 69 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-03-19 03:45:38,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 03:45:38,493 INFO L93 Difference]: Finished difference Result 73 states and 99 transitions. [2022-03-19 03:45:38,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-19 03:45:38,494 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2022-03-19 03:45:38,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 03:45:38,495 INFO L225 Difference]: With dead ends: 73 [2022-03-19 03:45:38,495 INFO L226 Difference]: Without dead ends: 52 [2022-03-19 03:45:38,496 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-03-19 03:45:38,496 INFO L912 BasicCegarLoop]: 51 mSDtfsCounter, 8 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-19 03:45:38,497 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 175 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-19 03:45:38,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-03-19 03:45:38,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-03-19 03:45:38,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 29 states have internal predecessors, (35), 20 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-03-19 03:45:38,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 72 transitions. [2022-03-19 03:45:38,509 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 72 transitions. Word has length 23 [2022-03-19 03:45:38,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 03:45:38,509 INFO L478 AbstractCegarLoop]: Abstraction has 52 states and 72 transitions. [2022-03-19 03:45:38,509 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-03-19 03:45:38,510 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 72 transitions. [2022-03-19 03:45:38,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-19 03:45:38,510 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 03:45:38,510 INFO L500 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 03:45:38,549 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-03-19 03:45:38,739 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-03-19 03:45:38,739 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 03:45:38,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 03:45:38,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1700388350, now seen corresponding path program 1 times [2022-03-19 03:45:38,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 03:45:38,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1107270203] [2022-03-19 03:45:38,743 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-03-19 03:45:38,743 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-03-19 03:45:38,743 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-03-19 03:45:38,749 INFO L85 PathProgramCache]: Analyzing trace with hash -1700388350, now seen corresponding path program 2 times [2022-03-19 03:45:38,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 03:45:38,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211522193] [2022-03-19 03:45:38,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 03:45:38,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 03:45:38,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 03:45:38,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 03:45:38,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 03:45:38,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-19 03:45:38,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 03:45:38,838 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 03:45:38,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 03:45:38,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211522193] [2022-03-19 03:45:38,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211522193] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-19 03:45:38,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [391872390] [2022-03-19 03:45:38,839 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-19 03:45:38,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-19 03:45:38,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-19 03:45:38,852 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-03-19 03:45:38,854 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-03-19 03:45:38,899 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-19 03:45:38,899 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-19 03:45:38,900 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 4 conjunts are in the unsatisfiable core [2022-03-19 03:45:38,901 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-19 03:45:38,970 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-19 03:45:38,970 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-19 03:45:38,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [391872390] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 03:45:38,971 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-19 03:45:38,971 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2022-03-19 03:45:38,971 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 03:45:38,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1107270203] [2022-03-19 03:45:38,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1107270203] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 03:45:38,972 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 03:45:38,972 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-19 03:45:38,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204992463] [2022-03-19 03:45:38,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 03:45:38,973 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-19 03:45:38,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 03:45:38,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-19 03:45:38,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-03-19 03:45:38,974 INFO L87 Difference]: Start difference. First operand 52 states and 72 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-03-19 03:45:39,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 03:45:39,218 INFO L93 Difference]: Finished difference Result 98 states and 135 transitions. [2022-03-19 03:45:39,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-19 03:45:39,219 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2022-03-19 03:45:39,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 03:45:39,220 INFO L225 Difference]: With dead ends: 98 [2022-03-19 03:45:39,220 INFO L226 Difference]: Without dead ends: 64 [2022-03-19 03:45:39,221 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-03-19 03:45:39,221 INFO L912 BasicCegarLoop]: 45 mSDtfsCounter, 8 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-19 03:45:39,222 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 170 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-19 03:45:39,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-03-19 03:45:39,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2022-03-19 03:45:39,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 36 states have internal predecessors, (42), 22 states have call successors, (22), 7 states have call predecessors, (22), 5 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-03-19 03:45:39,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 82 transitions. [2022-03-19 03:45:39,229 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 82 transitions. Word has length 23 [2022-03-19 03:45:39,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 03:45:39,229 INFO L478 AbstractCegarLoop]: Abstraction has 62 states and 82 transitions. [2022-03-19 03:45:39,229 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-03-19 03:45:39,230 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 82 transitions. [2022-03-19 03:45:39,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-19 03:45:39,230 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 03:45:39,230 INFO L500 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 03:45:39,249 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-03-19 03:45:39,447 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-19 03:45:39,447 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 03:45:39,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 03:45:39,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1562772727, now seen corresponding path program 1 times [2022-03-19 03:45:39,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 03:45:39,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1749961228] [2022-03-19 03:45:39,450 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-03-19 03:45:39,450 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-03-19 03:45:39,450 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-03-19 03:45:39,450 INFO L85 PathProgramCache]: Analyzing trace with hash -1562772727, now seen corresponding path program 2 times [2022-03-19 03:45:39,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 03:45:39,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224410903] [2022-03-19 03:45:39,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 03:45:39,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 03:45:39,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 03:45:39,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 03:45:39,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 03:45:39,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-19 03:45:39,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 03:45:39,515 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 03:45:39,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 03:45:39,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224410903] [2022-03-19 03:45:39,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224410903] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 03:45:39,515 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 03:45:39,515 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-03-19 03:45:39,516 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 03:45:39,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1749961228] [2022-03-19 03:45:39,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1749961228] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 03:45:39,516 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 03:45:39,516 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-03-19 03:45:39,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022542821] [2022-03-19 03:45:39,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 03:45:39,516 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-19 03:45:39,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 03:45:39,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-19 03:45:39,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-03-19 03:45:39,517 INFO L87 Difference]: Start difference. First operand 62 states and 82 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-03-19 03:45:39,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 03:45:39,621 INFO L93 Difference]: Finished difference Result 75 states and 94 transitions. [2022-03-19 03:45:39,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-19 03:45:39,622 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2022-03-19 03:45:39,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 03:45:39,622 INFO L225 Difference]: With dead ends: 75 [2022-03-19 03:45:39,622 INFO L226 Difference]: Without dead ends: 41 [2022-03-19 03:45:39,623 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2022-03-19 03:45:39,623 INFO L912 BasicCegarLoop]: 24 mSDtfsCounter, 25 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-19 03:45:39,623 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 45 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-19 03:45:39,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-03-19 03:45:39,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 30. [2022-03-19 03:45:39,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-03-19 03:45:39,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2022-03-19 03:45:39,628 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 24 [2022-03-19 03:45:39,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 03:45:39,628 INFO L478 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2022-03-19 03:45:39,628 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-03-19 03:45:39,628 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2022-03-19 03:45:39,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-03-19 03:45:39,629 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 03:45:39,629 INFO L500 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 03:45:39,629 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-03-19 03:45:39,629 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 03:45:39,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 03:45:39,629 INFO L85 PathProgramCache]: Analyzing trace with hash 1181252787, now seen corresponding path program 1 times [2022-03-19 03:45:39,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 03:45:39,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1705530970] [2022-03-19 03:45:39,632 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-03-19 03:45:39,632 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-03-19 03:45:39,632 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-03-19 03:45:39,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1181252787, now seen corresponding path program 2 times [2022-03-19 03:45:39,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 03:45:39,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362751664] [2022-03-19 03:45:39,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 03:45:39,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 03:45:39,638 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-19 03:45:39,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [40250947] [2022-03-19 03:45:39,638 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-19 03:45:39,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-19 03:45:39,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-19 03:45:39,640 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-19 03:45:39,641 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-03-19 03:45:39,669 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-19 03:45:39,669 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-19 03:45:39,670 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-19 03:45:39,671 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-19 03:45:39,714 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-19 03:45:39,714 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-19 03:45:39,760 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 03:45:39,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 03:45:39,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362751664] [2022-03-19 03:45:39,760 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-19 03:45:39,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [40250947] [2022-03-19 03:45:39,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [40250947] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-19 03:45:39,760 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-19 03:45:39,760 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2022-03-19 03:45:39,761 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 03:45:39,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1705530970] [2022-03-19 03:45:39,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1705530970] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 03:45:39,761 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 03:45:39,761 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-19 03:45:39,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896454226] [2022-03-19 03:45:39,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 03:45:39,761 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-19 03:45:39,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 03:45:39,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-19 03:45:39,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-03-19 03:45:39,762 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-03-19 03:45:39,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 03:45:39,780 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2022-03-19 03:45:39,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-19 03:45:39,781 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 28 [2022-03-19 03:45:39,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 03:45:39,781 INFO L225 Difference]: With dead ends: 44 [2022-03-19 03:45:39,781 INFO L226 Difference]: Without dead ends: 32 [2022-03-19 03:45:39,782 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-03-19 03:45:39,782 INFO L912 BasicCegarLoop]: 25 mSDtfsCounter, 6 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-19 03:45:39,782 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 63 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-19 03:45:39,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-03-19 03:45:39,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-03-19 03:45:39,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 23 states have internal predecessors, (25), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-03-19 03:45:39,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2022-03-19 03:45:39,787 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 28 [2022-03-19 03:45:39,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 03:45:39,788 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2022-03-19 03:45:39,788 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-03-19 03:45:39,788 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2022-03-19 03:45:39,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-03-19 03:45:39,791 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 03:45:39,791 INFO L500 BasicCegarLoop]: trace histogram [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] [2022-03-19 03:45:39,809 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-03-19 03:45:40,003 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-19 03:45:40,004 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 03:45:40,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 03:45:40,004 INFO L85 PathProgramCache]: Analyzing trace with hash -1113182196, now seen corresponding path program 1 times [2022-03-19 03:45:40,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 03:45:40,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [988733349] [2022-03-19 03:45:40,006 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-03-19 03:45:40,006 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-03-19 03:45:40,006 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-03-19 03:45:40,006 INFO L85 PathProgramCache]: Analyzing trace with hash -1113182196, now seen corresponding path program 2 times [2022-03-19 03:45:40,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 03:45:40,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958072430] [2022-03-19 03:45:40,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 03:45:40,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 03:45:40,013 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-19 03:45:40,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1126898458] [2022-03-19 03:45:40,013 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-19 03:45:40,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-19 03:45:40,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-19 03:45:40,023 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-19 03:45:40,024 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-03-19 03:45:40,066 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-19 03:45:40,066 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-19 03:45:40,067 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-19 03:45:40,068 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-19 03:45:40,146 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-19 03:45:40,146 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-19 03:45:40,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 03:45:40,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958072430] [2022-03-19 03:45:40,147 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-19 03:45:40,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1126898458] [2022-03-19 03:45:40,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1126898458] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 03:45:40,147 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 03:45:40,147 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-19 03:45:40,147 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 03:45:40,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [988733349] [2022-03-19 03:45:40,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [988733349] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 03:45:40,147 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 03:45:40,147 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-19 03:45:40,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585228124] [2022-03-19 03:45:40,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 03:45:40,148 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-19 03:45:40,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 03:45:40,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-19 03:45:40,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-03-19 03:45:40,148 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-03-19 03:45:40,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 03:45:40,164 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2022-03-19 03:45:40,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-19 03:45:40,164 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2022-03-19 03:45:40,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 03:45:40,165 INFO L225 Difference]: With dead ends: 32 [2022-03-19 03:45:40,165 INFO L226 Difference]: Without dead ends: 0 [2022-03-19 03:45:40,165 INFO L911 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-03-19 03:45:40,167 INFO L912 BasicCegarLoop]: 23 mSDtfsCounter, 2 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-19 03:45:40,167 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 79 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-19 03:45:40,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-03-19 03:45:40,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-03-19 03:45:40,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-19 03:45:40,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-03-19 03:45:40,169 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 29 [2022-03-19 03:45:40,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 03:45:40,169 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-03-19 03:45:40,169 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-03-19 03:45:40,169 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-03-19 03:45:40,169 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-03-19 03:45:40,171 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-03-19 03:45:40,189 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-03-19 03:45:40,380 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-19 03:45:40,382 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-03-19 03:45:41,134 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 5) no Hoare annotation was computed. [2022-03-19 03:45:41,134 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 5) no Hoare annotation was computed. [2022-03-19 03:45:41,134 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 5) no Hoare annotation was computed. [2022-03-19 03:45:41,135 INFO L885 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 8 10) the Hoare annotation is: true [2022-03-19 03:45:41,135 INFO L885 garLoopResultBuilder]: At program point L9(line 9) the Hoare annotation is: true [2022-03-19 03:45:41,135 INFO L885 garLoopResultBuilder]: At program point L9-2(lines 8 10) the Hoare annotation is: true [2022-03-19 03:45:41,135 INFO L885 garLoopResultBuilder]: At program point assume_abort_if_notEXIT(lines 8 10) the Hoare annotation is: true [2022-03-19 03:45:41,135 INFO L878 garLoopResultBuilder]: At program point L31(lines 31 32) the Hoare annotation is: (let ((.cse0 (= main_~p~0 0)) (.cse1 (= main_~n~0 main_~r~0)) (.cse2 (= main_~h~0 0))) (or (and .cse0 .cse1 (<= 1 ~counter~0) .cse2 (= main_~q~0 1)) (not (<= |old(~counter~0)| 0)) (and (<= 2 ~counter~0) .cse0 .cse1 .cse2) (not (<= 0 |old(~counter~0)|)))) [2022-03-19 03:45:41,135 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 20 61) the Hoare annotation is: true [2022-03-19 03:45:41,135 INFO L878 garLoopResultBuilder]: At program point L52(lines 52 55) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (not (<= 0 |old(~counter~0)|))) [2022-03-19 03:45:41,135 INFO L878 garLoopResultBuilder]: At program point L52-2(lines 20 61) the Hoare annotation is: (let ((.cse0 (= main_~p~0 0)) (.cse1 (= main_~n~0 main_~r~0)) (.cse2 (= main_~h~0 0))) (or (not (<= |old(~counter~0)| 0)) (and (<= 2 ~counter~0) .cse0 .cse1 .cse2) (and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) .cse0 .cse1 .cse2 (= main_~q~0 1)) (not (<= 0 |old(~counter~0)|)))) [2022-03-19 03:45:41,136 INFO L878 garLoopResultBuilder]: At program point L44(lines 38 56) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (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) (= main_~n~0 main_~r~0) (= main_~h~0 0) (= main_~q~0 1)) (not (<= 0 |old(~counter~0)|))) [2022-03-19 03:45:41,136 INFO L878 garLoopResultBuilder]: At program point L40(line 40) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (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) (= main_~n~0 main_~r~0) (= main_~h~0 0) (= main_~q~0 1)) (not (<= 0 |old(~counter~0)|))) [2022-03-19 03:45:41,136 INFO L878 garLoopResultBuilder]: At program point L57(line 57) the Hoare annotation is: (let ((.cse0 (= main_~p~0 0)) (.cse1 (= main_~n~0 main_~r~0))) (or (and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) .cse0 .cse1 (= main_~q~0 1)) (not (<= |old(~counter~0)| 0)) (and (<= 2 ~counter~0) .cse0 .cse1 (= main_~h~0 0)) (not (<= 0 |old(~counter~0)|)))) [2022-03-19 03:45:41,136 INFO L878 garLoopResultBuilder]: At program point L24(line 24) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (and (<= 0 ~counter~0) (<= ~counter~0 0)) (not (<= 0 |old(~counter~0)|))) [2022-03-19 03:45:41,136 INFO L878 garLoopResultBuilder]: At program point L24-1(line 24) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (and (<= 0 ~counter~0) (<= ~counter~0 0)) (not (<= 0 |old(~counter~0)|))) [2022-03-19 03:45:41,136 INFO L878 garLoopResultBuilder]: At program point L41(line 41) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (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) (= main_~n~0 main_~r~0) (= main_~h~0 0) (= main_~q~0 1)) (not (<= 0 |old(~counter~0)|))) [2022-03-19 03:45:41,136 INFO L878 garLoopResultBuilder]: At program point L58(line 58) the Hoare annotation is: (let ((.cse0 (= main_~p~0 0))) (or (and .cse0 (= main_~h~0 0)) (and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) .cse0 (= main_~n~0 main_~r~0) (= main_~q~0 1)) (not (<= |old(~counter~0)| 0)) (not (<= 0 |old(~counter~0)|)))) [2022-03-19 03:45:41,137 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 20 61) the Hoare annotation is: true [2022-03-19 03:45:41,137 INFO L878 garLoopResultBuilder]: At program point L42(line 42) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (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) (= main_~n~0 main_~r~0) (= main_~h~0 0) (= main_~q~0 1)) (not (<= 0 |old(~counter~0)|))) [2022-03-19 03:45:41,137 INFO L878 garLoopResultBuilder]: At program point L38(lines 38 56) the Hoare annotation is: (let ((.cse0 (= main_~p~0 0)) (.cse1 (= main_~n~0 main_~r~0)) (.cse2 (= main_~h~0 0))) (or (not (<= |old(~counter~0)| 0)) (and (<= 2 ~counter~0) .cse0 .cse1 (<= 2 |main_#t~post6|) .cse2) (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_#t~post6| 1) .cse0 .cse1 .cse2 (= main_~q~0 1)) (not (<= 0 |old(~counter~0)|)))) [2022-03-19 03:45:41,137 INFO L878 garLoopResultBuilder]: At program point L38-2(lines 38 56) the Hoare annotation is: (let ((.cse0 (= main_~p~0 0)) (.cse1 (= main_~n~0 main_~r~0)) (.cse2 (= main_~h~0 0))) (or (not (<= |old(~counter~0)| 0)) (and (<= 2 ~counter~0) .cse0 .cse1 .cse2) (and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) .cse0 .cse1 .cse2 (= main_~q~0 1)) (not (<= 0 |old(~counter~0)|)))) [2022-03-19 03:45:41,137 INFO L878 garLoopResultBuilder]: At program point mainENTRY(lines 20 61) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (and (<= 0 ~counter~0) (<= ~counter~0 0)) (not (<= 0 |old(~counter~0)|))) [2022-03-19 03:45:41,137 INFO L878 garLoopResultBuilder]: At program point L30-1(lines 30 35) the Hoare annotation is: (let ((.cse0 (<= (+ |main_#t~post5| 1) ~counter~0)) (.cse1 (= main_~p~0 0)) (.cse2 (= main_~n~0 main_~r~0)) (.cse3 (= main_~h~0 0))) (or (and (<= 2 ~counter~0) .cse0 .cse1 .cse2 .cse3) (not (<= |old(~counter~0)| 0)) (and .cse0 .cse1 .cse2 (<= 1 ~counter~0) .cse3 (= main_~q~0 1)) (not (<= 0 |old(~counter~0)|)))) [2022-03-19 03:45:41,137 INFO L878 garLoopResultBuilder]: At program point L30-3(lines 30 35) the Hoare annotation is: (let ((.cse0 (= main_~p~0 0)) (.cse1 (= main_~n~0 main_~r~0)) (.cse2 (= main_~h~0 0))) (or (and .cse0 .cse1 (<= 1 ~counter~0) .cse2) (not (<= |old(~counter~0)| 0)) (and .cse0 .cse1 (<= 0 ~counter~0) .cse2 (= main_~q~0 1)) (not (<= 0 |old(~counter~0)|)))) [2022-03-19 03:45:41,137 INFO L885 garLoopResultBuilder]: At program point L59(line 59) the Hoare annotation is: true [2022-03-19 03:45:41,138 INFO L878 garLoopResultBuilder]: At program point L43(line 43) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (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) (= main_~n~0 main_~r~0) (= main_~h~0 0) (= main_~q~0 1)) (not (<= 0 |old(~counter~0)|))) [2022-03-19 03:45:41,138 INFO L878 garLoopResultBuilder]: At program point L39(line 39) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (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) (= main_~n~0 main_~r~0) (= main_~h~0 0) (= main_~q~0 1)) (not (<= 0 |old(~counter~0)|))) [2022-03-19 03:45:41,138 INFO L878 garLoopResultBuilder]: At program point L39-1(line 39) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (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) (= main_~n~0 main_~r~0) (= main_~h~0 0) (= main_~q~0 1)) (not (<= 0 |old(~counter~0)|))) [2022-03-19 03:45:41,138 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: (and (<= 0 ~counter~0) (<= ~counter~0 0)) [2022-03-19 03:45:41,138 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-03-19 03:45:41,138 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: (and (<= 0 ~counter~0) (<= ~counter~0 0)) [2022-03-19 03:45:41,138 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-03-19 03:45:41,138 INFO L878 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: (and (<= 0 ~counter~0) (<= ~counter~0 0)) [2022-03-19 03:45:41,138 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-03-19 03:45:41,138 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-03-19 03:45:41,139 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 11 17) the Hoare annotation is: true [2022-03-19 03:45:41,139 INFO L878 garLoopResultBuilder]: At program point L13(lines 13 14) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-03-19 03:45:41,139 INFO L878 garLoopResultBuilder]: At program point L12(lines 12 15) the Hoare annotation is: (and (or (not (<= 1 |__VERIFIER_assert_#in~cond|)) (<= 1 __VERIFIER_assert_~cond)) (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0)))) [2022-03-19 03:45:41,139 INFO L878 garLoopResultBuilder]: At program point L12-2(lines 11 17) the Hoare annotation is: (and (or (not (<= 1 |__VERIFIER_assert_#in~cond|)) (<= 1 __VERIFIER_assert_~cond)) (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0)))) [2022-03-19 03:45:41,139 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 11 17) the Hoare annotation is: (and (or (not (<= 1 |__VERIFIER_assert_#in~cond|)) (<= 1 __VERIFIER_assert_~cond)) (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0)))) [2022-03-19 03:45:41,139 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 14) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-03-19 03:45:41,142 INFO L718 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 2, 2, 2, 2, 2] [2022-03-19 03:45:41,143 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-19 03:45:41,155 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.03 03:45:41 BoogieIcfgContainer [2022-03-19 03:45:41,155 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-19 03:45:41,156 INFO L158 Benchmark]: Toolchain (without parser) took 16559.92ms. Allocated memory was 181.4MB in the beginning and 299.9MB in the end (delta: 118.5MB). Free memory was 126.7MB in the beginning and 253.7MB in the end (delta: -127.0MB). Peak memory consumption was 146.3MB. Max. memory is 8.0GB. [2022-03-19 03:45:41,156 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 181.4MB. Free memory was 143.2MB in the beginning and 143.1MB in the end (delta: 109.5kB). There was no memory consumed. Max. memory is 8.0GB. [2022-03-19 03:45:41,156 INFO L158 Benchmark]: CACSL2BoogieTranslator took 237.87ms. Allocated memory is still 181.4MB. Free memory was 126.5MB in the beginning and 156.5MB in the end (delta: -30.0MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-03-19 03:45:41,156 INFO L158 Benchmark]: Boogie Preprocessor took 32.84ms. Allocated memory is still 181.4MB. Free memory was 156.5MB in the beginning and 155.1MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-19 03:45:41,157 INFO L158 Benchmark]: RCFGBuilder took 412.38ms. Allocated memory is still 181.4MB. Free memory was 155.1MB in the beginning and 142.9MB in the end (delta: 12.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-03-19 03:45:41,157 INFO L158 Benchmark]: TraceAbstraction took 15872.62ms. Allocated memory was 181.4MB in the beginning and 299.9MB in the end (delta: 118.5MB). Free memory was 142.1MB in the beginning and 253.7MB in the end (delta: -111.6MB). Peak memory consumption was 160.7MB. Max. memory is 8.0GB. [2022-03-19 03:45:41,158 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 181.4MB. Free memory was 143.2MB in the beginning and 143.1MB in the end (delta: 109.5kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 237.87ms. Allocated memory is still 181.4MB. Free memory was 126.5MB in the beginning and 156.5MB in the end (delta: -30.0MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 32.84ms. Allocated memory is still 181.4MB. Free memory was 156.5MB in the beginning and 155.1MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 412.38ms. Allocated memory is still 181.4MB. Free memory was 155.1MB in the beginning and 142.9MB in the end (delta: 12.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 15872.62ms. Allocated memory was 181.4MB in the beginning and 299.9MB in the end (delta: 118.5MB). Free memory was 142.1MB in the beginning and 253.7MB in the end (delta: -111.6MB). Peak memory consumption was 160.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 14]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 42 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 15.8s, OverallIterations: 9, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 11.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.8s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 4 mSolverCounterUnknown, 101 SdHoareTripleChecker+Valid, 11.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 90 mSDsluCounter, 986 SdHoareTripleChecker+Invalid, 11.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 637 mSDsCounter, 76 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 346 IncrementalHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 76 mSolverCounterUnsat, 349 mSDtfsCounter, 346 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 216 GetRequests, 171 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=62occurred in iteration=6, InterpolantAutomatonStates: 51, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 15 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 39 LocationsWithAnnotation, 501 PreInvPairs, 590 NumberOfFragments, 843 HoareAnnotationTreeSize, 501 FomulaSimplifications, 104 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 39 FomulaSimplificationsInter, 724 FormulaSimplificationTreeSizeReductionInter, 0.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: (((((p == 0 && n == r) && 1 <= counter) && h == 0) || !(\old(counter) <= 0)) || ((((p == 0 && n == r) && 0 <= counter) && h == 0) && q == 1)) || !(0 <= \old(counter)) - ProcedureContractResult [Line: 8]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not: 1 - ProcedureContractResult [Line: 20]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 11]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: (!(1 <= \old(cond)) || 1 <= cond) && (\old(cond) == 0 || !(cond == 0)) RESULT: Ultimate proved your program to be correct! [2022-03-19 03:45:41,188 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...